MHB Integer Solutions - Solve $a^2+b^2+c^2 + a + b+ c = 1$

  • Thread starter Thread starter kaliprasad
  • Start date Start date
  • Tags Tags
    Integer
kaliprasad
Gold Member
MHB
Messages
1,333
Reaction score
0
Solve for integers $a,b,c$ given $a^2+b^2+c^2 + a + b+ c = 1$
 
Mathematics news on Phys.org
My solution:

Note that from the Cauchy-Schwarz inequality and the formula $(a+b+c)^2=a^2+b^2+c^2+2(ab+bc+ca)$, we have the following inequality that always holds for all real $a,\,b$ and $c$:

$$a^2+b^2+c^2\ge ab+bc+ca$$

$$a^2+b^2+c^2\ge \frac{(a+b+c)^2}{3}$$(*)

But from the given equality, we know $a^2+b^2+c^2=1-(a+b+c)$. Replacing this relation into the inequality (*) and solve it for $a+b+c$, we see that we get:

$$1-(a+b+c)\ge \frac{(a+b+c)^2}{3}$$

$$3-3(a+b+c)\ge (a+b+c)^2$$

$$0\ge (a+b+c)^2+3(a+b+c)-3$$

$-3\le a+b+c \le 0$

But observe that all of the following cases don't yield for integer solutions for the system:

$a+b+c=-3\cap a^2+b^2+c^2=4;\,a+b+c=-2\cap a^2+b^2+c^2=3$

$a+b+c=-1\cap a^2+b^2+c^2=2;\,a+b+c=0\cap a^2+b^2+c^2=1$

Therefore there are no such integer in $a,\,b$ and $c$ such that $a^2+b^2+c^2 + a + b+ c = 1$.
Thanks kaliprasad for posing challenge for us! I appreciate that!(Cool)
 
My solution:

\[a^2+b^2+c^2+a+b+c = \left ( a+\frac{1}{2} \right )^2+\left ( b+\frac{1}{2} \right )^2+\left ( c+\frac{1}{2} \right )^2-\frac{3}{4} = 1\]

\[\Rightarrow (2a+1)^2+(2b+1)^2+(2c+1)^2= 7\]

In order to show, that there are no possible integer solutions, both of the following arguments apply:I. The only perfect squares contained in $7$ are $1^2=1$ and $2^2=4$. Any triple combination (e.g. $1 + 1 + 4$) of them does not yield $7$. II. For any integer $n$: $(2n+1)^2 \in \left \{ 1,9,25,... \right \}$, leaving only one allowed perfect square, namely $1$, which yields the triple sum $3$.
 
lfdahl said:
My solution:

\[a^2+b^2+c^2+a+b+c = \left ( a+\frac{1}{2} \right )^2+\left ( b+\frac{1}{2} \right )^2+\left ( c+\frac{1}{2} \right )^2-\frac{3}{4} = 1\]

\[\Rightarrow (2a+1)^2+(2b+1)^2+(2c+1)^2= 7\]

In order to show, that there are no possible integer solutions, both of the following arguments apply:I. The only perfect squares contained in $7$ are $1^2=1$ and $2^2=4$. Any triple combination (e.g. $1 + 1 + 4$) of them does not yield $7$. II. For any integer $n$: $(2n+1)^2 \in \left \{ 1,9,25,... \right \}$, leaving only one allowed perfect square, namely $1$, which yields the triple sum $3$.

above solution is good and so also by anemone

mine is same as above except
taking mod 8 we have LHS = 3 and RHS = 7 and hence no solution
 
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