![]() |
|
|
#12 | |
|
Aug 2006
22×3×499 Posts |
Quote:
|
|
|
|
|
|
|
#13 | |
|
Romulan Interpreter
"name field"
Jun 2011
Thailand
101000001100112 Posts |
Quote:
This will record the found terms, so they do not get lost, and not only will mark the fact that some unknown terms may lay in between, but will also tickle the reader's curiosity so they will want to investigate the gaps and who knows? maybe fill them in, or eliminate the doubt... |
|
|
|
|
|
|
#14 | |
|
"Forget I exist"
Jul 2009
Dartmouth NS
204158 Posts |
Quote:
|
|
|
|
|
|
|
#15 | |
|
Dec 2017
2·52 Posts |
Quote:
|
|
|
|
|
|
|
#16 |
|
Aug 2006
22·3·499 Posts |
|
|
|
|
|
|
#17 | |
|
Dec 2017
5010 Posts |
Quote:
From this, could we perhaps raise an upper bound on n? For instance, is there a way of mathematically showing the largest value of n < k such that F(n) is prime? I have made an attempt of trying to look at a pattern of the last digits of the fibonnaci numbers. Of course, if they are odd, then the fibonnaci number with that odd last digit stands a chance of being prime. Through my work, I noticed that the final digits of the fibonnaci sequence have a cycle length of 60. For example, the first few fibonnaci numbers in the sequence are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … So the sequence of the last digits would be in this case 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9. But why must this sequence have a cycle length of 60? Well, 60 is the smallest number to be divisible by all the numbers from 1 to 6 (it is a weak factorial of 6) and the first 6 fibonnaci numbers represent its own last digit... hmmm... maybe that’s the reason? Any suggestions? Last fiddled with by George M on 2018-01-03 at 06:15 Reason: Improved punctuation and grammar. |
|
|
|
|
|
|
#18 |
|
"Serge"
Mar 2008
San Diego, Calif.
32·7·163 Posts |
|
|
|
|
|
|
#19 | |
|
Dec 2017
2×52 Posts |
Quote:
https://m.youtube.com/watch?v=Nu-lW-Ifyec Thank you for showing me that link :) |
|
|
|
|
|
|
#20 | |
|
Jun 2003
23×683 Posts |
Quote:
|
|
|
|
|
|
|
#21 | |
|
Aug 2006
22×3×499 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| GIMPS and Fibonacci prime project? | Shen | Information & Answers | 6 | 2017-10-25 20:59 |
| Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | sweety439 | 17 | 2017-06-13 03:49 |
| Fibonacci number as sum of cubes | jux | Miscellaneous Math | 15 | 2015-08-30 06:21 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| Fibonacci modulo Fibonacci | robert44444uk | Math | 3 | 2007-05-19 07:15 |