MHB Prove x^31+x^32+x^33+x^34+x^35=n has an integer solution for any integer n.

  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Integer
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Prove, that the equation

\[x_1^3+x_2^3+x_3^3+x_4^3+x_5^3 = n\]

has an integer solution for any integer $n$.
 
Mathematics news on Phys.org
lfdahl said:
Prove, that the equation

\[x_1^3+x_2^3+x_3^3+x_4^3+x_5^3 = n\]

has an integer solution for any integer $n$.

We have $(t + 1)^3 + (t- 1)^3 = 2t^3 + 6t$
or $6t = (t+1)^3 + (t-1)^3 - t^3 - t^3 = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$
let us define $f(t) = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$ which is sum of of 4 cubes

the numbers are of the form
$6t = f(t)+ 0 $ sum of 5 cubes
$6t+1 = f(t) + 1^3$ sum of 5 cubes
$6t+2 = 6(t-1) + 8 = f(t-1) + 2^3$ sum of 5 cubes
$6t+3 = 6(t-4) + 27 = f(t-4)+ 3^3 $ sum of 5 cubes
$6t+4 = 6(t-10) + 64 = f(t-10) + 4^3$ sum of 5 cubes
$6t+5 = 6(t-20) + 125 = f(t-20) + 5^3$ sum of 5 cubes
as we have taken care of all cases we are done
 
kaliprasad said:
We have $(t + 1)^3 + (t- 1)^3 = 2t^3 + 6t$
or $6t = (t+1)^3 + (t-1)^3 - t^3 - t^3 = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$
let us define $f(t) = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$ which is sum of of 4 cubes

the numbers are of the form
$6t = f(t)+ 0 $ sum of 5 cubes
$6t+1 = f(t) + 1^3$ sum of 5 cubes
$6t+2 = 6(t-1) + 8 = f(t-1) + 2^3$ sum of 5 cubes
$6t+3 = 6(t-4) + 27 = f(t-4)+ 3^3 $ sum of 5 cubes
$6t+4 = 6(t-10) + 64 = f(t-10) + 4^3$ sum of 5 cubes
$6t+5 = 6(t-20) + 125 = f(t-20) + 5^3$ sum of 5 cubes
as we have taken care of all cases we are done

You really cracked the nut with a splendid solution, kaliprasad! :cool:Thanks a lot for your participation!
 
kaliprasad said:
We have $(t + 1)^3 + (t- 1)^3 = 2t^3 + 6t$
or $6t = (t+1)^3 + (t-1)^3 - t^3 - t^3 = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$
let us define $f(t) = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$ which is sum of of 4 cubes

the numbers are of the form
$6t = f(t)+ 0 $ sum of 5 cubes
$6t+1 = f(t) + 1^3$ sum of 5 cubes
$6t+2 = 6(t-1) + 8 = f(t-1) + 2^3$ sum of 5 cubes
$6t+3 = 6(t-4) + 27 = f(t-4)+ 3^3 $ sum of 5 cubes
$6t+4 = 6(t-10) + 64 = f(t-10) + 4^3$ sum of 5 cubes
$6t+5 = 6(t-20) + 125 = f(t-20) + 5^3$ sum of 5 cubes
as we have taken care of all cases we are done

better solution that is closed form ( first 3 lines copied from above)

We have $(t + 1)^3 + (t- 1)^3 = 2t^3 + 6t$
or $6t = (t+1)^3 + (t-1)^3 - t^3 - t^3 = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$
let us define $f(t) = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$ which is sum of of 4 cubes

now $n^3-n= n(n^2-1) = n(n+1)(n-1)= (n-1)n(n+1) = 6\frac{(n-1)n(n+1}{6} $ Now $\frac{(n-1)n(n+1}{6}$ is integer as $(n-1)n(n+1)$ being multiple of 3 consecutive numbers is divisible by 3! or 6

so $6t+n = n^3 + 6t -(n^3-n) = n^3 + 6(t-\frac{(n-1)n(n+1)}{6}) = n^3 + f(t-\frac{(n-1)n(n+1)}{6})$ sum of one cube and 4 cubes or sum of 5 cubes
 
kaliprasad said:
better solution that is closed form ( first 3 lines copied from above)

We have $(t + 1)^3 + (t- 1)^3 = 2t^3 + 6t$
or $6t = (t+1)^3 + (t-1)^3 - t^3 - t^3 = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$
let us define $f(t) = (t+1)^3 + (t-1)^3 + (-t)^3 + (-t)^3$ which is sum of of 4 cubes

now $n^3-n= n(n^2-1) = n(n+1)(n-1)= (n-1)n(n+1) = 6\frac{(n-1)n(n+1}{6} $ Now $\frac{(n-1)n(n+1}{6}$ is integer as $(n-1)n(n+1)$ being multiple of 3 consecutive numbers is divisible by 3! or 6

so $6t+n = n^3 + 6t -(n^3-n) = n^3 + 6(t-\frac{(n-1)n(n+1)}{6}) = n^3 + f(t-\frac{(n-1)n(n+1)}{6})$ sum of one cube and 4 cubes or sum of 5 cubes
Thanks again, kaliprasad!Yes, the latter solution is more compact in its closed form. Nice observation!
 
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