![]() |
![]() |
#1 |
Jan 2017
5 Posts |
![]()
I have run prime95 for several years, as many of you, I didn't find one prime, that makes me a little disappointed.
At the same time, I do some research on Fibonacci prime, it seems a little easier to find one prime or PRP. There are 15 PRP and 34 primes , 49 totally until now. Could someone set up a project for Fibonacci prime like GIMPS? |
![]() |
![]() |
![]() |
#2 | |
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#3 | |
Feb 2017
Nowhere
32·643 Posts |
![]() Quote:
Fa | Fab, Fa > 1 for a > 2, F2k = Fk*Lk, and Lk > 1 for k > 1, it is clear that Fn can be prime only if n = 4, or if n is prime. I did find a page of Possible Fibonacci Primes listing some large Fibonacci PRP's, but it hasn't been updated in 11 years... |
|
![]() |
![]() |
![]() |
#4 | |
Sep 2002
Database er0rr
5·829 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#5 |
(loop (#_fork))
Feb 2006
Cambridge, England
144658 Posts |
![]()
The problem is that Fibonacci numbers aren't the right shape for group-theoretic primality proofs, and nobody's seriously interested in finding large PRPs.
|
![]() |
![]() |
![]() |
#6 | |
Sep 2009
2,333 Posts |
![]() Quote:
Chris |
|
![]() |
![]() |
![]() |
#7 | |
Feb 2017
Nowhere
32×643 Posts |
![]() Quote:
See, e,g, posts 2201 and 2205 to the thread NFS@Home. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
What is the biggest Fibonacci prime number? | George M | Lounge | 20 | 2018-01-03 16:04 |
Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
i am doing a reasearch project on GIMPS | serge2k | Homework Help | 1 | 2010-03-25 02:24 |
Fibonacci modulo Fibonacci | robert44444uk | Math | 3 | 2007-05-19 07:15 |
A distributed-computing project to optimize GIMPS FFT? Genetic algorithms | GP2 | Software | 10 | 2003-12-09 20:41 |