RankRizz
JEE MAIN 2021 · 25 FEB S2+4MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — Divisibility and remainder problems

The total number of two digit numbers ′n′'n', such that 3n+7n3^n + 7^n is a multiple of 10, is ______.

SOLUTION

We need to find the number of two-digit numbers nn such that 3n+7n3^n + 7^n is a multiple of 10. For this, we need 3n+7n≡0(mod10)3^n + 7^n \equiv 0 \pmod{10}.

We examine the last digits of powers of 3 and 7. The cycle of last digits of 3n3^n is: 3,9,7,13, 9, 7, 1 (period 4). The cycle of last digits of 7n7^n is: 7,9,3,17, 9, 3, 1 (period 4).

Adding the last digits for each n mod 4n \bmod 4: when n≡1(mod4)n \equiv 1 \pmod{4}, last digits sum to 3+7=103 + 7 = 10; when n≡2(mod4)n \equiv 2 \pmod{4}, last digits sum to 9+9=189 + 9 = 18; when n≡3(mod4)n \equiv 3 \pmod{4}, last digits sum to 7+3=107 + 3 = 10; when n≡0(mod4)n \equiv 0 \pmod{4}, last digits sum to 1+1=21 + 1 = 2.

So 3n+7n3^n + 7^n is divisible by 10 when the last digit sum is 10 or 20, etc. From above, this happens when n≡1n \equiv 1 or 3(mod4)3 \pmod{4}, i.e., when nn is odd.

The two-digit numbers range from 10 to 99. The odd two-digit numbers are 11, 13, 15, ..., 99. Their count is 99−112+1=45\frac{99 - 11}{2} + 1 = 45.

Therefore, the total number of such two-digit numbers is 4545.

Tagged Divisibility and remainder problems. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicDivisibility and remainder problems
TypeNumerical answer