Find the number of ordered triples of positive integers that satisfy the equation
Extras:
This is in the set Contest Problems .
This is from PUMaC.
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.
Factorization makes everything simple. The question, when factorized, reduces to:- ( a − 1 ) ( b − 1 ) ( c − 1 ) = 2 0 1 2 .
The factorization technique may be called Completing the Cuboid, for I could not find any other name... A close relative of SFFT, though!
So, the trick is:- ( a − 1 ) ( b − 1 ) ( c − 1 ) = a b c − a b − b c − c a + a + b + c − 1
And we subtract 1 from both sides to complete the cuboid.
Since a , b , c are positive integers, so are a − 1 , b − 1 and c − 1 (they can''t be zero for their product is 2 0 1 2 ), because the sum and difference of n integers is an integer.
So, we have ( a − 1 ) ( b − 1 ) ( c − 1 ) = 2 0 1 2
Number of positive integral factors of 2 0 1 2 = 2 2 × 5 0 4 is ( 2 + 1 ) ( 1 + 1 ) = 6 , which are 1 , 2 , 4 , 5 0 3 , 1 0 0 6 , and 2 0 1 2 .
The number of ways in which 2 0 1 2 can be written as a product of 3 numbers is thus 1 8 , which consequently gives 1 8 ordered pairs of positive integers ( a , b , c ) .