On factorials expressible as sums of at most three Fibonacci numbers (Q4933550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-factorial diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Non-Zero Digits of <i>n</i>! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of factorials in binary recurrence sequences / rank
 
Normal rank

Revision as of 07:33, 3 July 2024

scientific article; zbMATH DE number 5799527
Language Label Description Also known as
English
On factorials expressible as sums of at most three Fibonacci numbers
scientific article; zbMATH DE number 5799527

    Statements

    On factorials expressible as sums of at most three Fibonacci numbers (English)
    0 references
    0 references
    0 references
    14 October 2010
    0 references
    Diophantine equation
    0 references
    Fibonacci numbers
    0 references
    Lucas numbers
    0 references
    Chebyshev's function
    0 references
    factorials
    0 references
    exponential equation
    0 references

    Identifiers