Timeline for Kronecker Approximation theorem and Fibonacci numbers
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2011 at 19:33 | answer | added | Asaf | timeline score: 5 | |
| Jun 13, 2011 at 21:30 | history | edited | Ostap Chervak |
edited tags; edited tags
|
|
| Apr 4, 2011 at 15:41 | comment | added | Charles | Presumably Nick meant 'irrational unless the (reduced) denominator is a power of two' to exclude trivial cases like 17. | |
| Apr 3, 2011 at 20:59 | history | edited | Ostap Chervak |
edited tags
|
|
| Mar 11, 2011 at 18:02 | history | edited | Ostap Chervak | CC BY-SA 2.5 |
edited title
|
| Mar 11, 2011 at 13:49 | vote | accept | Ostap Chervak | ||
| Mar 11, 2011 at 4:51 | comment | added | Gerry Myerson | @Nick, why must $\alpha$ be irrational? If $\alpha$ is, say, 17, then there are certainly integers $n$ such that $\alpha n^2$ is within $\epsilon$ of an integer (ditto for $2^n\alpha$ or $F_n\alpha$). | |
| Mar 11, 2011 at 1:17 | comment | added | Nick S | $\alpha$ has to be irational. | |
| Mar 11, 2011 at 0:35 | answer | added | Nikita Sidorov | timeline score: 12 | |
| Mar 10, 2011 at 23:31 | answer | added | Gerry Myerson | timeline score: 7 | |
| Mar 10, 2011 at 22:53 | history | asked | Ostap Chervak | CC BY-SA 2.5 |