NVAMediumJEE 2025Sets & Operations

JEE Mathematics 2025 Question with Solution

Let S={p1,p2,,p10}S = \{p_1, p_2, \dots, p_{10}\} be the set of the first ten prime numbers. Let A=SPA = S \cup P, where PP is the set of all possible products of distinct elements of SS. Then the number of all ordered pairs (x,y)(x, y), where xSx \in S, yAy \in A, and xx divides yy, is _____.

Answer

Correct answer:5120

Step-by-step solution

Standard Method

Given: S={p1,p2,,p10}S = \{p_1, p_2, \dots, p_{10}\} is the set of the first ten prime numbers. PP is the set of all possible products of distinct elements of SS, and A=SPA = S \cup P.

Find: The number of ordered pairs (x,y)(x,y) such that xSx \in S, yAy \in A, and xx divides yy.

Each element of AA corresponds to a non-empty subset of SS:

  • a one-element subset gives an element of SS,
  • a larger subset gives a product in PP.

So the total number of elements in AA is

A=2101=1023|A| = 2^{10} - 1 = 1023

because all non-empty subsets of a set of 1010 elements are counted.

Now fix any xSx \in S. An element yAy \in A is divisible by xx exactly when the corresponding subset contains xx. After fixing xx, each of the remaining 99 primes may be either chosen or not chosen independently.

Hence the number of elements of AA divisible by a fixed xx is

29=5122^9 = 512

Since there are 1010 choices for xSx \in S, the total number of ordered pairs is

10×512=512010 \times 512 = 5120

Therefore, the number of ordered pairs is 51205120.

Counting by subsets

Given: SS has 1010 distinct prime numbers.

Find: Count all ordered pairs (x,y)(x,y) with xSx \in S, yAy \in A, and xyx \mid y.

Write every element of AA as the product of elements from a non-empty subset of SS. This works because:

  • if the subset has size 11, the product is a prime in SS,
  • if the subset has size at least 22, the product belongs to PP.

So every non-empty subset of SS gives exactly one element of AA.

For a fixed prime xSx \in S, we want those subsets whose product is divisible by xx. That happens exactly when xx is included in the subset.

Once xx is included, the remaining 99 primes can be chosen freely. Therefore the number of such subsets is

k=09(9k)=29=512\sum_{k=0}^{9} \binom{9}{k} = 2^9 = 512

Thus, for each fixed xx, there are 512512 possible values of yy.

Finally,

Total ordered pairs=10512=5120\text{Total ordered pairs} = 10 \cdot 512 = 5120

So the required answer is 51205120.

Note: The alternate working shown on the page writes 1+29=5131 + 2^9 = 513 for each fixed prime, but then concludes 51205120. The correct count is 29=5122^9 = 512 because the one-element subset corresponding to xx itself is already included in these 292^9 cases.

Common mistakes

  • Counting xx itself separately after already counting all subsets containing xx. This is wrong because the one-element subset {x}\{x\} is already included in the count 292^9. Count all subsets containing xx only once.

  • Treating A|A| as S+P|S| + |P| without noticing overlap. This is wrong because every prime in SS also arises as a product of a one-element subset. Instead, identify elements of AA with all non-empty subsets of SS.

  • Using 2102^{10} instead of 292^9 for the number of multiples of a fixed prime. This is wrong because once one prime xx is fixed as included, only the remaining 99 primes are free to vary.

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