RankRizz
JEE MAIN 2021 · 27 AUG S1+4MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — Arrangements with restrictions

A number is called a palindrome if it reads the same backward as well as forward. For example 285582 is a six digit palindrome. The number of six digit palindromes, which are divisible by 55, is _________.

SOLUTION

First, recall that a six-digit palindrome has the form ABCCBA‾,\overline{ABC CBA}, where the first three digits A,B,CA,B,C are repeated in reverse order to give the last three digits. Writing this number in expanded form, we have

ABCCBA‾=100000A+10000B+1000C+100C+10B+A.\overline{ABC CBA}=100000A+10000B+1000C+100C+10B+A.

Simplifying the powers of ten,

100000A+10000B+1000C+100C+10B+A=100001A+10010B+1100C.100000A+10000B+1000C+100C+10B+A=100001A+10010B+1100C.

We need those six-digit palindromes that are divisible by 55.55. Because 55=5×11,55=5\times 11, a number is divisible by 5555 if and only if it is simultaneously divisible by 55 and by 11.11. We shall impose these two conditions one by one.

Condition for divisibility by 5. A decimal number is divisible by 55 exactly when its last digit is either 00 or 5.5. In our palindrome, the last digit is A,A, and the first digit is the same A.A. Since we require a six-digit number, the leading digit cannot be zero. Therefore

A=5.A=5.

So every six-digit palindrome divisible by 55 must begin and end with the digit 5.5. No other choice of AA is possible.

Condition for divisibility by 11. The well-known test for divisibility by 1111 states: “A number is divisible by 1111 if and only if the absolute difference between the sum of the digits in odd positions and the sum of the digits in even positions is a multiple of 11.11.”

Label the positions of the digits from the left as 1 through 6. Our palindrome with digits A,B,C,C,B,AA,B,C,C,B,A then has

Odd positions (1, 3, 5): A,  C,  B,A,\;C,\;B, so Sumodd=A+C+B.\text{Sum}_{\text{odd}} = A+C+B. Even positions (2, 4, 6): B,  C,  A,B,\;C,\;A, so Sumeven=B+C+A.\text{Sum}_{\text{even}} = B+C+A. Clearly

Sumodd−Sumeven=(A+C+B)−(B+C+A)=0,\text{Sum}_{\text{odd}}-\text{Sum}_{\text{even}}=(A+C+B)-(B+C+A)=0,

and 00 is a multiple of 11.11. Hence every six-digit palindrome automatically satisfies the divisibility-by-11 condition, no matter what the values of BB and CC might be.

Counting the possibilities. • We have already fixed A=5A=5 to meet the divisibility-by-5 requirement. • The digit BB can be any digit from 00 to 9,9, giving 1010 possible values. • The digit CC can also be any digit from 00 to 9,9, giving another 1010 possible values.

Because the choices of BB and CC are independent, the total number of distinct six-digit palindromes satisfying both conditions is

1 (choice for A)×10 (choices for B)×10 (choices for C)=100.1 \text{ (choice for }A)\times 10 \text{ (choices for }B)\times 10 \text{ (choices for }C)=100.

So, the answer is 100100.

Tagged Arrangements with restrictions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicArrangements with restrictions
TypeNumerical answer