JEE Main 2021 Mathematics question — Formation of numbers and divisibility
Let n be a non-negative integer. Then the number of divisors of the form 4n+1 of the number (10)10⋅(11)11⋅(13)13 is equal to _________.
SOLUTION
We have to count those positive divisors that can be written in the form 4n+1 for the number
(10)10(11)11(13)13.
First we write every factor in terms of its prime constituents:
10=2⋅5, so (10)10=210510.
Hence the complete prime‐factorisation of the given number is
N=21051011111313.
Any divisor d of N therefore has the general form
d=2a5b11c13d1,
where the exponents are restricted by the powers present in N:
0≤a≤10,0≤b≤10,0≤c≤11,0≤d1≤13.
To ensure that d is of the form 4n+1 we must have d≡1(mod4).
We therefore study each prime factor modulo 4:
2≡2(mod4),5≡1(mod4),11≡3(mod4),13≡1(mod4).
Because 5≡1(mod4) and 13≡1(mod4),every power of 5 or 13 is again congruent to 1 modulo 4:
5b≡1(mod4),13d1≡1(mod4)for all b,d1.
Only the powers of 2 and 11 can change the final remainder.
We therefore examine them separately.
Behaviour of 2a(mod4)
20=1,21=2,22=4≡0(mod4),
and for any a≥2 we still have 2a≡0(mod4).
Hence
2a≡⎩⎨⎧1,2,0,a=0,a=1,a≥2.
If a≥2 the factor 2a already forces the whole product to be 0(mod4), so such divisors can never be congruent to 1(mod4).
Therefore we must restrict ourselves to
a=0ora=1.
Behaviour of 11c(mod4)
Since 11≡3(mod4), we use the basic property 32≡9≡1(mod4).
Thus
11c≡3c≡{1,3,c even,c odd.
Combining the two factors
The total remainder contributed by 2a11c is
(2amod4)×(3cmod4)(mod4).
We now test the only possible values of a(namely 0 and 1):
• If a=0, then 2a≡1, so we need
1×3c≡1(mod4),
which is true exactly when 3c≡1, i.e. when c is even.
• If a=1, then 2a≡2, giving
2×3c(mod4)∈{2,2}(because 3c≡1 or 3),
both of which are 2(mod4), never 1.
Hence no divisor with a=1 can satisfy the condition.
Consequently the required divisors must have
a=0,c even.
Counting the allowable choices
• For a there is only one choice: a=0. • For c (ranging from 0 to 11) the even values are
0,2,4,6,8,10, a total of 6 choices.
• For b any value from 0 to 10 is permitted, giving 10−0+1=11 choices.
• For d1 any value from 0 to 13 is allowed, giving 13−0+1=14 choices.
Multiplying the independent counts we obtain the total number of divisors congruent to 1(mod4):
1×6×11×14=6×154=924.
So, the answer is 924.
Tagged Formation of numbers and divisibility. Machine-assigned, so read it as a strong shortlist rather than a verdict.