MHB Prove No Integers Solve $ax^3+bx^2+cx+d=1$ for x=19,2 for x=62

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Cubic Polynomial
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Prove that there are no integers $a,\,b,\,c$ and $d$ such that the polynomial $ax^3+bx^2+cx+d$ equals 1 at $x=19$ and 2 at $x=62$.
 
Mathematics news on Phys.org
Well, to start with, since $ax^3+ bx^2+ cx+ d$ is 1 when x 19, $a(19)^3+ b(19)^2+ 19x+ d= 6859a+ 361b+ 19c+ d= 1$, And since it is 2 when x= 62, $a(62)^3+ b(62)^2+ a(62)+ d= 238328a+ 3844b+ 62c+ d= 2$,

Subtracting the first from the second, 231469a+ 3461b+ 53c= 1. Since a, b, and c are integers that is a linear Diophantine equation.
 
we have $f(62) - f(19) = a (62^3-19^3) + b(62^2 - 19^2) + c(62-19) = 1$
or $(62-19)(a(62^2 + 62 * 19 + 19^2) + b(62+ 19) +c) = 1$
LHS is a multiple of 43 and RHS is 1 so this does not have integer solution
 
Country Boy said:
Well, to start with, since $ax^3+ bx^2+ cx+ d$ is 1 when x 19, $a(19)^3+ b(19)^2+ 19x+ d= 6859a+ 361b+ 19c+ d= 1$, And since it is 2 when x= 62, $a(62)^3+ b(62)^2+ a(62)+ d= 238328a+ 3844b+ 62c+ d= 2$,

Subtracting the first from the second, 231469a+ 3461b+ 53c= 1. Since a, b, and c are integers that is a linear Diophantine equation.
because this is a challenge question you are required to answer it fully . this is not a question for help
 
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