Find the number of non-negative integer triples ( x , y , z ) which satisfy the equation below.
6 x + 3 y + 2 z = 2 0 1 6
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.
6 x + 3 y + 2 z = 2 0 1 6 6 x + 3 y = 2 0 1 6 − 2 z 2 x + y = 6 7 2 − 3 2 z Observe that z can range from 0 to 1008. Also observe that the RHS is always even , so there will always be a solution to this diophantine equation. The number of solutions will thus be 2 6 7 2 − 3 2 z + 1 = 3 3 7 − 3 1 z for each value of z. Now let z=3k, so the answer is k = 0 ∑ 3 3 6 3 3 7 − k = 5 6 9 5 3 .
Problem Loading...
Note Loading...
Set Loading...
Solving for y , we get that 3 y = 2 0 1 6 − 2 z − 6 x . Since the RHS is even, the LHS must also be even, so y must be even, i.e. y = 2 k for some integer k .
Solving for z , we get that 2 z = 2 0 1 6 − 3 y − 6 x . Since the RHS is divisible by 3, the LHS must also be divisible by 3, so z must be divisible by 3, i.e. z = 3 n for some integer n .
Substituting this into the original equation, we get 6 x + 6 k + 6 n = 2 0 1 6 , or x + k + n = 3 3 6 . By stars and bars, this has a total of ( 2 3 3 8 ) = 5 6 9 5 3 solutions. Therefore, our answer is 5 6 9 5 3 .