2017/09/19 by Hao Zhong, Tianxin Cai, Zhong, Hao +1
Mathematics · Physics and Astronomy · #Advanced Mathematical Identities #Advanced Mathematical Theories and Applications #Benford’s Law and Fraud Detection #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1709.06337
openalex publication_date 2017/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article, we consider the Diophantine equation σ2(n)-n2=An+B with A=P2±2. For some B, we show that except for finitely many computable solutions in the range n≤(|A|+|B|)3, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences.