MHB What Is the Value of \( P(n+1) \) in the Polynomial Problem from IMO 1981?

  • Thread starter Thread starter melese
  • Start date Start date
AI Thread Summary
The discussion centers on determining the value of \( P(n+1) \) for a polynomial \( P \) of degree \( n \) defined by \( P(k)=\binom{n+1}{k}^{-1} \) for \( k=0,1,...,n \). It emphasizes that \( P(n+1) \) cannot simply be \( \binom{n+1}{n+1}^{-1} \) since \( P \) is already defined at \( n+1 \) points. The approach involves constructing a polynomial that matches \( P \) and using specific expressions to evaluate \( P(n+1) \). The final result shows that \( P(n+1) \) equals \( 0 \) when \( n \) is odd and \( 1 \) when \( n \) is even. This conclusion highlights the relationship between the polynomial's degree and the parity of \( n \).
melese
Messages
19
Reaction score
0
IMO 1981,(ROU). shortlisted

This problem is probably not as difficult, but was misleading at first to me.

2.Let $P$ be a polynomial of degree $n$ satisfying $P(k)=\binom{n+1}{k}^{-1}$ for $k=0,1,...,n$.
Determine $P(n+1)$.

መለሰ
 
Last edited:
Mathematics news on Phys.org
Re: IMO 1981,(ROU). shortlisted

One should be carful of thinking that the answer is somehow $\displaystyle P(n+1)=\binom{n+1}{n+1}^{-1}$; since $P$ is of degree $n$ has already been determined at $n+1$ points ($k=0,1,...,n$).

We try to build a polynomial identical to $P$. My idea was to find an expression $x_k$, $k=0,1,...,n$, such that $\displaystyle x_k=\begin{cases}1&x=k\\0&x\neq k\end{cases}$. Then simply $\displaystyle P(x)=x_0\binom{n+1}{0}^{-1}+x_1\binom{n+1}{1}^{-1}+\cdots+x_n\binom{n+1}{n}^{-1}$.

A good start is to look at the expression $f_k(x)=x\cdot(x-1)\cdots(x-(k-1))\widehat{(x-k)}(x-(k+1))\cdots(x-n)$, which is nonzero only when $x=k$. (the hat notation means 'without') So to gaurantee it's $1$ when $x=k$, we simply divide the above expression by $f_k(k)$, and therefore $\displaystyle x_k=\frac{f_k(x)}{f_k(k)}$.

Now we compute:
$\frac{f_k(n+1)}{f_k(k)}=\frac{(n+1)\cdot(n+1-1)\cdots(n+1-(k-1))\widehat{(n+1-k})(n+1-(k+1))\cdots(n+1-n)}{k\cdot(k-1)\cdots\widehat{(k-k)}(k-(k+1))\cdots(k-n)}=\frac{(n+1)!/(n+1-k)}{k!(-1)^{n-k}(n-k)!}=(-1)^{n-k}\binom{n+1}{k}$

Finally, $\displaystyle P(n+1)=\sum_{k=0}^{n}(n+1)_k\binom{n+1}{k}^{-1}=\sum_{k=0}^{n}\frac{f_k(n+1)}{f_k(k)}\binom{n+1}{k}^{-1}=\sum_{k=0}^{n}(-1)^{n-k}=\sum_{k=0}^{n}(-1)^k$.
So the answer is $0$ if $n$ is odd, $1$ if $n$ is even.

መለሰ
 
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...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Back
Top