Wallisin kaavat
Wallisin kaavat ovat menetelmiä, joilla voidaan laskea piin likiarvoja . Kaavat on johtanut englantilainen matemaatikko John Wallis . Wallisin kaavojen mukaan:
(1)
π
2
=
∏
n
=
1
∞
[
2
n
2
n
−
1
⋅
2
n
2
n
+
1
]
=
2
1
⋅
2
3
⋅
4
3
⋅
4
5
⋅
6
5
⋅
6
7
⋅
8
7
⋅
8
9
⋅
…
{\displaystyle {\frac {\pi }{2}}=\prod _{n=1}^{\infty }\left[{\frac {2n}{2n-1}}\cdot {\frac {2n}{2n+1}}\right]={\frac {2}{1}}\cdot {\frac {2}{3}}\cdot {\frac {4}{3}}\cdot {\frac {4}{5}}\cdot {\frac {6}{5}}\cdot {\frac {6}{7}}\cdot {\frac {8}{7}}\cdot {\frac {8}{9}}\cdot \ldots }
(2)
π
=
lim
n
→
∞
(
n
!
)
2
⋅
2
2
n
(
2
n
)
!
⋅
n
{\displaystyle {\sqrt {\pi }}=\lim _{n\to \infty }{\frac {(n!)^{2}\cdot 2^{2n}}{(2n)!\cdot {\sqrt {n}}}}}
.
Kaavassa (2) merkintä ”
!
{\displaystyle !}
” tarkoittaa kertomaa .
Wallisin kaavojen avulla voidaan arvioida piitä seuraavasti: Jos
N
∈
N
{\displaystyle N\in \mathbb {N} }
, (
N
≥
1
{\displaystyle N\geq 1}
), niin
π
≃
2
⋅
∏
n
=
1
N
[
2
n
2
n
−
1
⋅
2
n
2
n
+
1
]
{\displaystyle \pi \simeq 2\cdot \prod _{n=1}^{N}\left[{\frac {2n}{2n-1}}\cdot {\frac {2n}{2n+1}}\right]}
tai
π
≃
(
(
N
!
)
2
⋅
2
2
N
(
2
N
)
!
⋅
N
)
2
{\displaystyle \pi \simeq \left({\frac {\left(N!\right)^{2}\cdot 2^{2N}}{(2N)!\cdot {\sqrt {N}}}}\right)^{2}}
Wallisin kaavojen johtaminen
Wallisin kaava (1) johdetaan osittaisintegroinnin avulla:
Merkitään kaikille
n
∈
N
{\displaystyle n\in \mathbb {N} }
I
n
=
∫
0
π
/
2
sin
n
(
x
)
d
x
{\displaystyle I_{n}=\int _{0}^{\pi /2}\sin ^{n}(x)\,{\text{d}}x}
,
jossa käytetään merkintää
sin
n
(
x
)
=
(
sin
(
x
)
)
n
{\textstyle \sin ^{n}(x)=\left(\sin(x)\right)^{n}}
,
A
n
=
∏
i
=
1
n
2
i
2
i
−
1
⋅
2
i
2
i
+
1
=
2
1
⋅
2
3
⋅
4
3
⋅
4
5
⋅
…
⋅
2
n
2
n
−
1
⋅
2
n
2
n
+
1
{\displaystyle A_{n}=\prod _{i=1}^{n}{\frac {2i}{2i-1}}\cdot {\frac {2i}{2i+1}}={\frac {2}{1}}\cdot {\frac {2}{3}}\cdot {\frac {4}{3}}\cdot {\frac {4}{5}}\cdot \ldots \cdot {\frac {2n}{2n-1}}\cdot {\frac {2n}{2n+1}}}
ja
B
n
=
(
n
!
)
2
⋅
2
2
n
(
2
n
)
!
⋅
n
{\displaystyle B_{n}={\frac {(n!)^{2}\cdot 2^{2n}}{(2n)!\cdot {\sqrt {n}}}}}
Tällöin
I
0
=
π
2
{\displaystyle I_{0}={\frac {\pi }{2}}}
ja
I
1
=
1
{\displaystyle I_{1}=1}
Jos
n
≥
2
{\textstyle n\geq 2}
, niin osittaisintegroimalla nähdään, että
I
n
=
−
cos
(
π
2
)
⋅
sin
n
−
1
(
π
2
)
+
cos
(
0
)
⋅
sin
n
−
1
(
0
)
−
∫
0
π
2
[
−
cos
(
x
)
⋅
(
n
−
1
)
⋅
sin
n
−
2
(
x
)
⋅
cos
(
x
)
]
d
x
{\displaystyle I_{n}=-\cos \left({\frac {\pi }{2}}\right)\cdot \sin ^{n-1}\left({\frac {\pi }{2}}\right)+\cos(0)\cdot \sin ^{n-1}(0)-\int _{0}^{\frac {\pi }{2}}\left[-\cos(x)\cdot (n-1)\cdot \sin ^{n-2}(x)\cdot \cos(x)\right]\,{\text{d}}x}
=
(
n
−
1
)
∫
0
π
2
[
cos
2
(
x
)
⋅
sin
n
−
2
(
x
)
]
d
x
=
(
n
−
1
)
∫
0
π
2
[
(
1
−
sin
2
(
x
)
)
⋅
sin
n
−
2
(
x
)
]
d
x
{\displaystyle =(n-1)\int _{0}^{\frac {\pi }{2}}\left[\cos ^{2}(x)\cdot \sin ^{n-2}(x)\right]\,{\text{d}}x=(n-1)\int _{0}^{\frac {\pi }{2}}\left[(1-\sin ^{2}(x))\cdot \sin ^{n-2}(x)\right]\,{\text{d}}x}
=
(
n
−
1
)
⋅
[
∫
0
π
/
2
sin
n
−
2
(
x
)
d
x
−
∫
0
π
/
2
sin
n
(
x
)
d
x
]
{\displaystyle =(n-1)\cdot \left[\int _{0}^{\pi /2}\sin ^{n-2}(x)\,\mathrm {d} x-\int _{0}^{\pi /2}\sin ^{n}(x)\,\mathrm {d} x\right]}
=
(
n
−
1
)
⋅
(
I
n
−
2
−
I
n
)
{\displaystyle =(n-1)\cdot (I_{n-2}-I_{n})}
Näin saadaan rekursiivinen kaava
I
n
{\textstyle I_{n}}
:lle:
I
n
=
n
−
1
n
⋅
I
n
−
2
{\displaystyle I_{n}={\frac {n-1}{n}}\cdot I_{n-2}}
Tämän avulla nähdään, että
I
2
n
=
2
n
−
1
2
n
⋅
I
2
n
−
2
=
2
n
−
1
2
n
⋅
2
n
−
3
2
n
−
2
⋅
I
2
n
−
4
{\displaystyle I_{2n}={\frac {2n-1}{2n}}\cdot I_{2n-2}={\frac {2n-1}{2n}}\cdot {\frac {2n-3}{2n-2}}\cdot I_{2n-4}}
=
…
=
1
2
⋅
3
4
⋅
…
⋅
2
n
−
3
2
n
−
2
⋅
2
n
−
1
2
n
⋅
I
0
{\displaystyle =\ldots ={\frac {1}{2}}\cdot {\frac {3}{4}}\cdot \ldots \cdot {\frac {2n-3}{2n-2}}\cdot {\frac {2n-1}{2n}}\cdot I_{0}}
ja
I
2
n
+
1
=
2
n
2
n
+
1
⋅
I
2
n
−
1
=
2
n
2
n
+
1
⋅
2
n
−
2
2
n
−
1
⋅
I
2
n
−
3
{\displaystyle I_{2n+1}={\frac {2n}{2n+1}}\cdot I_{2n-1}={\frac {2n}{2n+1}}\cdot {\frac {2n-2}{2n-1}}\cdot I_{2n-3}}
=
…
=
2
3
⋅
4
5
⋅
…
⋅
2
n
−
2
2
n
−
1
⋅
2
n
2
n
+
1
⋅
I
1
{\displaystyle =\ldots ={\frac {2}{3}}\cdot {\frac {4}{5}}\cdot \ldots \cdot {\frac {2n-2}{2n-1}}\cdot {\frac {2n}{2n+1}}\cdot I_{1}}
Näin ollen
I
2
n
+
1
I
2
n
=
2
1
⋅
2
3
⋅
4
3
⋅
4
5
⋅
…
⋅
2
n
−
2
2
n
−
3
⋅
2
n
−
2
2
n
−
1
⋅
2
n
2
n
−
1
⋅
2
n
2
n
+
1
⋅
I
1
I
0
=
A
n
⋅
2
π
{\displaystyle {\frac {I_{2n+1}}{I_{2n}}}={\frac {2}{1}}\cdot {\frac {2}{3}}\cdot {\frac {4}{3}}\cdot {\frac {4}{5}}\cdot \ldots \cdot {\frac {2n-2}{2n-3}}\cdot {\frac {2n-2}{2n-1}}\cdot {\frac {2n}{2n-1}}\cdot {\frac {2n}{2n+1}}\cdot {\frac {I_{1}}{I_{0}}}=A_{n}\cdot {\frac {2}{\pi }}}
, eli
A
n
=
I
2
n
+
1
I
2
n
⋅
π
2
{\displaystyle A_{n}={\frac {I_{2n+1}}{I_{2n}}}\cdot {\frac {\pi }{2}}}
Koska
sin
2
n
+
2
(
x
)
≤
sin
2
n
+
1
(
x
)
≤
sin
2
n
(
x
)
{\displaystyle \sin ^{2n+2}(x)\leq \sin ^{2n+1}(x)\leq \sin ^{2n}(x)}
kaikilla
x
∈
[
0
,
π
2
]
{\displaystyle x\in \left[0,{\frac {\pi }{2}}\right]}
, niin
I
2
n
+
2
≤
I
2
n
+
1
≤
I
2
n
{\displaystyle I_{2n+2}\leq I_{2n+1}\leq I_{2n}}
. Siten
1
≥
I
2
n
+
1
I
2
n
≥
I
2
n
+
2
I
2
n
=
2
n
+
1
2
n
+
2
⋅
I
2
n
I
2
n
=
2
n
+
1
2
n
+
2
→
1
{\displaystyle 1\geq {\frac {I_{2n+1}}{I_{2n}}}\geq {\frac {I_{2n+2}}{I_{2n}}}={\frac {{\frac {2n+1}{2n+2}}\cdot I_{2n}}{I_{2n}}}={\frac {2n+1}{2n+2}}\to 1}
, kun
n
→
∞
{\displaystyle n\to \infty }
. Siis
lim
n
→
∞
A
n
=
lim
n
→
∞
I
2
n
+
1
I
2
n
⋅
π
2
=
π
2
{\displaystyle \lim _{n\to \infty }A_{n}=\lim _{n\to \infty }{\frac {I_{2n+1}}{I_{2n}}}\cdot {\frac {\pi }{2}}={\frac {\pi }{2}}}
, eli väite (1) on todistettu.
◻
{\displaystyle \Box }
Koska
B
n
+
1
2
=
B
n
2
⋅
(
2
n
+
2
)
2
(
2
n
+
1
)
2
⋅
n
n
+
1
{\displaystyle B_{n+1}^{2}=B_{n}^{2}\cdot {\frac {(2n+2)^{2}}{(2n+1)^{2}}}\cdot {\frac {n}{n+1}}}
ja
A
n
=
A
n
+
1
⋅
(
2
n
+
1
)
(
2
n
+
3
)
(
2
n
+
2
)
2
{\displaystyle A_{n}=A_{n+1}\cdot {\frac {(2n+1)(2n+3)}{(2n+2)^{2}}}}
, niin induktiotodistuksella voidaan osoittaa, että
B
n
2
=
2
n
+
1
n
⋅
A
n
{\displaystyle B_{n}^{2}={\frac {2n+1}{n}}\cdot A_{n}}
kaikilla
n
∈
N
{\displaystyle n\in \mathbb {N} }
. Siten väite (2) seuraa väitteestä (1).
◻
{\displaystyle \Box }
Wallisin kaavojen tarkkuus piin likiarvon laskennassa
Oheisessa taulukossa on laskettuna joitain likiarvoja piille käyttäen Wallisin kaavoja (1) ja (2). Tulos on pyöristetty kuuden desimaalin tarkkuudelle. Kaavan tuottaman arvon virhe on laskettu suhteellisesti:
Virhe
(
%
)
=
(
π
kaava
π
−
1
)
⋅
100
%
{\displaystyle {\text{Virhe}}\,(\%)=\left({\frac {\pi _{\text{kaava}}}{\pi }}-1\right)\cdot 100\,\%}
,
missä
π
kaava
{\displaystyle \pi _{\text{kaava}}}
on kaavan (1) tai (2) antama tulos, vastaavasti. Vertailun vuoksi piin likiarvo kuuden desimaalin tarkkuudella on
π
≈
{\textstyle \pi \approx }
3,141593.
Wallisin kaava (#)
N
=
1
{\displaystyle N=1}
N
=
10
{\displaystyle N=10}
N
=
100
{\displaystyle N=100}
N
=
1
000
{\displaystyle N=1\,000}
N
=
10
000
{\displaystyle N=10\,000}
Tulos
Virhe
Tulos
Virhe
Tulos
Virhe
Tulos
Virhe (%)
Tulos
Virhe (%)
Kaava (1):
π
≃
2
⋅
∏
n
=
1
N
[
2
n
2
n
−
1
⋅
2
n
2
n
+
1
]
{\textstyle \pi \simeq 2\cdot \prod _{n=1}^{N}\left[{\frac {2n}{2n-1}}\cdot {\frac {2n}{2n+1}}\right]}
2,666667
−15 %
3,067704
−2,4 %
3,133787
−0,2 %
3,140808
−0,02 %
3,141514
−0,002 %
Kaava (2):
π
≃
(
(
N
!
)
2
⋅
2
2
N
(
2
N
)
!
⋅
N
)
2
{\displaystyle \pi \simeq \left({\frac {\left(N!\right)^{2}\cdot 2^{2N}}{\left(2N\right)!\cdot {\sqrt {N}}}}\right)^{2}}
4,000000
+27 %
3,221089
+2,5 %
3,149456
+0,3 %
3,142378
+0,03 %
3,141671
+0,003 %
Lähteet
↑ Lehtinen, Matti: Osittaisintegroinnin ihmeitä :
Wallisin ja Stirlingin kaavat