Can Euler's formula accurately calculate arcsine?

  • Thread starter Thread starter Marie Cury
  • Start date Start date
  • Tags Tags
    Euler Formula
AI Thread Summary
Euler's formula for arctan is being used to calculate arcsine, but issues arise with accuracy at high decimal inputs, particularly with values like 0.9999999999 and 0.99. The discussion highlights that while lower inputs like 0.9 yield correct results, higher precision leads to significant errors. Participants suggest that the problem may stem from truncating the infinite series, which affects the accuracy of the results. One user reports achieving four correct digits with n=13 and ten correct digits with n=32, indicating that increasing n reduces error. The conversation emphasizes the importance of proper calculation methods and series truncation in achieving accurate results.
Marie Cury
Messages
10
Reaction score
0
1. I use Euler formula of arctan to calculate arcsine
2. This equation\arctan x = \frac{x}{1+x^2} \sum_{n=0}^\infty \prod_{k=1}^n \frac{2k x^2}{(2k+1)(1+x^2)}.
If I input 0.9999999999, I will not be able to get the expected result. If input = 0.9 then it is pretty correct, but 0.99 is definitely wrong and more wrong when the decimal digits get higher till uncomputable.
Could someone help me ? :wink:
 
Physics news on Phys.org
2 weeks already and everyone stopped breathing into my thread!
you ignore my post I guess!
 
It sounds like you just need a better calculator, try using Mathematica.
 
It wasn't clear what you were asking. It's an infinite series, so you must be truncating it at some point, and so of course the result is not exact.
 
Marie Cury said:
1. I use Euler formula of arctan to calculate arcsine



2. This equation\arctan x = \frac{x}{1+x^2} \sum_{n=0}^\infty \prod_{k=1}^n \frac{2k x^2}{(2k+1)(1+x^2)}.

If I input 0.9999999999, I will not be able to get the expected result. If input = 0.9 then it is pretty correct, but 0.99 is definitely wrong and more wrong when the decimal digits get higher till uncomputable.
Could someone help me ? :wink:

I don't see what the problem is, I get at least 4 digits correct If I evaluate the sum for n<=13 and 10 digits correct for n<=32. (I don't think n=0 should count).
Because \frac{2k x^2}{(2k+1)(1+x^2)} is smaller than 1/2 for all x, the error must halve for each increase of n.

I used the following python program

Code:
rom math import *

x = 0.9999
limit = 20

sum = 0
for n in range (1, limit):
    prod = 1
    for k in range (1, n):
        prod *= 2*k*x*x/((2*k+1)*(1+x*x))
    sum += prod
    print n, atan(x), sum * x / (1+x*x)


1 0.785348160897 0.4999999975
2 0.785348160897 0.666649995833
3 0.785348160897 0.733303328833
4 0.785348160897 0.761866186262
5 0.785348160897 0.77455952004
6 0.785348160897 0.780328640213
7 0.785348160897 0.782991044782
8 0.785348160897 0.784233375995
9 0.785348160897 0.784817943983
10 0.785348160897 0.785094816918
11 0.785348160897 0.785226647987
12 0.785348160897 0.785289691324
13 0.785348160897 0.785319949099
14 0.785348160897 0.7853345162
15 0.785348160897 0.785341547891
16 0.785348160897 0.785344949982
17 0.785348160897 0.785346599315
18 0.785348160897 0.78534740034
19 0.785348160897 0.785347789989
20 0.785348160897 0.785347979799

Converges nicely as you can see.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top