mini challenge: find the smallest cosine of an integer
|
10-19-2021, 11:33 AM
Post: #2
|
|||
|
|||
RE: mini challenge: find the smallest cosine of an integer
For getting smallest |cos(x)|, we are only using angle-reduction code of cosine function.
Tiny |cos(x)| implied x ≈ (2k+1)*(pi/2) |cos(x)| = |sin(x - (2k+1)*(pi/2))| ≈ |(x - (2k+1)*(pi/2))| Example, |cos(11)| ≈ |11 - 7*(pi/2)| ≈ 0.0044257 So, it depends how good angle-reduction code is. Most calculators are not good. Free42-Decimal happened to have very good angle-reduction code (at the cost of *huge* table) This is the smallest |cos(x)|, for x < 1E50 9.341730789500356812974471132146251e46 COS ABS → 1.028415848209791685669808767152452e-35 Above x (47 digits integer) is derived from convergents of y = (pi/2) / 10^(47 - 34) see https://www.hpmuseum.org/forum/thread-17...#pid153032 |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)