RankRizz
JEE MAIN 2021 · 27 JUL S2+4MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — Formation of numbers and divisibility

Let nn be a non-negative integer. Then the number of divisors of the form 4n+14n + 1 of the number (10)10⋅(11)11⋅(13)13(10)^{10} \cdot (11)^{11} \cdot (13)^{13} is equal to _________.

SOLUTION

We have to count those positive divisors that can be written in the form 4n+14n+1 for the number (10)10 (11)11 (13)13.(10)^{10}\,(11)^{11}\,(13)^{13}. First we write every factor in terms of its prime constituents:

10=2⋅5,10 = 2\cdot5, so (10)10=210 510.(10)^{10}=2^{10}\,5^{10}. Hence the complete prime‐factorisation of the given number is

N  =  210 510 1111 1313.N \;=\;2^{10}\,5^{10}\,11^{11}\,13^{13}.

Any divisor dd of NN therefore has the general form

d  =  2a 5b 11c 13d1,d \;=\;2^{a}\,5^{b}\,11^{c}\,13^{d_1},

where the exponents are restricted by the powers present in NN:

0≤a≤10,0≤b≤10,0≤c≤11,0≤d1≤13.0\le a\le 10,\quad 0\le b\le 10,\quad 0\le c\le 11,\quad 0\le d_1\le 13.

To ensure that dd is of the form 4n+14n+1 we must have d≡1(mod4).d\equiv1\pmod4. We therefore study each prime factor modulo 44:

2≡2(mod4),5≡1(mod4),11≡3(mod4),13≡1(mod4).2\equiv2\pmod4,\qquad5\equiv1\pmod4,\qquad11\equiv3\pmod4,\qquad13\equiv1\pmod4.

Because 5≡1(mod4)5\equiv1\pmod4 and 13≡1(mod4),13\equiv1\pmod4, every power of 55 or 1313 is again congruent to 11 modulo 44:

5b≡1(mod4),13d1≡1(mod4)for all b,d1.5^{b}\equiv1\pmod4,\qquad13^{d_1}\equiv1\pmod4\quad\text{for all }b,d_1.

Only the powers of 22 and 1111 can change the final remainder. We therefore examine them separately.

Behaviour of 2a(mod4)2^{a}\pmod4

20=1,21=2,22=4≡0(mod4),2^{0}=1,\quad2^{1}=2,\quad2^{2}=4\equiv0\pmod4, and for any a≥2a\ge2 we still have 2a≡0(mod4).2^{a}\equiv0\pmod4. Hence

2a≡{1,a=0,2,a=1,0,a≥2.2^{a}\equiv \begin{cases} 1,&a=0,\\ 2,&a=1,\\ 0,&a\ge2. \end{cases}

If a≥2a\ge2 the factor 2a2^{a} already forces the whole product to be 0(mod4),0\pmod4, so such divisors can never be congruent to 1(mod4).1\pmod4. Therefore we must restrict ourselves to

a=0ora=1.a=0\quad\text{or}\quad a=1.

Behaviour of 11c(mod4)11^{c}\pmod4

Since 11≡3(mod4),11\equiv3\pmod4, we use the basic property 32≡9≡1(mod4).3^{2}\equiv9\equiv1\pmod4. Thus

11c≡3c≡{1,c even,3,c odd.11^{c}\equiv3^{c}\equiv \begin{cases} 1,&c\text{ even},\\ 3,&c\text{ odd}. \end{cases}

Combining the two factors

The total remainder contributed by 2a11c2^{a}11^{c} is

(2a mod 4)×(3c mod 4)(mod4).(2^{a}\bmod4)\times(3^{c}\bmod4)\pmod4.

We now test the only possible values of aa(namely 00 and 11):

• If a=0,a=0, then 2a≡1,2^{a}\equiv1, so we need 1×3c≡1(mod4),1\times3^{c}\equiv1\pmod4, which is true exactly when 3c≡1,3^{c}\equiv1, i.e. when cc is even.

• If a=1,a=1, then 2a≡2,2^{a}\equiv2, giving 2×3c(mod4)∈{2, 2}(because 3c≡1 or 3),2\times3^{c}\pmod4\in\{2,\,2\}\quad(\text{because }3^{c}\equiv1\text{ or }3), both of which are 2(mod4),2\pmod4, never 1.1. Hence no divisor with a=1a=1 can satisfy the condition.

Consequently the required divisors must have

a=0,c even.a=0,\qquad c\text{ even}.

Counting the allowable choices

• For aa there is only one choice: a=0.a=0.
• For cc (ranging from 00 to 1111) the even values are 0,2,4,6,8,10,0,2,4,6,8,10, a total of 66 choices.
• For bb any value from 00 to 1010 is permitted, giving 10−0+1=1110-0+1=11 choices.
• For d1d_1 any value from 00 to 1313 is allowed, giving 13−0+1=1413-0+1=14 choices.

Multiplying the independent counts we obtain the total number of divisors congruent to 1(mod4)1\pmod4:

1×6×11×14  =  6×154  =  924.1\times6\times11\times14 \;=\; 6\times154 \;=\; 924.

So, the answer is 924924.

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

TopicFormation of numbers and divisibility
TypeNumerical answer