Maths Olympiad Prep

Library / /10 of 42

Algebra Difficulty 5.1 AIME, harder Prove it Ireland

Prove that
k=1n1sinkπn=n2n1,for n=2,3, \prod_{k=1}^{n-1} \sin \frac{k\pi}{n} = \frac{n}{2^{n-1}}, \quad \text{for } n = 2, 3, \dots

Solution

Note that for any complex number ζ\zeta with ζ=1|\zeta| = 1 we have
1ζ2=(1ζ)(1ζˉ)=2(ζ+ζˉ)=2(1Re(ζ)). |1 - \zeta|^2 = (1 - \zeta)(1 - \bar{\zeta}) = 2 - (\zeta + \bar{\zeta}) = 2(1 - \operatorname{Re}(\zeta)).
If ζ=e2iθ=cos(2θ)+isin(2θ)\zeta = e^{2i\theta} = \cos(2\theta) + i\sin(2\theta), we can use 1cos(2θ)=2sin2θ1 - \cos(2\theta) = 2\sin^2\theta to obtain
1e2iθ2=4sin2θ. |1 - e^{2i\theta}|^2 = 4 \sin^2 \theta.
Therefore,
4n1(k=1n1sinkπn)2=k=1n1(4sin2kπn)=k=1n11e2ikπn2. 4^{n-1} \left( \prod_{k=1}^{n-1} \sin \frac{k\pi}{n} \right)^2 = \prod_{k=1}^{n-1} \left( 4 \sin^2 \frac{k\pi}{n} \right) = \prod_{k=1}^{n-1} \left| 1 - e^{\frac{2ik\pi}{n}} \right|^2.
Now, the nn numbers e2ikπn,k=0,1,,n1e^{\frac{2ik\pi}{n}}, k = 0, 1, \dots, n-1 are precisely the nnth roots of unity, and so
zn1=(z1)k=1n1(ze2ikπn). z^n - 1 = (z - 1) \prod_{k=1}^{n-1} \left(z - e^{\frac{2ik\pi}{n}}\right).
Hence, for all zz,
zn1++z+1=k=1n1(ze2ikπn), z^{n-1} + \dots + z + 1 = \prod_{k=1}^{n-1} \left(z - e^{\frac{2ik\pi}{n}}\right),
and so, letting z=1z = 1,
n=k=1n1(1e2ikπn),which givesn2=k=1n11e2ikπn2. n = \prod_{k=1}^{n-1} \left(1 - e^{\frac{2ik\pi}{n}}\right), \quad \text{which gives} \quad n^2 = \prod_{k=1}^{n-1} \left|1 - e^{\frac{2ik\pi}{n}}\right|^2.
Consequently,
22(n1)(k=1n1sinkπn)2=n2, 2^{2(n-1)} \left( \prod_{k=1}^{n-1} \sin \frac{k\pi}{n} \right)^2 = n^2,
from which it follows that
k=1n1sinkπn=n2n1, \prod_{k=1}^{n-1} \sin \frac{k\pi}{n} = \frac{n}{2^{n-1}},
since sinkπn>0\sin \frac{k\pi}{n} > 0 for k=1,2,,n1k = 1, 2, \dots, n-1.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.