On Fibonacci numbers with few prime divisors (Q2577611): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053340222 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Magma algebra system. I: The user language / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Squares in some recurrent sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5772619 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4936084 / rank | |||
Normal rank |
Latest revision as of 14:38, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Fibonacci numbers with few prime divisors |
scientific article |
Statements
On Fibonacci numbers with few prime divisors (English)
0 references
3 January 2006
0 references
Three of these authors, \textit{Y. Bugeaud}, \textit{M. Mignotte} and \textit{S. Siksek} proved in an earlier paper [Classical and modular approaches to exponential Diophantine equations. II: The Lebesgue-Nagell equation, Compos. Math. 142, No. 1, 31--62 (2006; Zbl 1128.11013)] that \(F_n= y^m\), \(y\) a positive integer, \(m> 2\), has a solution only when \(F_n= 0,1,8\), and \(144\), and \(L_n= y^p\), \(y\) a positive integer, \(p\geq 2\), only when \(L_n= 1\) and \(4\). The proofs depend on the use of powerful techniques such as Baker's method and extensive computer verification. Using these results they show here that \(\omega(F_n)\geq 3\) for almost all \(n\) where \(\omega(m)\), \(m\) a positive integer, is the number of distinct prime divisors of \(m\), that is, Fibonacci numbers rarely have few prime factors. Further, \(\omega(F_n)\geq(\log n)^{\log 2+ o(1)}\) for almost all \(n\). They then conjecture that \(\omega(F_n)\gg\log n\) for composite \(n\) and support this with a heuristic argument.
0 references
Fibonacci numbers
0 references
0 references