RankRizz
JEE MAIN 2014 · 11 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

JEE Main 2014 Mathematics question — Formation of numbers and divisibility

An eight digit number divisible by 9 is to be formed using digits from 0 to 9 without repeating the digits. The number of ways in which this can be done is:

SOLUTION

First recall the rule for divisibility by 9: a whole number is divisible by 9 exactly when the sum of its digits is itself a multiple of 9.

We must form an eight-digit number with no repeated digits chosen from {0,1,2,3,4,5,6,7,8,9}.\{0,1,2,3,4,5,6,7,8,9\}. Instead of choosing the eight digits directly, it is easier to decide which two digits will be left out. Once the two omitted digits are fixed, the remaining eight are automatically selected.

The total sum of all ten digits is 0+1+2+3+4+5+6+7+8+9=45,0+1+2+3+4+5+6+7+8+9 = 45, and 4545 is a multiple of 9.9. If the two omitted digits are aa and b,b, then the sum of the chosen eight digits equals 45−(a+b).45-(a+b). For this sum to be divisible by 9,9, we need 45−(a+b)≡0(mod9).45-(a+b)\equiv 0 \pmod 9. Because 45≡0(mod9),45\equiv 0 \pmod 9, the condition becomes simply (a+b)≡0(mod9).(a+b)\equiv 0 \pmod 9. Thus we must omit two distinct digits whose sum is a multiple of 9.$</p> <p>The only possible non-negative multiples of9obtainablebyaddingtwo<em>distinct</em>singledigitsareobtainable by adding two <em>distinct</em> single digits are9itself(sinceitself (since0+0=0usesthesamedigittwiceanduses the same digit twice and9+9=18repeatsrepeats9).Hencewelistalldistinctunorderedpairswhosesumis). Hence we list all distinct unordered pairs whose sum is9:</p><p>:</p> <p>(0,9),\;(1,8),\;(2,7),\;(3,6),\;(4,5).</p><p>Thereareexactly</p> <p>There are exactly5suchpairs,sotherearesuch pairs, so there are5differentsetsofeightdigitswhosedigit−sumsatisfiesthedivisibilitycondition.</p><p>Nextwecount,foreachofthesefivesets,howmanyeight−digitnumberscanbeformed.Wemustalsorespecttheusualrulethatanintegercannotstartwiththedigitdifferent sets of eight digits whose digit-sum satisfies the divisibility condition.</p> <p>Next we count, for each of these five sets, how many eight-digit numbers can be formed. We must also respect the usual rule that an integer cannot start with the digit0.Twosituationsarise:</p><p><strong>Case 1:</strong>TheomittedpairisTwo situations arise:</p> <p><strong>Case 1:</strong> The omitted pair is(0,9).HerethedigitHere the digit0is<em>omitted</em>,soeachpermutationoftheremainingeightdigitsautomaticallystartswithanon−zerodigit.Thenumberofpossiblearrangementsisthereforeis <em>omitted</em>, so each permutation of the remaining eight digits automatically starts with a non-zero digit. The number of possible arrangements is therefore8!.</p> <p><strong>Case 2:</strong> Any of the other four pairs is omitted, i.e.\(1,8),(2,7),(3,6),(4,5).NowthedigitNow the digit0<em>ispresent</em>amongtheeightchosendigits.Allpermutationsofeightdistinctdigitsnumber<em>is present</em> among the eight chosen digits. All permutations of eight distinct digits number8!,butwemustsubtractthearrangementsthatbeginwithbut we must subtract the arrangements that begin with0.IfIf0isfixedinthefirstplace,theremainingsevenpositionscanbefilledinis fixed in the first place, the remaining seven positions can be filled in7!ways.Hencetheadmissiblearrangementsforeachsuchsetequalways. Hence the admissible arrangements for each such set equal8!-7! = 7!(8-1)=7!\times 7.</p><p>Combiningbothcases,thetotalcountofdesirednumbersis</p><p></p> <p>Combining both cases, the total count of desired numbers is</p> <p>\begin{aligned} \text{Total}&=1\cdot 8! \;+\;4\cdot(8!-7!)\\ &=8!+4\bigl(8!-7!\bigr)\\ &=8!+4\cdot8!-4\cdot7!\\ &=5\cdot8!-4\cdot7!. \end{aligned}</p><p>Because</p> <p>Because8!=8\cdot7!,werewritetheexpression:</p><p>we rewrite the expression:</p> <p>5\cdot8!-4\cdot7! = 5\cdot(8\cdot7!)-4\cdot7! =(40-4)\,7! =36\,7!.</p><p>Thustherequirednumberofeight−digitnumbersis</p> <p>Thus the required number of eight-digit numbers is36(7!).$$

Hence, the correct answer is Option D.

Tagged Formation of numbers and divisibility. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicFormation of numbers and divisibility
TypeMultiple choice