7 citations · 11 across the 15 of their papers we have counts for
9 papers · 2 filters
Three term recurrence and residue completeness
Cheng Lien Lang, Mong Lung Lang
We study the three term recurrence modulo m. In particular, we prove that Pell numbers modulo m is residue complete if and only m is 2, a power of 3, or a power of 5. Pell-Lucas nu…
Generalised Binomial coefficients and Jarden's Theorem
Cheng Lien Lang, Mong Lung Lang
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions
Fibonacci numbers and Trivalent graphs
Cheng Lien Lang, Mong Lung Lang
We study the Fibonacci and Lucas numbers and demonstrate how identities can be constructed by investigating trivalent graphs and splitting fields.
Galois Identities of the three term recurrence
Cheng Lien Lang, Mong Lung Lang
We study the existence of the identity L_n^2 -5F_n^2 = 4(-1)^n.
Recurrence for powers of recursive sequence II
Cheng Lien Lang, Mong Lung Lang
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
Fibonacci Numbers and Identities II
Cheng Lien Lang, Mong Lung Lang
We give alternative proof of Melham's and Howard's identities on generalised Fibonacci numbers