In how many different ways in which the order does not matter, can we divide a regular year (365 days) in twelve months, each one having 28 days or 30 days or 31 days?
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.
Let non-negative integers i , j , and k be such that { i + j + k = 1 2 2 8 i + 3 0 j + 3 1 k = 3 6 5 . . . ( 1 ) . . . ( 2 )
From ( 2 ) :
2 8 i + 3 0 j + 3 1 k 2 8 ( i + j + k ) + 2 j + 3 k 2 8 ( 1 2 ) + 2 j + 3 k ⟹ 2 j + 3 k = 3 6 5 = 3 6 5 = 3 6 5 = 2 9 Recall ( 1 ) : i + j + k = 1 2 Rearranging
⟹ k = 3 2 9 − 2 j .
For k to be an integer, 2 9 − 2 j must be a multiple of 3, then the acceptable j = 1 , 4 , 7 , 1 0 , ⋯ .
For i + j + k ≤ 1 2 , we have ( i , j , k ) = ⎩ ⎪ ⎨ ⎪ ⎧ ( 2 , 1 , 9 ) ( 1 , 4 , 7 ) ( 0 , 5 , 7 ) .
Therefore there are 3 solutions.