Talk:Square root algorithms: Difference between revisions

Revision as of 07:49, 28 November 2008

Revision as of 14:07, 8 December 2008

Line 152:

:However, what is true is that there are only finitely many pairs (''p'', ''q'') such that

::<math>0< \left| \sqrt{S} - \frac{p}{q} \right| < \frac{1}{q^{2}} </math>

:(the [[irrationality measure]] is 2). On the other hand, a Liouville number has infinitely many such pairs. -- [[User:Jitse Niesen|Jitse Niesen]] ([[User talk:Jitse Niesen|talk]]) 20:17, 5 August 2008 (UTC)#

== new method ==

http://math.exeter.edu/rparris/peanut/cordic.pdf (page 16) gives a very weird way of computing square roots using trig functions