How many natural numbers (written in base 10) of 5 digits chosen from the set {1,3,4,5,7} are divisible by 3?
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.
but still, isn't this method too long as we have to check for all multiples of 3 from 9 to 33 ??
Log in to reply
Not really, if you use powers of x in mod 3 by taking the generating function ( 1 + 3 x + x 2 ) 5 .
I did a different method but made an error entering the solution.
I separated the digits into equivalence classes based on themselves modulo 3 :
3 0 , 1 , 4 , 7 1 , 5 2 .
For a 5-digit number to be a multiple of 3 , the sum of the classes above must be 9 , 6 , 3 , 0 :
9 : 2,2,2,2,1 in some order: ( 1 5 ) orders, 3 choices from set 1.
1 5 .
6 : 2,2,2,0,0 in some order: ( 2 5 ) orders.
2,2,1,1,0 in some order: ( 2 , 2 5 ) orders, 3 2 choices from set 1.
2,1,1,1,1 in some order: ( 1 5 ) orders, 3 4 choices from set 1.
1 0 + 2 7 0 + 4 0 5 = 6 8 5 .
3 : 2,1,0,0,0 in some order: ( 1 , 1 5 ) orders, 3 choices from set 1.
1,1,1,0,0 in some order: ( 2 5 ) orders, 3 3 choices from set 1.
6 0 + 2 7 0 = 3 3 0 .
0 : 0,0,0,0,0 in some order: ( 0 5 ) orders.
1 .
Hence 1 5 + 6 8 5 + 3 3 0 + 1 = 1 0 3 1 numbers.
1 2 3 4 5 6 7 8 9 10 11 12 13 |
|
Problem Loading...
Note Loading...
Set Loading...
The answer is the addition of coefficients of all powers divisible by 3 in
(x+x^3+x^4+x^5+x^7)^5
which is 1031
this is an application of multinomial theorem.Good question