31 citations
- National Taiwan UniversityTW2 papers
- National Yang Ming Chiao Tung UniversityTW2 papers
- Digital CatapultGB1 paper
- E-Da HospitalTW1 paper
- Institute of Mathematics, Academia SinicaTW1 paper
- National Taiwan Normal UniversityTW1 paper
- Peking UniversityCN1 paper
- Shanghai Jiao Tong UniversityCN1 paper
- UCL Biomedical Research CentreGB1 paper
- Universidade Estadual Paulista (Unesp)BR1 paper
- University College HospitalGB1 paper
- University College LondonGB1 paper
5 papers · 1 filter
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
Recurrence of Products of Linear Recursive Functions
Cheng Lien Lang, Mong Lung Lang
We study the recurrence of the product of n functions, each of which satisfies the same recurrence relation.
On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach
Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo +1
This paper studies the on-line choice number on complete multipartite graphs with independence number . We give a unified strategy for every prescribed . Our main result lead…
Fibonacci system and residue completeness
Cheng Lien Lang, Mong Lung Lang
We give necessary and sufficient conditions for a Fibonacci cycle to be residue complete (nondefective). In particular, the Lucas numbers modulo m is residue complete if and only i…