Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On Fibonacci and Pell numbers of the form \(kx^2\). (Almost every term has a \(4r+1\) prime factor). - MaRDI portal

On Fibonacci and Pell numbers of the form \(kx^2\). (Almost every term has a \(4r+1\) prime factor). (Q2785026)

From MaRDI portal





scientific article; zbMATH DE number 1733238
Language Label Description Also known as
English
On Fibonacci and Pell numbers of the form \(kx^2\). (Almost every term has a \(4r+1\) prime factor).
scientific article; zbMATH DE number 1733238

    Statements

    0 references
    2002
    0 references
    Fibonacci numbers
    0 references
    Pell numbers
    0 references
    On Fibonacci and Pell numbers of the form \(kx^2\). (Almost every term has a \(4r+1\) prime factor). (English)
    0 references
    It was shown that neither the Fibonacci nor the Pell number sequence has terms of the form \(px^2\) for prime \(p\equiv 3\pmod 4\), with one exception in each sequence. The main idea of showing this can be used to prove a stronger result; namely, that, with a small number of exceptions, neither sequence has terms of the form \(kx^2\) if \(k\) is an integer all of whose prime factors are congruent to 3 modulo 4. An interesting corollary is that, with 11 exceptions, every term of the Fibonacci sequence has a prime factor of the form \(4r+1\) and, similarly, with 5 exceptions, for the Pell sequence.
    0 references

    Identifiers