I would like to know how are approximations for like computed.I tried to find some by guess and check and I came up with ( Yeah,it's very hard to memorize) but it's only accurate to 15 decimal digits.My method was to choose a random number for the denominator and multiply it by the value of up to 20 digits to get the numerator.So,are there more efficient methods to compute approximations for ?Thanks for any answers in advance!
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Usually fractional approximations of irrational numbers(e,(2)..) can be easily computed from their Continued Fraction representation.
For instance the constant e=[2;1,2,1,1,4,1,1,6,1,1,8,…](AO03417) as you can see, follows a simple pattern in its continued fraction representation. By using this pattern we can easily compute more and more accurate convergents of e.
Unfortunately the continued fraction representation of π=[3;7,15,1,292,1,1,1,2,1,3,1,…](AO01203) contains seemingly random digits.
However it is possible to compute such convergents by first finding the decimal representation of π and then approximate the decimal using the continued fraction method .
To demonstrate, π to seven decimal places is:
π≈3.1415927 Taking the reciprocal of 0.1415927 π≈3+7.06251331 And repeating this over and over we get.. π≈3+7+15+1+293+10.32055611111 and so on.. If we truncate the fraction at 15 it gives the approximation π≈3+7+15+111=3+11316=113355
Since python already implements the rational approximation algorithm in its fractions module , all we have to do is find a large string of π(I used the The Spigot Algorithm here) and use the .limit_denominator(x) method to find a rational approximation.
The code prints out a reasonable approximation 8115284382549491779.
Log in to reply
Thanks!
think of how it was invented.....
Log in to reply
pi?or the method?