MHB Finding Perfect Squares with $n^4 + 33$

  • Thread starter Thread starter magneto1
  • Start date Start date
  • Tags Tags
    Squares
magneto1
Messages
100
Reaction score
0
Find, with proof, all the positive integers $n$ such that $n^4 + 33$ is a perfect square.
 
Mathematics news on Phys.org
magneto said:
Find, with proof, all the positive integers $n$ such that $n^4 + 33$ is a perfect square.

let $x^2 = n^4+ 33$

so $33 = (x^2-n^4) = (x+n^2)(x-n^2)$ = $33*1$= $11*3$

gives 2 solutions to be checked

$x+n^2= 33$ and $x-n^2= 1$ => $x= 17$ and $n^2 = 16$ which is a perfect square so n = 4

or

$x+n^2= 11$ and $x-n^2= 3$ => $x= 7$ and $n^2 = 4$ which is a perfect square so n = 2

so we get $2^4 + 33 = 49= 7^2$

and $4^4 + 33 = 289= 17^2$

n = 2 or 4
 
Nicely done.
 
Alternatively, $n^4 = (n^2)^2$ and so eventually $(n^2 + 1)^2 - (n^2)^2 > 33$ at which point $n^4 + 33$ is strictly between two perfect squares (and so cannot be one). This upper bound is attained when:
$$(n^2 + 1)^2 - (n^2)^2 > 33 ~ ~ ~ \iff ~ ~ ~ 2n^2 + 1 > 33 ~ ~ ~ \iff ~ ~ ~ n > 4$$
Hence it suffices to check $0 \leq n \leq 4$, and we quickly find that:
$$n = 0 ~ ~ ~ \implies ~ ~ ~ 0^4 + 33 = 33$$
$$n = 1 ~ ~ ~ \implies ~ ~ ~ 1^4 + 33 = 34$$
$$n = 2 ~ ~ ~ \implies ~ ~ ~ 2^4 + 33 = 49 = 7^2$$
$$n = 3 ~ ~ ~ \implies ~ ~ ~ 3^4 + 33 = 114$$
$$n = 4 ~ ~ ~ \implies ~ ~ ~ 4^4 + 33 = 289 = 17^2$$
So the solutions are $n = 2$, $n = 4$.
 
Bacterius said:
Alternatively, $n^4 = (n^2)^2$ and so eventually $(n^2 + 1)^2 - (n^2)^2 > 33$ at which point $n^4 + 33$ is strictly between two perfect squares (and so cannot be one). This upper bound is attained when:
$$(n^2 + 1)^2 - (n^2)^2 > 33 ~ ~ ~ \iff ~ ~ ~ 2n^2 + 1 > 33 ~ ~ ~ \iff ~ ~ ~ n > 4$$
Hence it suffices to check $0 \leq n \leq 4$, and we quickly find that:
$$n = 0 ~ ~ ~ \implies ~ ~ ~ 0^4 + 33 = 33$$
$$n = 1 ~ ~ ~ \implies ~ ~ ~ 1^4 + 33 = 34$$
$$n = 2 ~ ~ ~ \implies ~ ~ ~ 2^4 + 33 = 49 = 7^2$$
$$n = 3 ~ ~ ~ \implies ~ ~ ~ 3^4 + 33 = 114$$
$$n = 4 ~ ~ ~ \implies ~ ~ ~ 4^4 + 33 = 289 = 17^2$$
So the solutions are $n = 2$, $n = 4$.

as 33 is 1 mod 4, n has to be even because $n^4+33$ cannot be 2 mod 4, so we need not check for odd n so check for 0,2,4 only
 
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