Find the number of ordered triplets for positive integers and such that .
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.
Given that x y z = 2 1 5 ∗ 3 2 0 we know that x = 2 a 3 j , y = 2 b 3 k and z = 2 c 3 l where
(i) a + b + c = 1 5 , where a , b , c are all non-negative integers, and
(ii) j + k + l = 2 0 , where j , k , l are also all non-negative integers.
The number of solutions to each of these equations can be determined by the stars and bars method . Equation (i) then has ( 1 5 1 5 + 3 − 1 ) = ( 1 5 1 7 ) solutions and equation (ii) has ( 2 0 2 0 + 3 − 1 ) = ( 2 0 2 2 ) solutions.
The desired number of ordered triples ( x , y , z ) is then the product of these two values, namely
( 1 5 1 7 ) ∗ ( 2 0 2 2 ) = 1 3 6 ∗ 2 2 0 = 3 1 4 1 6 .