Timeline for Applications of finite continued fractions
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2018 at 4:03 | comment | added | მამუკა ჯიბლაძე | I wonder whether there is an analogue of this for rational functions - say given a series expansion with algorithmically given coefficients, whether one may detect a linear recurrence if one of the convergents is suddenly divisible by a very high power of the variable or something like that... | |
| Jan 18, 2014 at 9:14 | comment | added | Steven Stadnicki | Another version of this is the 'batting average' problem, as it appears in Knuth's The Art of Computer Programming (vol. 2): what's the fewest number of at bats a baseball player can have if their average (rounded to 3 decimals) is .334? (The solution proceeds by computing the CFs for $.3335 = 667/2000 = [0; 2, 1, 666]$ and $.3345 = 669/2000 = [0; 2, 1, 94, 1, 1, 3]$ - the correct answer is then found by finding the fraction for the 'simplest' number in that range, $[0; 2, 1, 95]$ - namely, $\frac{96}{287}\approx 0.334495$.) | |
| Feb 20, 2011 at 6:53 | comment | added | Alexey Ustinov | Let me add this application to the trivial list. | |
| Jan 3, 2011 at 16:21 | history | answered | Andreas Blass | CC BY-SA 2.5 |