Timeline for Lengths of continued fractions for the numbers with fixed ratio
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2010 at 22:28 | vote | accept | Alexey Ustinov | ||
| Oct 9, 2010 at 13:10 | comment | added | Fedor Petrov | @Nikita It is not Euclid algorithm for 2p/3q at all :), and all the proofs I know are quite non-trivial, though some of them are respectively short. | |
| Oct 9, 2010 at 13:06 | answer | added | Fedor Petrov | timeline score: 8 | |
| Oct 9, 2010 at 12:07 | comment | added | Alexey Ustinov | Yes, it is more or less clear. It is not surprising. It is not hard. But was it already proved or not? | |
| Oct 9, 2010 at 10:49 | comment | added | Nikita Sidorov | I would be really surprised if it wasn't. After all, for l(x) this is just the length of the Euclid algorithm for x=p/q, so if we, say, multiply it by 2/3, then it is just the Euclid algorithm for 2p/3q... must be well known. Perhaps, even Euclid himself knew it. ;) | |
| Oct 9, 2010 at 2:15 | history | asked | Alexey Ustinov | CC BY-SA 2.5 |