Given two integers N and X, the task is to find the value of Arcsin(x) using expansion upto N terms.
Input: N = 4, X = 0.5
Sum of first 4 terms in the expansion of Arcsin(x) for
x = 0.5 is 0.5233863467.
Input: N = 8, X = -0.5
Approach: The expansion of arcsin(x) is given by :
Note: |x| < 1
The above expansion is solved by using two variables maintaining the numerator and the denominator.
Below is the implementation of the above approach:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Minimum number of power terms with sum equal to n
- Program to calculate the value of sin(x) and cos(x) using Expansion
- Find the sum of all the terms in the n-th row of the given series
- Middle term in the binomial expansion series
- Find the sum of the series 1+11+111+1111+..... upto n terms
- Number of terms in Geometric Series with given conditions
- Sum of the series 0.6, 0.06, 0.006, 0.0006, ...to n terms
- Sum of series 2/3 - 4/5 + 6/7 - 8/9 + ------- upto n terms
- Sum of the series 5+55+555+.. up to n terms
- Program to print binomial expansion series
- Print the first N terms of the series 6, 28, 66, 120, 190, 276, ...
- Deriving the expression of Fibonacci Numbers in terms of golden ratio
- Number of Permutations such that no Three Terms forms Increasing Subsequence
- Sum of first n terms of a given series 3, 6, 11, .....
- Find the sum of series 0.X + 0.XX + 0.XXX +... upto k terms
- Sum of first N terms of Quadratic Sequence 3 + 7 + 13 + ...
- Find the sum of n terms of the series 1,8,27,64 ....
- Find sum of the series 1+22+333+4444+...... upto n terms
- Find sum of the series ?3 + ?12 +......... upto N terms
- Ratio of mth and nth terms of an A. P. with given ratio of sums
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.