"Ian L McLoughlin" [EMAIL PROTECTED] asks
Since the list is quiet...
Does a Fibonnacci series contain a finite or an infinite number of primes?
From what I understand..
In a gen.F sequence if the first two numbers are divisible by a prime all
its numbers are divisible by the same prime, if
François Perruchaud wrote:
An old book of mine gives without proof an example of Fibonacci Sequence
that countains no primes, but where U(1) and U(2) are co-prime.
The sequence was found by R. L. Graham.
Reference :
"A Fibonacci-like sequence of composite numbers",
R.L. Graham, Math. Mag. 37,
An old book of mine gives without proof an example of Fibonacci Sequence
that countains no primes, but where U(1) and U(2) are co-prime.
The sequence was found by R. L. Graham.
Reference :
"A Fibonacci-like sequence of composite numbers",
R.L. Graham, Math. Mag. 37, 1964.
U(1) =
At 04:50 PM 12/18/99 +0100, François Perruchaud wrote:
An old book of mine gives without proof an
example of Fibonacci Sequence
that countains no primes, but where U(1) and U(2) are co-prime.
The sequence was found by R. L. Graham.
Reference :
A Fibonacci-like sequence of composite numbers,
R.L.
Hi folks
U(1) = 1786772701928802632268715130455793
U(2) = 1059683225053915111058165141686995
U(N+2) = U(N+1) + U(N)
I checked a few thousand terms, and they were all composite.
There is almost certainly a 'covering set' of divisors. In essence you need
to find a set of primes P and a modulus M,
Since the list is quiet...
Does a Fibonnacci series contain a finite or an infinite number of primes?
From what I understand..
In a gen.F sequence if the first two numbers are divisible by a prime all
its numbers are divisible by the same prime, if the first two numbers are
co-prime is there a
