MHB Nth Roots of Unity Challenge Problem

  • Thread starter Thread starter sbhatnagar
  • Start date Start date
  • Tags Tags
    Roots Unity
AI Thread Summary
The challenge problem involves finding two expressions related to the $n^{\text{th}}$ roots of unity. The first expression, $(1-a_1)(1-a_2)(1-a_3) \cdots (1-a_{n-1})$, evaluates to $n$. The second expression, $\frac{1}{2-a_1}+\frac{1}{2-a_2}+\cdots +\frac{1}{2-a_{n-1}}$, simplifies to $\frac{n2^{n-1} - 2^n + 1}{2^n - 1}$. This result can be verified by substituting specific values for $n$, such as $n=4$. The discussion highlights the use of polynomial roots and logarithmic differentiation to derive these results.
sbhatnagar
Messages
87
Reaction score
0
Challenge Problem $1,a_1,a_2,a_3, \cdots ,a_{n-1}$ are the $n^{\text{th}}$ roots of unity.

Find the value of

i) $(1-a_1)(1-a_2)(1-a_3) \cdots (1-a_{n-1})$

ii)$\displaystyle \frac{1}{2-a_1}+\frac{1}{2-a_2}+\frac{1}{2-a_3}+\cdots +\frac{1}{2-a_{n-1}}$
 
Mathematics news on Phys.org
sbhatnagar said:
Challenge Problem $1,a_1,a_2,a_3, \cdots ,a_{n-1}$ are the $n^{\text{th}}$ roots of unity.

Find the value of

i) $(1-a_1)(1-a_2)(1-a_3) \cdots (1-a_{n-1})$

ii)$\displaystyle \frac{1}{2-a_1}+\frac{1}{2-a_2}+\frac{1}{2-a_3}+\cdots +\frac{1}{2-a_{n-1}}$

Is...

$\displaystyle f(x)=\frac{x^{n}-1}{x-1}= 1 + x + x^{2} + ... + x^{n-1} = \prod_{k=1}^{n-1} (x-a_{k})$ (1) ... so that the answer to i) is $f(1)=n$. The answer to ii) will be given in a successive post...

Kind regards

$\chi$ $\sigma$
 
Last edited:
sbhatnagar said:
Challenge Problem $1,a_1,a_2,a_3, \cdots ,a_{n-1}$ are the $n^{\text{th}}$ roots of unity.

Find the value of

i) $(1-a_1)(1-a_2)(1-a_3) \cdots (1-a_{n-1})$

ii)$\displaystyle \frac{1}{2-a_1}+\frac{1}{2-a_2}+\frac{1}{2-a_3}+\cdots +\frac{1}{2-a_{n-1}}$
As chisigma has noted, the roots of $f(x)=\dfrac{x^{n}-1}{x-1}$ are $a_1,a_2,a_3, \ldots ,a_{n-1}$. The roots of $$f(2-x)=\frac{(2-x)^{n}-1}{(2-x)-1} = \bigl((2-x)^{n}-1\bigr)(1-x)^{-1} = \bigl((2-x)^{n}-1\bigr)(1+x+x^2+\ldots)$$ are $(2-a_1),(2-a_2),(2-a_3), \ldots ,(2-a_{n-1})$. The sum of the reciprocals of these roots will be the negative of the coefficient of $x$ in that last expression, divided by the constant term. Therefore $$ \frac{1}{2-a_1}+\frac{1}{2-a_2}+\frac{1}{2-a_3}+\ldots +\frac{1}{2-a_{n-1}} = \boxed{\dfrac{n2^{n-1} -2^n+1}{2^n-1}}.$$

You can check that result by working out the value of the sum when $n=4$. In that case, $a_1,a_2,a_3$ are $-1,i,-i$, and the sum is $\dfrac13+\dfrac1{2-i}+\dfrac1{2+i}$, which simplifies to $\dfrac{17}{15}$, in accordance with the boxed formula.
 
Here is another solution for 2!

We have
$$ \frac{x^n-1}{x-1}=(x-a_1)(x-a_2)(x-a_3)\cdots (x-a_{n-1}) $$
Let $f(x)=\log\frac{x^n -1}{x-1}$
$$f(x)=\log\dfrac{x^n-1}{x-1}=\log(x-a_1)+\log(x-a_2)+\log(x-a_3)+\cdots +\log(x-a_{n-1})$$
The derivative of $f(x)$ will be
$$f'(x)=\dfrac{ \left[n x^{-1+n}-\dfrac{-1+x^n}{(-1+x)}\right]}{-1+x^n}=\frac{1}{x-a_1}+\frac{1}{x-a_2}+\frac{1}{x-a_3}+\cdots +\frac{1}{x-a_{n-1}}$$

putting $x=2$

$$f'(2)=\frac{n 2^{n-1}-2^n+1}{2^n-1}=\frac{1}{2-a_1}+\frac{1}{2-a_2}+\frac{1}{2-a_3}+\cdots +\frac{1}{2-a_{n-1}}$$
 
Last edited:
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top