MHB Proving $f(-k)<-k$ when $f(k)<k$

  • Thread starter Thread starter anemone
  • Start date Start date
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Let $f$ be a polynomial with integer coefficients such that $f(-k)<f(k)<k$ for some integer $k$. Prove that $f(-k)<-k$.
 
Mathematics news on Phys.org
Solution of other:
As $a^n-b^n=(a-b)(a^{n-1}+a^{n-2}b+\cdots+b^{n-1})$, then for any distinct integers $a$ and $b$ and for any polynomial $f(x)$ with integer coefficients $f(a)-f(b)$ is divisible by $a-b$.

Thus, $f(k)-f(-k)\ne 0$ is divisible by $2k$ and consequently $f(-k)\le f(k)-2k<k-2k=-k$.
 
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...
Back
Top