Find the number of unordered triplets of non-negative integers satisfy the equation above.
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.
Since we are looking for unordered triples, we might as well assume that 0 ≤ a ≤ b ≤ c . Then 1 0 0 = a b + a c + b c ≥ 3 a 2 , so that 0 ≤ a ≤ 5 .
If a = 0 we want b c = 1 0 0 , and we obtain 5 solutions: ( 0 , 1 , 1 0 0 ) , ( 0 , 2 , 5 0 ) , ( 0 , 4 , 2 5 ) , ( 0 , 5 , 2 0 ) , ( 0 , 1 0 , 1 0 ) .
If a = 1 we want ( b + 1 ) ( c + 1 ) = 1 0 1 . This equation has no solutions with c ≥ b ≥ 1 .
If a = 2 we want ( b + 2 ) ( c + 2 ) = 1 0 4 = 2 3 × 1 3 , and we obtain 2 more solutions: ( 2 , 2 , 2 4 ) , ( 2 , 6 , 1 1 ) .
If a = 3 we want ( b + 3 ) ( c + 3 ) = 1 0 9 . This equation has no solutions with c ≥ b ≥ 3 .
If a = 4 we want ( b + 4 ) ( c + 4 ) = 1 1 6 = 2 2 × 2 9 . This equation has no solutions with c ≥ b ≥ 4 .
If a = 5 we want ( b + 5 ) ( c + 5 ) = 1 2 5 = 5 3 . This equation has no solutions with c ≥ b ≥ 5 .
Thus there are exactly 7 unordered solutions.