Fibonacci factoriangular numbers (Q2012569): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60692193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers / 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: On Square Fibonacci Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5811293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4493424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci Series Modulo m / rank
 
Normal rank

Latest revision as of 04:33, 14 July 2024

scientific article
Language Label Description Also known as
English
Fibonacci factoriangular numbers
scientific article

    Statements

    Fibonacci factoriangular numbers (English)
    0 references
    0 references
    1 August 2017
    0 references
    A recent conjecture is proved asserting that \(2, 5\), and \(34\) are the only Fibonacci numbers that are of the form \(n! + n(n+1)/2\) for some integer \(n\). The main tool to prove it is an upper bound for a non-zero \(p\)-adic linear form in two logarithms of algebraic numbers. Computer checking (some brief and some extensive) is indispensable for the proof.
    0 references
    Fibonacci numbers
    0 references
    factoriangular numbers
    0 references
    \(p\)-adic linear forms in logarithms of algebraic numbers
    0 references

    Identifiers