MHB Polynomial Challenge: Find # of Int Roots of Degree 3 w/ Coeffs

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
If $P(0)=3$ and $P(1)=11$ where $P$ is a polynomial of degree 3 with integer coefficients and $P$ has only 2 integer roots, find how many such polynomials $P$ exist?
 
Mathematics news on Phys.org
beacuse P(0) is odd it does not have any even root and because P(1) is odd it does not have any odd root. So it cannot have any integer roots. So there is no polynomial.

reason : P (a) - P(b) is divisible by a - b
 
the above is based on http://mathhelpboards.com/linear-abstract-algebra-14/polynomal-divisibility-10507.html#post48739
 
Hi kaliprasad,

Thanks for participating and the follow-up explanation post! I also want to thank you for your continuous support to my challenge problems!:)
 
anemone said:
If $P(0)=3$ and $P(1)=11$ where $P$ is a polynomial of degree 3 with integer coefficients and $P$ has only 2 integer roots, find how many such polynomials $P$ exist?
for convenience we let the leading coefficient=1, then :
$P(x)=x^3+ax^2+bx+3$
$P(1)=1+a+b+3=11$
$\therefore a+b=7$-----(1)
if m,n are 2 intger roots of $ P(x)$ then m.n must be a factor of 3
if $P(-1)=0$ we have $-1+a-b+3=0, \,, =>a-b=-2---(2)$
from (1)(2)
$a=\dfrac {5}{2}$
does not fit (since a must be integer)
if $P(3)=0 $
we have $27+9a+3b+3=0, \,, =>3a+b=-10---(3)$
if $P(-3)=0$
we have $-27+9a-3b+3=0\,, =>3a-b=8----(4)$
from (1)(3) and (1)(4) we find both "a" are not integer
and we conclude such P(x) does not exist
 
Last edited:
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.

Similar threads

Back
Top