MHB Prove an equation has no integer solution

  • 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,\,q,\,r,\,s$ be positive integers such that $p\ge q\ge r \ge s$.

Prove that the equation $x^4-px^3-qx^2-rx-s=0$ has no integer solution.
 
Mathematics news on Phys.org
anemone said:
Let $p,\,q,\,r,\,s$ be positive integers such that $p\ge q\ge r \ge s$

Prove that the equation $x^4-px^3-qx^2-rx-s=0----(1)$ has no integer solution.
by" Rational zero theorem"
if m is the integer solution of (1)
then : s is a multiple of $\mid m\mid $

but :$m^4-pm^3-qm^2-rm-s\neq 0$
for $p\ge q\ge r\ge s \ge\mid m \mid>0$
and $p,q,r,s\in N$
 
Last edited:
Albert said:
by" Rational zero theorem"
if m is the integer solution of (1)
then : s is a multiple of $\mid m\mid $

but :$m^4-pm^3-qm^2-rm-s\neq 0$
for $p\ge q\ge r\ge s \ge\mid m \mid>0$
and $p,q,r,s\in N$

Hi Albert,

Your concept is correct, thanks for participating. :)

Solution of other that based on the same principle:

Suppose that $m$ is an integer root of $x^4-px^3-qx^2-rx-s=0$ . As $s\ne 0$, we have $m\ne 0$. Suppose now that $m>0$, then $m^4-pm^3=qm^2+rm+s>0$ and hence $m>p\ge s$. On the other hand, $s=m(m^3-pm^2-qm-r)$ and hence $m$ divides $s$, a contradiction.

If $m<0$, then writing $n=-m>0$, we have $n^4+pn^3-qn^2+rn-s=n^4+n^2(pn-q)+(rn-s)>0$, a contradiction. This proves that the given polynomial has no integer roots.
 
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...
Thread 'Imaginary Pythagorus'
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...

Similar threads

Back
Top