2013/04/10 by Cheng Lien Lang, Lang, Cheng Lien, Mong Lung Lang +1
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.1304.2892
We revise the article and give a direct proof of the main results
openalex publication_date 2013/04/10 · arxiv created 2013/07/11 · arxiv updated 2013/07/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 if m = 2,4,6,7,14 or a power of 3.