The number of positive integer solution of
≤ 15,
is:
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.
The number of positive integer solutions of x + y + z = 6 is ( 3 − 1 6 − 1 ) = 1 0 .
As x + y + z = 6 , u + v ≤ 9
u + v = k can only have positive integer solutions when k ≥ 2 . Thus there are 8 possible values of k , namely 2 ≤ k ≤ 9 .
Observe that the number of positive integer solutions to u + v = k where 2 ≤ k ≤ 9 is ∑ i = 2 9 ( 2 − 1 i − 1 ) = 3 6 .
There are 10 possible values of x + y + z per each value of u and v , hence the number of possible positive integer solutions is 1 0 ⋅ 3 6 = 3 6 0