This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We start by checking trivial solutions when a = 0 , ± 1 , b = 0 , ± 1 , and c = 0 , ± 1 . This is not so hard, but it takes a while, and I'll omit the process here. There are eight distinct solutions, which are ( a , b , c ) = ( 0 , 1 , − 1 ) , ( 0 , − 1 , 1 ) , ( − 1 , 0 , 1 ) , ( − 1 , 1 , 0 ) , ( − 1 , − 1 , 0 ) , ( 1 , 1 , 0 ) , ( 1 , − 1 , 0 ) , ( 1 , 0 , − 1 ) . Now, we will prove that there is no more solution. Assume that a , b , c = 0 , ± 1 . From both equation, we have that a b c = a 3 − a = b 3 − b . The latter equation can be written as ( a − b ) ( a 2 + a b + b 2 − 1 ) = 0 , so, there are two cases. First, if a = b , it implies from the original equation that a ( c − a ) = − 1 , and it results in a = ± 1 , which has already considered. Therefore, we assume that a = b , and what we have left is the case when a 2 + a b + b 2 = 1 , or ( a + b ) 2 = a b + 1 . The difference between those two original equations is ( b − a ) c = ( a − b ) ( a + b ) . Since a = b , we have that a + b = − c . Put this into ( a + b ) 2 = a b + 1 , and get c 2 = a b + 1 . We now have a + b + c = 0 , and also a 2 b 2 c 2 = b c + 1 , = c a + 1 , = a b + 1 . Sum them up, and we get a 2 + b 2 + c 2 = a b + b c + c a + 3 . With the fact that a + b + c = 0 , we have a 2 + b 2 + c 2 = − 2 ( a b + b c + c a ) . Therefore, a 2 + b 2 + c 2 = 2 . However, this equation has no solution other than what we have derived previously, because if at least one of ∣ a ∣ , ∣ b ∣ , ∣ c ∣ ≥ 2 , the right hand side of the equation will exceed 2 .