Let ABC be a triangle. Consider four points p₁$p_{1}$, p₂$p_{2}$, p₃$p_{3}$, p₄$p_{4}$ on the side AB, five points p₅$p_{5}$, p₆$p_{6}$, p₇$p_{7}$, p₈$p_{8}$, p₉$p_{9}$ on the side BC and four points p₁₀$p_{10}$, p₁₁$p_{11}$, p₁₂$p_{12}$, p₁₃$p_{13}$ on the side AC. None of these points is a vertex of the triangle ABC. Then the total number of pentagons, that can be formed by taking all the vertices from the points p₁$p_{1}$, p₂$p_{2}$, .... p₁₃$p_{13}$, is ____.
A pentagon requires 5 distinct points as vertices. No three points can be collinear to form a proper polygon. Since the available points lie on the three sides of a triangle, picking 3 points from the same side will form a degenerate straight line segment rather than building a strictly convex vertex frame.
Therefore, we must select the 5 points distributed across the three sides (AB with 4 points, BC with 5 points, AC with 4 points) such that a maximum of 2 points is selected from any one side.
Step 1: Case Breakdown
We need to choose 5 points total from the three groups (4, 5, 4) with the condition that no group contributes more than 2 points.
The only valid numerical partitions of 5 into 3 parts bounded by 2 are:
Case 1: 2 points from AB, 2 points from BC, 1 point from AC
Case 2: 2 points from AB, 1 point from BC, 2 points from AC
Case 3: 1 point from AB, 2 points from BC, 2 points from AC
Geometry Based Combinatorics diagram for Q25 - JEE Main 2026 Morning
Pattern Recognition
For polygon formation from collinear sets, always frame it as a restricted partition problem. A polygon of k$k$ sides requires selecting k$k$ vertices such that no maximum allowable threshold of collinearity is breached (for a strict polygon, no 3 points on a line).
The sequence has 10$10$ terms chosen from 0, 1, 2$\{0, 1, 2\}$. It contains exactly five 1$1$s and exactly three 2$2$s. This leaves exactly 10 - 5 - 3 = 2$10 - 5 - 3 = 2$ terms to be filled by 0$0$s.
Step 1: Arrangement Calculation
We need to arrange five 1$1$s, three 2$2$s, and two 0$0$s. The number of unique sequences is:
Note that sequences can start with 0$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
Line L₁$L_1$ of slope 2$2$ and line L₂$L_2$ of slope (1)/(2)$\frac{1}{2}$ intersect at the origin O$O$. In the first quadrant, P₁, P₂, , P₁₂$P_1, P_2, \dots, P_{12}$ are 12$12$ points on line L₁$L_1$ and Q₁, Q₂, , Q₉$Q_1, Q_2, \dots, Q_9$ are 9$9$ points on line L₂$L_2$. Then the total number of triangles, that can be formed having vertices at three of the 22$22$ points O, P₁, P₂, , P₁₂, Q₁, Q₂, , Q₉$O, P_1, P_2, \dots, P_{12}, Q_1, Q_2, \dots, Q_9$, is:
A.1080$1080$
B.1134$1134$
C.1026$1026$
D.1188$1188$
Solution
Related Formula
Number of ways to choose 3$3$ points out of N$N$ points is ^N C₃$^N C_3$.
If any points are collinear, choosing 3$3$ points from those collinear points will form a straight line instead of a triangle.
Core Logic
Total number of points = 1$1$ (origin O$O$) + 12$12$ (on L₁$L_1$) + 9$9$ (on L₂$L_2$) = 22$22$ points.
Triangles are formed by choosing any 3$3$ points except those that are collinear.
Step 1: Identifying Collinear Sets
The set of points lying on L₁$L_1$ includes O, P₁, , P₁₂$O, P_1, \dots, P_{12}$, which is 13$13$ collinear points.
Number of collinear combinations = ¹³ C₃$^{13} C_3$
The set of points lying on L₂$L_2$ includes O, Q₁, , Q₉$O, Q_1, \dots, Q_9$, which is 10$10$ collinear points.
Number of collinear combinations = ¹⁰ C₃$^{10} C_3$
Step 2: Triangle Calculation
Total Triangles = Total choices of 3 points - Collinear choices on L₁$L_1$ - Collinear choices on L₂$L_2$
Class 11 Mathematics: Permutations and Combinations
Q57jee_main_2025_07_april_morningPractical 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$165$
B.155$155$
C.145$145$
D.135$135$
Solution
Related Formula
Number of ways to select r$r$ items from a pool of n$n$ distinct objects:
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$10 - 2 = 8$ players.
Available remaining pool:
Batsmen available = 7 - 1 = 6$7 - 1 = 6$ batsmen.
Bowlers available = 6 - 1 = 5$6 - 1 = 5$ bowlers.
Adjusted structural constraints for the remaining 8 slots:
Needs at least 4 - 1 = 3$4 - 1 = 3$ more batsmen.
Needs at least 4 - 1 = 3$4 - 1 = 3$ more bowlers.
Step 1: Set Up Case Combinations
Let x$x$ be the number of additional batsmen and y$y$ be the number of additional bowlers selected, where x + y = 8$x + y = 8$ with x ≥ 3$x \ge 3$ and y ≥ 3$y \ge 3$.
Possible case matches:
Case 1: 5$5$ batsmen and 3$3$ bowlers (x=5, y=3$x=5, y=3$)
Case 2: 4$4$ batsmen and 4$4$ bowlers (x=4, y=4$x=4, y=4$)
Case 3: 3$3$ batsmen and 5$5$ bowlers (x=3, y=5$x=3, y=5$)
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$n$) and the final destination requirement count (r$r$) before designing your target case distributions.
Chapter Mix
Class 11 Mathematics: Permutations and Combinations
Q75jee_main_2025_07_april_morningSubsets without Consecutive Elements
For n ≥ 2$n \geq 2$ , let Sₙ$S_{n}$ denote the set of all subsets of 1, 2, , n$\{1, 2, \dots, n\}$ with no two consecutive numbers. For example 1, 3, 5 in S₆$\{1, 3, 5\} \in \mathbf{S}_6$ , but 1, 2, 4 S₆$\{1, 2, 4\} \notin \mathbf{S}_6$ . Then n(S₅)$n(\mathbf{S}_5)$ is equal to
Numerical Answer.Answer: 13 to 13
Solution
Related Formula
The number of ways to choose r$r$ non-consecutive elements from a set of n$n$ items is given by the binomial formula:
Ways = n - r + 1Cᵣ$$\text{Ways} = {}^{n - r + 1}C_r$$
Core Logic
We need to find the total number of subsets for n = 5$n = 5$ items without consecutive values.
We break down the options based on the size of the subset (r$r$), ranging from an empty set (r=0$r=0$) up to the maximum possible non-consecutive size (r=3$r=3$).
Step 1: Compute Combinations for Each Size
Subsets containing no elements (r = 0$r = 0$):
Ways = 1 (The empty set )$$\text{Ways} = 1 \quad (\text{The empty set } \emptyset)$$
Subsets containing exactly 1 element (r = 1$r = 1$):
Shortcut: The total number of non-consecutive subsets for a set of size n$n$ follows the Fibonacci sequence pattern: Fₙ₊₂$F_{n+2}$. For n=5$n=5$, the value is the 7th Fibonacci number, which is exactly 13$13$.
Chapter Mix
Class 11 Mathematics: Permutations and Combinations
Q63jee_main_2025_08_april_eveningGeometry 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
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:
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
More Permutations and Combinations Questions — jee_main_2026_22_january_morning
Practice past-year questions one chapter at a time. Pick an exam → subject → chapter and get every PYQ for that topic — pulled together from all past papers — with the chapter's key formulas alongside.