Find the smallest value of , given that , and are distinct integers and that is a non-negative integer.
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.
Its obvious that no three positive integers can satisfy this equation, lest Fermat's Last Theorem would be violated.
Since the problem mentions ' c ' as non-negative, note that it can also take the value 0 . The smallest value will be achieved when this happens.
If c = 0 , then,
a 3 + b 3 = 0
Note that a = n , b = − n (or vice-versa) satisfies this relation, with the advantage that a + b = 0 (it helps achieve the minimum value)
Hence,
a + b + c = n − n + 0 = 0