MHB Prove that there is no integer a with P(a)=8.

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Integer
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Let $P(x)$ be a polynomial with integral coefficients. Suppose that there exist four distinct integers $x_1,\,x_2,\,x_3,\,x_4$ with $P(x_1)=P(x_2)=P(x_3)=P(x_4)=5$.

Prove that there is no integer $a$ with $P(a)=8$.
 
Mathematics news on Phys.org
anemone said:
Let $P(x)$ be a polynomial with integral coefficients. Suppose that there exist four distinct integers $x_1,\,x_2,\,x_3,\,x_4$ with $P(x_1)=P(x_2)=P(x_3)=P(x_4)=5$.

Prove that there is no integer $a$ with $P(a)=8$.

This is similar to a problem that I had posted months ago. at http://mathhelpboards.com/challenge-questions-puzzles-28/polynomial-11288.html
so solution is similar

let Q(x) = P(x) - 5 is zero for $x_1,x_2,x_3,x_4$So $Q(x) = R(x)(x-x_1)(x-x_2)(x-x_3)(x-x_4)$ where R(x) is a polynomial of degree zero or moreso $Q(x)$ for x an integer is a product of at least 4 different integers as R(x) can be 1but 3 is not a product of at least 4 different integers . it is product of at most 3 different integers (-1) * (-3) * 1so Q(x) cannot be 3 and P(x) cannot be 8 for any integer x
 
Last edited:
Thanks, kaliprasad, for your solution!

And...Ah! I read that polynomial thread before, but didn't remember it at all...:o sorry for posting a quite similar problem in that thread here, kali! :(
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top