Content deleted Content added
NickyMcLean (talk | contribs) |
RareEntity (talk | contribs) →new method: Change section name, add methods, question, and reference |
||
Line 160:
:(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)#
==
http://math.exeter.edu/rparris/peanut/cordic.pdf (page 16) gives a very weird way of computing square roots using trig functions -- anonymous
:We do have an article about [[CORDIC]], which mentions computing square roots but does not give further details. I added a sentence to this article with a link to CORDIC. I don't have an idea whether CORDIC is still used (or was ever used) to compute square roots, but it would be good to have some more details. -- [[User:Jitse Niesen|Jitse Niesen]] ([[User talk:Jitse Niesen|talk]]) 14:42, 8 December 2008 (UTC)
There are several methods of computing a square root using trigonometry. For example:
:root = cos( asin( (n-1)/(n+1) ) ) * (n+1)/2
or
:root = tan( acos( (n-1)/(n+1) ) ) * (n-1)/2
Should these methods be added to the article and/or to [[Square root]]?
<ref>http://www.perspectiveinfinity.com/CirclesAndRoots</ref>
[[User:RareEntity|RareEntity]] ([[User talk:RareEntity|talk]]) 03:14, 28 January 2016 (UTC)
== About A two-variable iterative method ==
| |||