Finding $sum_{k=0}^{n-1}frac{alpha_k}{2-alpha_k}$, where $alpha_k$ are the $n$-th roots of unity
up vote
5
down vote
favorite
The question asks to compute:
$$sum_{k=0}^{n-1}dfrac{alpha_k}{2-alpha_k}$$
where $alpha_0, alpha_1, ldots, alpha_{n-1}$ are the $n$-th roots of unity.
I started off by simplifiyng and got it as:
$$=-n+2left(sum_{k=0}^{n-1} dfrac{1}{2-alpha_k}right)$$
Now I was stuck. I can rationalise the denominator, but we know $alpha_k$ has both real and complex components, so it can't be simplified by rationalising. What else can be done?
algebra-precalculus complex-numbers summation
add a comment |
up vote
5
down vote
favorite
The question asks to compute:
$$sum_{k=0}^{n-1}dfrac{alpha_k}{2-alpha_k}$$
where $alpha_0, alpha_1, ldots, alpha_{n-1}$ are the $n$-th roots of unity.
I started off by simplifiyng and got it as:
$$=-n+2left(sum_{k=0}^{n-1} dfrac{1}{2-alpha_k}right)$$
Now I was stuck. I can rationalise the denominator, but we know $alpha_k$ has both real and complex components, so it can't be simplified by rationalising. What else can be done?
algebra-precalculus complex-numbers summation
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
1
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53
add a comment |
up vote
5
down vote
favorite
up vote
5
down vote
favorite
The question asks to compute:
$$sum_{k=0}^{n-1}dfrac{alpha_k}{2-alpha_k}$$
where $alpha_0, alpha_1, ldots, alpha_{n-1}$ are the $n$-th roots of unity.
I started off by simplifiyng and got it as:
$$=-n+2left(sum_{k=0}^{n-1} dfrac{1}{2-alpha_k}right)$$
Now I was stuck. I can rationalise the denominator, but we know $alpha_k$ has both real and complex components, so it can't be simplified by rationalising. What else can be done?
algebra-precalculus complex-numbers summation
The question asks to compute:
$$sum_{k=0}^{n-1}dfrac{alpha_k}{2-alpha_k}$$
where $alpha_0, alpha_1, ldots, alpha_{n-1}$ are the $n$-th roots of unity.
I started off by simplifiyng and got it as:
$$=-n+2left(sum_{k=0}^{n-1} dfrac{1}{2-alpha_k}right)$$
Now I was stuck. I can rationalise the denominator, but we know $alpha_k$ has both real and complex components, so it can't be simplified by rationalising. What else can be done?
algebra-precalculus complex-numbers summation
algebra-precalculus complex-numbers summation
edited Nov 23 at 17:39
Martin Sleziak
44.4k7115268
44.4k7115268
asked Mar 29 '17 at 17:58
samjoe
6,1001928
6,1001928
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
1
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53
add a comment |
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
1
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
1
1
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53
add a comment |
3 Answers
3
active
oldest
votes
up vote
9
down vote
accepted
Since $alpha_0,alpha_1,alpha_2, dots , alpha_{n-1}$ are roots of the equation
$$x^n-1=0 ~~~~~~~~~~~~~ cdots ~(1)$$
You can apply Transformation of Roots to find a equation whose roots are$$frac{1}{2-alpha_0} , frac{1}{2-alpha_1},frac{1}{2-alpha_2}, dots , frac{1}{2-alpha_{n-1}}$$
Let $P(y)$ represent the polynomial whose roots are $frac{1}{2-alpha_k}$
$$y=frac{1}{2-alpha_k}=frac{1}{2-x} implies x=frac{2y-1}{y}$$
Put in $(1)$
$$Bigg(frac{2y-1}{y}Bigg)^n-1=0 implies (2y-1)^{n}-y^{n}=0$$
Use Binomial Theorem to find coefficient of $y^n$ and $y^{n-1}$.You will get sum of the roots using Vieta's Formulas.
Hope it helps!
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
add a comment |
up vote
4
down vote
I think the following answers the question using the method that Jyrki posted here.
Since $alpha_k$ are nth roots, so they satisfy $$f(x)=x^n-1=prod_{k=0}^{n-1}(x-alpha_k)$$
Putting in logarithm and derivating,
$$f'(x)/f(x)=dfrac{nx^{n-1}}{x^n-1}=sum_{k=0}^{n-1}dfrac{1}{x-alpha_k}$$
Thus $$f'(2)/f(2) = sum_{k=0}^{n-1}dfrac{1}{2-alpha_k} = dfrac{ncdot 2^{n-1}}{2^n-1}$$
Thus the required answer is given as:
$$-n+ 2left(dfrac{ncdot 2^{n-1}}{2^n-1}right)$$
$$=dfrac{n}{2^n-1}$$
add a comment |
up vote
2
down vote
For future reference here is a solution using residues. We have that
with $zeta_k = exp(2pi i k/n)$
$$S_n = sum_{k=0}^{n-1} frac{zeta_k}{2-zeta_k}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{z}{2-z} frac{nz^{n-1}}{z^n-1}
\ = sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{nz^{n}}{z^n-1}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{n}{z^n-1}
.$$
Now observe that
$$mathrm{Res}_{z=2}
frac{1}{2-z} frac{n}{z^n-1}
= -frac{n}{2^n-1}.$$
Furthermore the residue at infinity
$$mathrm{Res}_{z=infty}
frac{1}{2-z} frac{n}{z^n-1} = 0$$
since we have the bound $2pi n R / R /R^n = 2pi n / R^n rightarrow
0$ as $Rrightarrowinfty.$ Residues sum to zero and we get
$$S_n - frac{n}{2^n-1} = 0
quadtext{or}quad
S_n = frac{n}{2^n-1} = 0$$
as claimed.
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
9
down vote
accepted
Since $alpha_0,alpha_1,alpha_2, dots , alpha_{n-1}$ are roots of the equation
$$x^n-1=0 ~~~~~~~~~~~~~ cdots ~(1)$$
You can apply Transformation of Roots to find a equation whose roots are$$frac{1}{2-alpha_0} , frac{1}{2-alpha_1},frac{1}{2-alpha_2}, dots , frac{1}{2-alpha_{n-1}}$$
Let $P(y)$ represent the polynomial whose roots are $frac{1}{2-alpha_k}$
$$y=frac{1}{2-alpha_k}=frac{1}{2-x} implies x=frac{2y-1}{y}$$
Put in $(1)$
$$Bigg(frac{2y-1}{y}Bigg)^n-1=0 implies (2y-1)^{n}-y^{n}=0$$
Use Binomial Theorem to find coefficient of $y^n$ and $y^{n-1}$.You will get sum of the roots using Vieta's Formulas.
Hope it helps!
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
add a comment |
up vote
9
down vote
accepted
Since $alpha_0,alpha_1,alpha_2, dots , alpha_{n-1}$ are roots of the equation
$$x^n-1=0 ~~~~~~~~~~~~~ cdots ~(1)$$
You can apply Transformation of Roots to find a equation whose roots are$$frac{1}{2-alpha_0} , frac{1}{2-alpha_1},frac{1}{2-alpha_2}, dots , frac{1}{2-alpha_{n-1}}$$
Let $P(y)$ represent the polynomial whose roots are $frac{1}{2-alpha_k}$
$$y=frac{1}{2-alpha_k}=frac{1}{2-x} implies x=frac{2y-1}{y}$$
Put in $(1)$
$$Bigg(frac{2y-1}{y}Bigg)^n-1=0 implies (2y-1)^{n}-y^{n}=0$$
Use Binomial Theorem to find coefficient of $y^n$ and $y^{n-1}$.You will get sum of the roots using Vieta's Formulas.
Hope it helps!
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
add a comment |
up vote
9
down vote
accepted
up vote
9
down vote
accepted
Since $alpha_0,alpha_1,alpha_2, dots , alpha_{n-1}$ are roots of the equation
$$x^n-1=0 ~~~~~~~~~~~~~ cdots ~(1)$$
You can apply Transformation of Roots to find a equation whose roots are$$frac{1}{2-alpha_0} , frac{1}{2-alpha_1},frac{1}{2-alpha_2}, dots , frac{1}{2-alpha_{n-1}}$$
Let $P(y)$ represent the polynomial whose roots are $frac{1}{2-alpha_k}$
$$y=frac{1}{2-alpha_k}=frac{1}{2-x} implies x=frac{2y-1}{y}$$
Put in $(1)$
$$Bigg(frac{2y-1}{y}Bigg)^n-1=0 implies (2y-1)^{n}-y^{n}=0$$
Use Binomial Theorem to find coefficient of $y^n$ and $y^{n-1}$.You will get sum of the roots using Vieta's Formulas.
Hope it helps!
Since $alpha_0,alpha_1,alpha_2, dots , alpha_{n-1}$ are roots of the equation
$$x^n-1=0 ~~~~~~~~~~~~~ cdots ~(1)$$
You can apply Transformation of Roots to find a equation whose roots are$$frac{1}{2-alpha_0} , frac{1}{2-alpha_1},frac{1}{2-alpha_2}, dots , frac{1}{2-alpha_{n-1}}$$
Let $P(y)$ represent the polynomial whose roots are $frac{1}{2-alpha_k}$
$$y=frac{1}{2-alpha_k}=frac{1}{2-x} implies x=frac{2y-1}{y}$$
Put in $(1)$
$$Bigg(frac{2y-1}{y}Bigg)^n-1=0 implies (2y-1)^{n}-y^{n}=0$$
Use Binomial Theorem to find coefficient of $y^n$ and $y^{n-1}$.You will get sum of the roots using Vieta's Formulas.
Hope it helps!
edited Nov 21 at 3:44
darij grinberg
10.1k32961
10.1k32961
answered Mar 29 '17 at 18:09
Jaideep Khare
17.7k32468
17.7k32468
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
add a comment |
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
1
1
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
Thank you that was very useful!
– samjoe
Mar 30 '17 at 3:07
add a comment |
up vote
4
down vote
I think the following answers the question using the method that Jyrki posted here.
Since $alpha_k$ are nth roots, so they satisfy $$f(x)=x^n-1=prod_{k=0}^{n-1}(x-alpha_k)$$
Putting in logarithm and derivating,
$$f'(x)/f(x)=dfrac{nx^{n-1}}{x^n-1}=sum_{k=0}^{n-1}dfrac{1}{x-alpha_k}$$
Thus $$f'(2)/f(2) = sum_{k=0}^{n-1}dfrac{1}{2-alpha_k} = dfrac{ncdot 2^{n-1}}{2^n-1}$$
Thus the required answer is given as:
$$-n+ 2left(dfrac{ncdot 2^{n-1}}{2^n-1}right)$$
$$=dfrac{n}{2^n-1}$$
add a comment |
up vote
4
down vote
I think the following answers the question using the method that Jyrki posted here.
Since $alpha_k$ are nth roots, so they satisfy $$f(x)=x^n-1=prod_{k=0}^{n-1}(x-alpha_k)$$
Putting in logarithm and derivating,
$$f'(x)/f(x)=dfrac{nx^{n-1}}{x^n-1}=sum_{k=0}^{n-1}dfrac{1}{x-alpha_k}$$
Thus $$f'(2)/f(2) = sum_{k=0}^{n-1}dfrac{1}{2-alpha_k} = dfrac{ncdot 2^{n-1}}{2^n-1}$$
Thus the required answer is given as:
$$-n+ 2left(dfrac{ncdot 2^{n-1}}{2^n-1}right)$$
$$=dfrac{n}{2^n-1}$$
add a comment |
up vote
4
down vote
up vote
4
down vote
I think the following answers the question using the method that Jyrki posted here.
Since $alpha_k$ are nth roots, so they satisfy $$f(x)=x^n-1=prod_{k=0}^{n-1}(x-alpha_k)$$
Putting in logarithm and derivating,
$$f'(x)/f(x)=dfrac{nx^{n-1}}{x^n-1}=sum_{k=0}^{n-1}dfrac{1}{x-alpha_k}$$
Thus $$f'(2)/f(2) = sum_{k=0}^{n-1}dfrac{1}{2-alpha_k} = dfrac{ncdot 2^{n-1}}{2^n-1}$$
Thus the required answer is given as:
$$-n+ 2left(dfrac{ncdot 2^{n-1}}{2^n-1}right)$$
$$=dfrac{n}{2^n-1}$$
I think the following answers the question using the method that Jyrki posted here.
Since $alpha_k$ are nth roots, so they satisfy $$f(x)=x^n-1=prod_{k=0}^{n-1}(x-alpha_k)$$
Putting in logarithm and derivating,
$$f'(x)/f(x)=dfrac{nx^{n-1}}{x^n-1}=sum_{k=0}^{n-1}dfrac{1}{x-alpha_k}$$
Thus $$f'(2)/f(2) = sum_{k=0}^{n-1}dfrac{1}{2-alpha_k} = dfrac{ncdot 2^{n-1}}{2^n-1}$$
Thus the required answer is given as:
$$-n+ 2left(dfrac{ncdot 2^{n-1}}{2^n-1}right)$$
$$=dfrac{n}{2^n-1}$$
edited Nov 21 at 3:45
darij grinberg
10.1k32961
10.1k32961
answered Mar 30 '17 at 3:06
samjoe
6,1001928
6,1001928
add a comment |
add a comment |
up vote
2
down vote
For future reference here is a solution using residues. We have that
with $zeta_k = exp(2pi i k/n)$
$$S_n = sum_{k=0}^{n-1} frac{zeta_k}{2-zeta_k}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{z}{2-z} frac{nz^{n-1}}{z^n-1}
\ = sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{nz^{n}}{z^n-1}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{n}{z^n-1}
.$$
Now observe that
$$mathrm{Res}_{z=2}
frac{1}{2-z} frac{n}{z^n-1}
= -frac{n}{2^n-1}.$$
Furthermore the residue at infinity
$$mathrm{Res}_{z=infty}
frac{1}{2-z} frac{n}{z^n-1} = 0$$
since we have the bound $2pi n R / R /R^n = 2pi n / R^n rightarrow
0$ as $Rrightarrowinfty.$ Residues sum to zero and we get
$$S_n - frac{n}{2^n-1} = 0
quadtext{or}quad
S_n = frac{n}{2^n-1} = 0$$
as claimed.
add a comment |
up vote
2
down vote
For future reference here is a solution using residues. We have that
with $zeta_k = exp(2pi i k/n)$
$$S_n = sum_{k=0}^{n-1} frac{zeta_k}{2-zeta_k}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{z}{2-z} frac{nz^{n-1}}{z^n-1}
\ = sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{nz^{n}}{z^n-1}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{n}{z^n-1}
.$$
Now observe that
$$mathrm{Res}_{z=2}
frac{1}{2-z} frac{n}{z^n-1}
= -frac{n}{2^n-1}.$$
Furthermore the residue at infinity
$$mathrm{Res}_{z=infty}
frac{1}{2-z} frac{n}{z^n-1} = 0$$
since we have the bound $2pi n R / R /R^n = 2pi n / R^n rightarrow
0$ as $Rrightarrowinfty.$ Residues sum to zero and we get
$$S_n - frac{n}{2^n-1} = 0
quadtext{or}quad
S_n = frac{n}{2^n-1} = 0$$
as claimed.
add a comment |
up vote
2
down vote
up vote
2
down vote
For future reference here is a solution using residues. We have that
with $zeta_k = exp(2pi i k/n)$
$$S_n = sum_{k=0}^{n-1} frac{zeta_k}{2-zeta_k}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{z}{2-z} frac{nz^{n-1}}{z^n-1}
\ = sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{nz^{n}}{z^n-1}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{n}{z^n-1}
.$$
Now observe that
$$mathrm{Res}_{z=2}
frac{1}{2-z} frac{n}{z^n-1}
= -frac{n}{2^n-1}.$$
Furthermore the residue at infinity
$$mathrm{Res}_{z=infty}
frac{1}{2-z} frac{n}{z^n-1} = 0$$
since we have the bound $2pi n R / R /R^n = 2pi n / R^n rightarrow
0$ as $Rrightarrowinfty.$ Residues sum to zero and we get
$$S_n - frac{n}{2^n-1} = 0
quadtext{or}quad
S_n = frac{n}{2^n-1} = 0$$
as claimed.
For future reference here is a solution using residues. We have that
with $zeta_k = exp(2pi i k/n)$
$$S_n = sum_{k=0}^{n-1} frac{zeta_k}{2-zeta_k}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{z}{2-z} frac{nz^{n-1}}{z^n-1}
\ = sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{nz^{n}}{z^n-1}
= sum_{k=0}^{n-1} mathrm{Res}_{z=zeta_k}
frac{1}{2-z} frac{n}{z^n-1}
.$$
Now observe that
$$mathrm{Res}_{z=2}
frac{1}{2-z} frac{n}{z^n-1}
= -frac{n}{2^n-1}.$$
Furthermore the residue at infinity
$$mathrm{Res}_{z=infty}
frac{1}{2-z} frac{n}{z^n-1} = 0$$
since we have the bound $2pi n R / R /R^n = 2pi n / R^n rightarrow
0$ as $Rrightarrowinfty.$ Residues sum to zero and we get
$$S_n - frac{n}{2^n-1} = 0
quadtext{or}quad
S_n = frac{n}{2^n-1} = 0$$
as claimed.
answered Mar 30 '17 at 22:34
Marko Riedel
38.4k339106
38.4k339106
add a comment |
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2209034%2ffinding-sum-k-0n-1-frac-alpha-k2-alpha-k-where-alpha-k-are-the%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
See math.stackexchange.com/questions/1909362/… and math.stackexchange.com/questions/1811081/…
– lab bhattacharjee
Mar 29 '17 at 18:04
1
@labbhattacharjee I kind of got some hint. Here, if we go by Jyrki's answer, if we find $f'(2)$ by first defining $f(x) = Pi_{0}^{n-1}(x-alpha_k)$
– samjoe
Mar 29 '17 at 18:09
See also : math.stackexchange.com/questions/1909362/…
– lab bhattacharjee
Mar 29 '17 at 18:12
@samjoe: you got right the suggestion by labbhattacharjee: define $f(x) = Pi_{0}^{n-1}(x-alpha_k)$, derive, divide $f'(x)/f(x)$ and put $x=2$
– G Cab
Mar 29 '17 at 22:53