NVAMediumJEE 2023Sets & Operations

JEE Mathematics 2023 Question with Solution

The number of elements in the set {nN:10n100 and 3n3 is a multiple of 7}\{\,n\in\mathbb{N} : 10\le n\le 100 \text{ and } 3^n-3 \text{ is a multiple of } 7\,\} is

Answer

Correct answer:15

Step-by-step solution

Standard Method

Given: We need the number of natural numbers nn such that

3n30(mod7)3^n-3 \equiv 0 \pmod{7}

with 10n10010\le n\le 100.

Find: The number of values of nn satisfying the condition.

Reduce the condition modulo 77:

3n30(mod7)3^n-3 \equiv 0 \pmod{7}

So,

3n3(mod7)3^n \equiv 3 \pmod{7}

Now find the pattern of powers of 33 modulo 77:

313(mod7)322(mod7)336(mod7)344(mod7)355(mod7)361(mod7)\begin{aligned} 3^1 &\equiv 3 \pmod{7}\\ 3^2 &\equiv 2 \pmod{7}\\ 3^3 &\equiv 6 \pmod{7}\\ 3^4 &\equiv 4 \pmod{7}\\ 3^5 &\equiv 5 \pmod{7}\\ 3^6 &\equiv 1 \pmod{7} \end{aligned}

Thus, the powers of 33 modulo 77 are periodic with period 66.

From the cycle,

3n3(mod7)    n1(mod6)3^n \equiv 3 \pmod{7} \iff n \equiv 1 \pmod{6}

So let

n=6k+1n=6k+1

subject to

106k+110010\le 6k+1\le 100

This gives

96k999\le 6k\le 99

Hence,

1.5k16.51.5\le k\le 16.5

Therefore,

k=2,3,4,,16k=2,3,4,\dots,16

The number of such integers is

162+1=1516-2+1=15

Therefore, the required number of elements is 1515.

Use the repeating remainder cycle

Given: We need 3n3(mod7)3^n \equiv 3 \pmod{7} for 10n10010\le n\le 100.

Find: How many such values of nn exist.

Since the remainders of powers of 33 modulo 77 repeat every 66 terms, the condition holds exactly when

n1(mod6)n \equiv 1 \pmod{6}

Now list the numbers in the range matching this form:

13,19,25,,9713,19,25,\dots,97

This is an arithmetic progression with common difference 66. Its number of terms is

97136+1=15\frac{97-13}{6}+1=15

Therefore, the required number of values is 1515.

Common mistakes

  • Assuming that 3n3(mod7)3^n \equiv 3 \pmod{7} means only n=1n=1. This is wrong because powers modulo a number repeat periodically. Instead, use the cycle length and solve n1(mod6)n \equiv 1 \pmod{6}.

  • Making an error while counting integers of the form 6k+16k+1 in the interval 10n10010\le n\le 100. This is wrong because boundary handling matters. Instead, convert carefully to the inequality for kk and count integer values from 22 to 1616.

  • Stopping after finding the period 66 without identifying which residue class of nn works. This is wrong because periodicity alone does not answer the question. Instead, match the exact remainder condition from the cycle, namely n1(mod6)n \equiv 1 \pmod{6}.

Practice more Sets & Operations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions