Timeline for Nontrivial question about Fibonacci numbers?
Current License: CC BY-SA 3.0
45 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 26, 2020 at 6:19 | answer | added | Mustafa Said | timeline score: 0 | |
| Nov 26, 2020 at 3:04 | history | edited | José Hdz. Stgo. |
edited tags
|
|
| Nov 25, 2019 at 11:33 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Nov 30, 2018 at 5:20 | answer | added | Alexey Ustinov | timeline score: 3 | |
| Nov 29, 2018 at 17:56 | answer | added | tarit goswami | timeline score: 1 | |
| Sep 13, 2016 at 3:29 | answer | added | Noam D. Elkies | timeline score: 7 | |
| Sep 13, 2016 at 1:42 | answer | added | Per Alexandersson | timeline score: 0 | |
| Sep 12, 2016 at 22:12 | comment | added | Amin235 | @Donald Please see the following article: jist.ir/WebUsers/jist/UploadFiles/OK/139308105-F.pdf | |
| Sep 12, 2016 at 21:48 | answer | added | Amin235 | timeline score: 0 | |
| Sep 12, 2016 at 19:33 | answer | added | T. Amdeberhan | timeline score: 2 | |
| Apr 30, 2015 at 17:23 | answer | added | Ofir Gorodetsky | timeline score: 7 | |
| Apr 30, 2015 at 13:42 | history | edited | Gerry Myerson |
edited tags
|
|
| Apr 30, 2015 at 7:04 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
deleted 7 characters in body; edited tags; edited title
|
| Feb 19, 2012 at 12:21 | comment | added | JeffE | A better question: Give algorithms to increment and decrement Fibo-binary numbers in constant amortized time. (Zeckendorf is no longer enough.) | |
| Feb 19, 2012 at 2:16 | answer | added | Noam D. Elkies | timeline score: 10 | |
| Dec 5, 2010 at 18:36 | answer | added | Nick S | timeline score: 4 | |
| Dec 5, 2010 at 9:50 | answer | added | Andrey Rekalo | timeline score: 22 | |
| Nov 22, 2010 at 20:36 | answer | added | darij grinberg | timeline score: 10 | |
| Nov 19, 2010 at 22:03 | answer | added | Gottfried Helms | timeline score: 4 | |
| Nov 19, 2010 at 18:03 | answer | added | Mike Spivey | timeline score: 5 | |
| Nov 19, 2010 at 8:03 | answer | added | Johann Cigler | timeline score: 7 | |
| Nov 18, 2010 at 18:27 | answer | added | Richard Stanley | timeline score: 11 | |
| Nov 18, 2010 at 16:06 | answer | added | Tyler Clark | timeline score: 3 | |
| Apr 9, 2010 at 3:47 | answer | added | Amy Glen | timeline score: 5 | |
| Apr 8, 2010 at 21:42 | answer | added | Mark Biggar | timeline score: 4 | |
| Jan 18, 2010 at 10:52 | answer | added | Kevin Buzzard | timeline score: 26 | |
| Jan 17, 2010 at 0:03 | answer | added | José Hdz. Stgo. | timeline score: 24 | |
| Jan 16, 2010 at 8:02 | comment | added | José Hdz. Stgo. | Ever heard of Zeckendorf's theorem? | |
| Jan 16, 2010 at 7:28 | answer | added | José Hdz. Stgo. | timeline score: 52 | |
| Jan 15, 2010 at 20:50 | vote | accept | Donald | ||
| Jan 15, 2010 at 19:17 | answer | added | David Eppstein | timeline score: 4 | |
| Jan 15, 2010 at 19:13 | answer | added | Gerhard Paseman | timeline score: 7 | |
| Jan 15, 2010 at 18:38 | comment | added | user1073 | It's probably too 'researchy' for an undergrad course, but Florian Luca has a fantastic proof that no Fibonacci number is a perfect number (i.e. a number n such that sigma(n)=2n). You can read the paper here: springerlink.com/content/808137547w5621p7/fulltext.pdf | |
| Jan 15, 2010 at 18:37 | answer | added | Qiaochu Yuan | timeline score: 12 | |
| Jan 15, 2010 at 18:32 | answer | added | Nurdin Takenov | timeline score: 8 | |
| Jan 15, 2010 at 18:26 | comment | added | Dan Piponi | I like your example. What's not so good about it? | |
| Jan 15, 2010 at 18:16 | answer | added | Zev Chonoles | timeline score: 38 | |
| Jan 15, 2010 at 18:15 | comment | added | Nurdin Takenov | what does mean nontrivial? For example, the fact that 5^n always divides F_{5^n} - is it trivial or not? | |
| Jan 15, 2010 at 18:13 | comment | added | Donald | Good examples of either sort of question are appreciated. | |
| Jan 15, 2010 at 18:11 | comment | added | Pete L. Clark | There are two kinds of such questions: one in which Fibonacci numbers appear in the statement, and another in which they do not and for which realizing that they are involved is a key to the answer. (Example of the second kind: how many sequences of coin flips of length $n$ have no instances of tails appearing twice in a row?) Which type do you have in mind, or are you indifferent? | |
| Jan 15, 2010 at 18:03 | comment | added | Steve Huntsman | In particular, your question a) is question 34 in Knuth. | |
| Jan 15, 2010 at 17:58 | comment | added | Steve Huntsman | For a whole raft of such questions, see 1.2.8 of Knuth's The Art of Computer Programming, vol. 1. | |
| Jan 15, 2010 at 17:56 | answer | added | gowers | timeline score: 7 | |
| Jan 15, 2010 at 17:55 | comment | added | Steve Huntsman | You might be interested in Dyson and Falk's paper "Period of a Discrete Cat Mapping" at jstor.org/pss/2324989 | |
| Jan 15, 2010 at 17:49 | history | asked | Donald | CC BY-SA 2.5 |