PROBLEM 1

Maclaurin series for e x

x x2 x3 x4
e = 1+x+ 2! + 3! + 4 ! +……………………………………
Then on multiplication with i we have the following
ix (ix)2 (ix)3 (ix)4 (ix)5 (ix)6
e =1 + ix + 2!
+ 3 ! + 4 ! + 5 ! + 6 ! +……………………………………
On simplification we have the following

x2 3 x3 4 x 4 5 x5 6 x 6
=1+ix +i2 2!
+i 3 ! +i 4 ! +i 5 ! +i 6 ! +………………………………………

ix x 2 x3 x 4 x5 x 6
e =1+ix - -i + +i - +……………………………….
2! 3 ! 4 ! 5 ! 6 !
Putting together those with i and those without i we have the following

x2 x4 x3 x5
e ix = 1−( + +…
2! 4! ) (
+i x− )
+ −… thus, we have the following from Maclaurin series of
3! 5!
cos x and sin x

x3 x5
sin x =x- + +……………………………...........................
3! 5!

x2 x4
cos x=¿1- + +………………………………………………….
2! 4 !
Therefore, comparing the two equations we have;

e ix=cos x+isinx as required

To find the polynomial representations of sin ⁡(nx) and cos ⁡(nx ) in terms ofsin x and cos x.

Let x ∈ R then e ix=cosx +isinx

n
¿=(cos x +isinx ) =∑ n

j=0
(nj)(cosx) n− j
(isinx) j

(e ¿¿ ix)n ¿=e inx= cos(nx )=isin(nx) equating real and imaginary parts then
n n
[] 2 2
For real parts, cos ⁡(nx )=∑ n ¿¿ =∑ n ( cos x ) k
(2 k ) (2 k )
k=0 k=0
n−2 k
(−1 )k ( 1−cos 2 x )

Hence the right-hand side is a polynomial cos x

From imaginary parts we get;
n−1
[ ]2
isin ( nx )= ∑ ( n ) ( cosx ) n−2 k−1
( isinx )2 k +1
2 k +1
k=0

n−1
[ ]2
=isinx ∑ n ( cos x ) k
(2 k +1 )
k=0
n−2 k−1
(−1 )k ( 1−cos 2 x )

Here the sum on the right-hand side is a polynomial in cos x hence cancel the
common factor i.
Comparing it with Chebyshev polynomial we have the following of which it is
related
T n ( x )=cos [ ncos−1 ( x ) ], x ∈ [ −1,1 ], n=0,1,2

When n=1,sin( nx)=sinx and cos ⁡(nx )=cos x as required.

PROBLEM 2
 The fastest formula to converge is Ramanujan–Sato series

The series goes by the formula

∞
1 2√ 2 ( 4 k) ! ! 26390 k +1103
=
π 992 ∑ k !4 3964 k
k=0

To the form

1 ∞ AK + B
=∑
π k=0
s (k )
CK
By using other well-defined sequences of integers S(K) obeying a certain recurrence
n
relation sequences which may be expressed in terms of binomial coefficients ¿
k
and A,B,C employing modular forms of higher levels.
This is the formula belief to be one of the formulas which converges to π.
  To show why the power series of π is convergent, we look for standard proof that
follows:
We use
Taylor’s series
3 5
Arctan y=y −3y + y5 ±…

For the arctangent. This Taylor series is closely related to the Taylor series of the logarithm

y2 y3
Log (1+y) =Y- 2 + 3 ±….
And this is because the tangent function can be written in terms of complex exponentials, so
the arctangent function can be written in terms of complex logarithms.so the appearance ofπ in
this formular is morally due to EULER’S FOMULER.Hence π converges:
To compute numerically the sum of the first n terms for small n, we are required to use
geometric progression as follows

Sn=a+ar+ar2+ar3+……………. +arn-1+arn-1…………………(I)

Multiplying both sides by r, we get,

r Sn=ar+ar2+ar3+ar4+……………+arn-1+arn………………………. (ii)

On subtracting (ii) and (I), we get

Sn-r Sn=a-arn

Sn (1-r) =a (1-rn)
n
Sn=a 1−r Hence
1−r
n
Sn= a( 1−r ) .
1−r