On the factorization of Lucas numbers

MaRDI QIDQ2735215zbMATH OpenFDO

Authors Wayne L. McDaniel

Publication date 3 September 2002

Published in The Fibonacci Quarterly (Search for Journal in Brave)

zbMATH Keywords

factorizationLucas numbers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

Let \(L_n= r(r+k)\), where \(L_n\) denotes the \(n\)th Lucas number. The author shows that for a given value of \(k\), there are at most finitely many corresponding values of \(n\). He also finds upper bounds for \(n\) in terms of \(k\) when \(k\) belongs to any one of eight congruence classes \((\operatorname {mod}25)\).

Recommendations

• On the complex factorization of the Lucas sequence
• scientific article; zbMATH DE number 1022824
• Factorization of Fibonacci numbers into products of Lucas numbers and related results
• Counting divisors of Lucas numbers
• On the k-Lucas numbers
• Lucas numbers and determinants
• scientific article; zbMATH DE number 1222548
• scientific article; zbMATH DE number 5189237

Cited in

(6)

• On the l.c.m. of shifted Lucas numbers
• Lucas factoriangular numbers.
• scientific article; zbMATH DE number 1022824 (Why is no real title available?)
• scientific article; zbMATH DE number 1560308 (Why is no real title available?)
• scientific article; zbMATH DE number 7007678 (Why is no real title available?)
• On the complex factorization of the Lucas sequence

This page was built for publication: On the factorization of Lucas numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735215)