JEE Main · Mathematics → Steady

Permutations and Combinations appeared 40 times across 3 years — 4.6% of Mathematics. This question is from Combinatorial Power Subsets and Divisibility.

Year 2026 2025 2024 Total
Questions 13 19 8 40

Let S = p₁, p₂, …, p₁₀ be the set of the first ten prime numbers. Let A = S P, where P is the set of all possible products of distinct elements of S. Then the number of all ordered pairs (x, y), x in S, y in A such that x divides y, is ________.

Numerical Answer Type:
Enter a numerical value Answer: 5120 +4 marks

Solution & Explanation

Related Formula

The number of subsets of a set containing n elements is given by the power set formula:

Count = 2ⁿ
Core Logic

Let's analyze the counting criteria for each choice of divisor x in S. Since S contains 10 elements, there are 10 choices for the prime number x:

Case 1: Elements belonging to \subset S For a prime x to divide an entry y in S, y must be exactly equal to x itself (since all elements in S are distinct primes). This yields exactly 1 choice for each prime x.

Step 1: Count elements belonging to product set P

For a prime x to divide an entry y in P, where y is a product of distinct primes from S, the prime x must be one of the factors included in that product.

To form such a product, x must be chosen, and the remaining factors can be selected from any combination of the other 9 primes in S. The number of ways to choose subsets from the remaining 9 primes is given by the power set formula:

Ways = 2⁹ = 512
Step 2: Combine and Evaluate Total Ordered Pairs

Sum the valid outcomes from both subsets for a single prime x:

Total choices for a fixed x = 1 + 512 = 513 ?

Wait, let's re-verify the definition of set P. P is the set of all possible products of distinct elements of S. Does P include products of single elements? If a product has only 1 element, it is just the prime itself, which is already in S.

Let's use the alternative \subset framing: an element y in A corresponds to a non-empty \subset of S whose elements are multiplied together. For a fixed prime x in S to divide y, x must be included in that \subset. The remaining elements of the \subset can be chosen in any way from the remaining 9 primes, which gives:

Total subsets containing x = 2⁹ = 512

Since there are 10 choices for the prime x, the total number of ordered pairs (x,y) is:

Total Pairs = 10 · 2⁹ = 10 · 512 = 5120
Pattern Recognition

Instead of counting the pairs by analyzing values of y first, reversing the calculation to count based on the number of choices for the divisor x simplifies the problem into a straightforward power set calculation.

Chapter Mix

Class 11 Mathematics: Permutations and Combinations Class 11 Mathematics: Sets

More Permutations and Combinations Previous-Year Questions — Page 4

Q jee_main_2025_02_april_morning Permutation of Multiset
The number of sequences of ten terms, whose terms are either 0 or 1 or 2, that contain exactly five 1s and exactly three 2s, is equal to:
  • A. 360
  • B. 45
  • C. 2520
  • D. 1820

Solution

Related Formula

The number of permutations of n objects where p are of one kind, q are of another kind, and r are of a third kind is:

Total Permutations = (n!)/(p! · q! · r!)
Core Logic

The sequence has 10 terms chosen from 0, 1, 2. It contains exactly five 1s and exactly three 2s. This leaves exactly 10 - 5 - 3 = 2 terms to be filled by 0s.

Step 1: Arrangement Calculation

We need to arrange five 1s, three 2s, and two 0s. The number of unique sequences is:

Total Sequences = (10!)/(5! · 3! · 2!) Total Sequences = (10 × 9 × 8 × 7 × 6)/(3 × 2 × 1 × 2 × 1) = 2520
Pattern Recognition

Note that sequences can start with 0 since it asks for general sequences of ten terms rather than a standard non-zero multi-digit number representation.

Chapter Mix

Class 11 Mathematics: Permutations and Combinations

Q58 jee_main_2025_03_april_evening Geometry Problems
Line L₁ of slope 2 and line L₂ of slope (1)/(2) intersect at the origin O. In the first quadrant, P₁, P₂, , P₁₂ are 12 points on line L₁ and Q₁, Q₂, , Q₉ are 9 points on line L₂. Then the total number of triangles, that can be formed having vertices at three of the 22 points O, P₁, P₂, , P₁₂, Q₁, Q₂, , Q₉, is:
  • A. 1080
  • B. 1134
  • C. 1026
  • D. 1188

Solution

Related Formula

Number of ways to choose 3 points out of N points is ^N C₃. If any points are collinear, choosing 3 points from those collinear points will form a straight line instead of a triangle.

Core Logic

Total number of points = 1 (origin O) + 12 (on L₁) + 9 (on L₂) = 22 points. Triangles are formed by choosing any 3 points except those that are collinear.

Step 1: Identifying Collinear Sets
  • The set of points lying on L₁ includes O, P₁, , P₁₂, which is 13 collinear points.
  • Number of collinear combinations = ¹³ C₃

  • The set of points lying on L₂ includes O, Q₁, , Q₉, which is 10 collinear points.
  • Number of collinear combinations = ¹⁰ C₃

Step 2: Triangle Calculation

Total Triangles = Total choices of 3 points - Collinear choices on L₁ - Collinear choices on L₂

Total = ²² C₃ - ¹³ C₃ - ¹⁰ C₃

Calculating individual combinations:

  • ²² C₃ = (22 × 21 × 20)/(3 × 2 × 1) = 1540
  • ¹³ C₃ = (13 × 12 × 11)/(3 × 2 × 1) = 286
  • ¹⁰ C₃ = (10 × 9 × 8)/(3 × 2 × 1) = 120
Triangles = 1540 - 286 - 120 = 1134
Pattern Recognition

Alternatively, count using partition combinations to avoid large factorials:

Triangles = (¹² C₂ × ⁹ C₁) + (⁹ C₂ × ¹² C₁) + (1 × ¹² C₁ × ⁹ C₁) = (66 × 9) + (36 × 12) + (108) = 594 + 432 + 108 = 1134
Chapter Mix

Class 11 Mathematics: Permutations and Combinations

Q57 jee_main_2025_07_april_morning Practical Problems on Combinations
From a group of 7 batsmen and 6 bowlers, 10 players are to be chosen for a team, which should include atleast 4 batsmen and atleast 4 bowlers. One batsmen and one bowler who are captain and vice-captain respectively of the team should be included. Then the total number of ways such a selection can be made, is
  • A. 165
  • B. 155
  • C. 145
  • D. 135

Solution

Related Formula

Number of ways to select r items from a pool of n distinct objects:

ⁿCᵣ = (n!)/(r!(n-r)!)
Core Logic

Total required players = 10. Constraints:

  • Minimum 4 batsmen and minimum 4 bowlers.
  • 1 specific batsman (captain) and 1 specific bowler (vice-captain) are fixed (already selected).
  • Remaining selection required:

  • Total players left to choose = 10 - 2 = 8 players.
  • Available remaining pool:
  • Batsmen available = 7 - 1 = 6 batsmen.
  • Bowlers available = 6 - 1 = 5 bowlers.
  • Adjusted structural constraints for the remaining 8 slots:

  • Needs at least 4 - 1 = 3 more batsmen.
  • Needs at least 4 - 1 = 3 more bowlers.
Step 1: Set Up Case Combinations

Let x be the number of additional batsmen and y be the number of additional bowlers selected, where x + y = 8 with x ≥ 3 and y ≥ 3.

Possible case matches:

  • Case 1: 5 batsmen and 3 bowlers (x=5, y=3)
  • Case 2: 4 batsmen and 4 bowlers (x=4, y=4)
  • Case 3: 3 batsmen and 5 bowlers (x=3, y=5)
Step 2: Calculate Each Case Value
  • For Case 1:
Ways = ⁶C₅ × ⁵C₃ = 6 × 10 = 60
  • For Case 2:
Ways = ⁶C₄ × ⁵C₄ = 15 × 5 = 75
  • For Case 3:
Ways = ⁶C₃ × ⁵C₅ = 20 × 1 = 20
Step 3: Compute Total Ways

Sum the combinations across all valid exhaustive paths:

Total Ways = 60 + 75 + 20 = 155
Pattern Recognition

When specific roles (like captain/vice-captain) are strictly forced into the selection group, always remove them from both the operational choice pool size (n) and the final destination requirement count (r) before designing your target case distributions.

Chapter Mix

Class 11 Mathematics: Permutations and Combinations

Q75 jee_main_2025_07_april_morning Subsets without Consecutive Elements
For n ≥ 2 , let Sₙ denote the set of all subsets of 1, 2, , n with no two consecutive numbers. For example 1, 3, 5 in S₆ , but 1, 2, 4 S₆ . Then n(S₅) is equal to
Numerical Answer. Answer: 13 to 13

Solution

Related Formula

The number of ways to choose r non-consecutive elements from a set of n items is given by the binomial formula:

Ways = n - r + 1Cᵣ
Core Logic

We need to find the total number of subsets for n = 5 items without consecutive values. We break down the options based on the size of the subset (r), ranging from an empty set (r=0) up to the maximum possible non-consecutive size (r=3).

Step 1: Compute Combinations for Each Size
  • Subsets containing no elements (r = 0):
Ways = 1 (The empty set )
  • Subsets containing exactly 1 element (r = 1):
Ways = 5 - 1 + 1C₁ = ⁵C₁ = 5 (1, 2, 3, 4, 5)
  • Subsets containing exactly 2 elements (r = 2):
Ways = 5 - 2 + 1C₂ = ⁴C₂ = 6
  • Subsets containing exactly 3 elements (r = 3):
Ways = 5 - 3 + 1C₃ = ³C₃ = 1 (1, 3, 5)
Step 2: Sum the Total Counts

Add all possible valid non-consecutive subset paths together:

Total Subsets n(S₅) = 1 + 5 + 6 + 1 = 13
Pattern Recognition

Shortcut: The total number of non-consecutive subsets for a set of size n follows the Fibonacci sequence pattern: Fₙ₊₂. For n=5, the value is the 7th Fibonacci number, which is exactly 13.

Chapter Mix

Class 11 Mathematics: Permutations and Combinations

Q63 jee_main_2025_08_april_evening Geometry Problems in Combinatorics
There are 12 points in a plane, no three of which are in the same straight line, except 5 points which are collinear. Then the total number of triangles that can be formed with the vertices at any three of these 12 points is
  • A. 230
  • B. 220
  • C. 200
  • D. 210

Solution

Related Formula
Net Triangles = n3 - m3
Core Logic

To calculate valid un-collapsed geometric triangles, find total ways to select 3 distinct coordinate indicators from the set and remove choices restricted entirely within the inline row sequence.

Step 1: Compute Full Dynamic Combinations

Choosing 3 general elements from the array size of 12:

123 = (12 × 11 × 10)/(3 × 2 × 1) = 220
Step 2: Isolate Internal Flattened Collinear Triplets

Choosing 3 items completely bundled inside the collinear group row of size 5:

53 = 10
Step 3: Deduce Triangles
Triangles Generated = 220 - 10 = 210
Pattern Recognition

Points in a straight line cannot create spatial enclosing fields. Subtracting localized combinations from generalized permutations accounts for structural constraints.

Chapter Mix

Class 11 Mathematics: Permutations and Combinations

Rankbit System
JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%) | JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%)