Re: Testing for Primes

"Cryptoad" wrote in message
news:[EMAIL PROTECTED]
>
>               Another Test for Primes
>
>                 William J. Wilson
>
> A simple test for primes can be accomplished as follows: if
> an odd number i is the candidate prime, compute the ith
> Fibonacci number F.  If either F+1 or F-1 is evenly divisible
> by i, then i is prime.
>
> [Note from Moderator: I queried this result and
> was told that it doesn't work for 5, or even
> numbers. -- GR.]

How is this interesting other than determining whether a
Fibonacci number is a prime? That is, there are numerous
primes that are not Fibonacci numbers.

Daniel