How many 7 digit Natural numbers are there which satisfy the given set of constraints.
The number is divisble by 3 .
The digit 0 is not there in the number .
Repetition of digits within the number is not allowed . (Each digit can used exactly once)
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.
nice solution
We partition the digits 1,2,3,..,9 into congruence classes modulo 3, that is, we let A={3,6,9}, B={1,4,7} and C={2,5,8}. We can form the desired 7-digits by taking 1 element from A, 3 elements from B,3 elements from C, and 3 elements from A , 2 elements from B, 2 elements from C since the seven digit formed must be divisible by 3. Thus, there are ( 1 3 ) x ( 3 3 ) x ( 3 3 ) + ( 3 3 ) x ( 2 3 ) x ( 2 3 ) = 1 2 7-elements subset from {1,2,3,...,9} whose sum of the digits is divisible by 3. Hence the total number of 7-digits formed in these sets is 1 2 x 7 ! = 6 0 4 8 0
That's the method for which the problem was made! :)
Problem Loading...
Note Loading...
Set Loading...
sum all natural no 1-9 is 45. Since 7 digits selected sum up to a number divisible by three--->the other 2 no's are also divisible by 3.so we get 12 groups---(1,2)(1,5)(1,8)(2,7)(2,4)(3,6)(3,9)(4,5)(4,8)(5,7)(6,9)(7,8). the remaining 7 can be arranged in any manner so 12*(factorial{7}) is answer