Talk:Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2): Difference between revisions
Content added Content deleted
(Idiomaticity?) |
(→Non-unique solutions: new section) |
||
| Line 4: | Line 4: | ||
You might also like to refactor a bit so that the code to print out a sequence is a shared method. That's the sort of thing that makes an excellent candidate for not being written out every time. –[[User:Dkf|Donal Fellows]] 12:10, 10 March 2013 (UTC) |
You might also like to refactor a bit so that the code to print out a sequence is a shared method. That's the sort of thing that makes an excellent candidate for not being written out every time. –[[User:Dkf|Donal Fellows]] 12:10, 10 March 2013 (UTC) |
||
== Non-unique solutions == |
|||
The solutions in C++ and Tcl have different answers to the computation of <math>[1;5,2] - [3;7]</math>, but if you work the sequences out they are the same actual fraction; ''both are correct''. I suspect this is due to differences of rounding semantics with mixed-sign integer division. –[[User:Dkf|Donal Fellows]] 10:22, 11 March 2013 (UTC) |
|||