How many sets of (unordered) triples of integers are there to the following equation:
Note: Unordered means that, if were a solution, only count it once (and not etc.)
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.
Assuming a = 0 , the equation a + b + c = a b c changes to b + c = 0 that is b = − c . Obviously there are infinitely many solutions for ( b , c ) for example, ( − 1 , 1 ) , ( − 2 , 2 ) , ( − 3 , 3 ) and so on. Thus there are infinitely many solutions to the above equation a + b + c = a b c