Timeline for Arbitrarily large $n$ divides $F_n$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2014 at 21:24 | vote | accept | shapi | ||
| Aug 27, 2014 at 3:02 | review | First posts | |||
| Aug 27, 2014 at 6:52 | |||||
| Aug 20, 2014 at 15:45 | vote | accept | shapi | ||
| Nov 2, 2014 at 21:24 | |||||
| Aug 20, 2014 at 15:20 | answer | added | user41593 | timeline score: 14 | |
| Aug 20, 2014 at 15:00 | comment | added | shapi | That's the reason I changed the question, as I realized on the spot the many ways to answer that. | |
| Aug 20, 2014 at 14:48 | comment | added | David E Speyer | To respond to the original version which didn't ask for infinitely many prime factors, $F_{5(2n+1)} = 5 (5 F_{2n+1}^5 - 5 F_{2n+1}^3 + F_{2n+1})$ so we can show inductively that $5^k | F_{5^k}$. | |
| Aug 20, 2014 at 14:46 | history | edited | shapi | CC BY-SA 3.0 |
added 17 characters in body
|
| Aug 20, 2014 at 14:38 | history | asked | shapi | CC BY-SA 3.0 |