Timeline for Applications of finite continued fractions
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2011 at 15:19 | comment | added | Wilberd van der Kallen | For me the continued fraction algorithm for approximating a rational number is really finite. It stops. My contribution is the proof of a theorem. It is not about how to construct something. The theorem is about lattice points. It would be wrong for real points. The proof exploits well known geometric properties of the continued fraction algorithm. | |
| Feb 21, 2011 at 3:13 | comment | added | Alexey Ustinov | As I understand you algorithm is not really finite. You can solve Hesselink's problem for any real points. You use geometrical inerpretation of continued fractions. And this approach is more general (see discussion on How to find a closest integer point to intersection of two lines? here mathoverflow.net/questions/22777/… Generalisation of continued fraction algorithm on inhomogeneous case also known as Delone's “divided cells” algorithm, but details are not cleare for me. | |
| Feb 20, 2011 at 10:00 | history | edited | Wilberd van der Kallen | CC BY-SA 2.5 |
added 3 characters in body; added 6 characters in body
|
| Feb 20, 2011 at 9:52 | history | answered | Wilberd van der Kallen | CC BY-SA 2.5 |