Direct multiplication rule, factorial definitions, basic permutations $P(n, r)$, circular arrangements $(n-1)!$, committee selection with gender constraints, and straight lines/triangles from coplanar points.
Level 2: Intermediate152 Questions (69%)
Gap and string methods with multi-case restrictions, rank of a word with repeated letters in dictionary order, distribution of identical balls into distinct boxes (Stars & Bars), and digit problems with modulo divisibility.
Level 3: Advanced44 Questions (20%)
Multi-constraint integer solutions with individual upper bounds, derangements combined with partial matching, multinomial expansions with constrained exponents, and partition of identical objects into identical shelves.
Number greater than $1000$ but less than $4000$ is formed using the digits $0, 1, 2, 3, 4$ (repetition allowed) is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Total number of four digit odd numbers that can be formed using $0, 1, 2, 3, 5, 7$ (repetition allowed) are :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Five digit number divisible by $3$ is formed using $0, 1, 2, 3, 4, 6$ and $7$ without repetition. Total number of such numbers is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
If ${}^nC_r$ denotes the number of combinations of $n$ things taken $r$ at a time, then the expression ${}^nC_{r+1} + {}^nC_{r-1} + 2 \cdot {}^nC_r$ equals :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key C.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
The number of ways in which $6$ men and $5$ women can dine at a round table if no two women are to sit together is given by :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer A.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 6⭐⭐ Intermediate Fundamental Counting & Words 2003+4, -1
A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from the first five questions. The number of choices available to him is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 7⭐ Foundational Fundamental Counting & Words 2004+4, -1
How many ways are there to arrange the letters in the word GARDEN with the vowels in alphabetical order?
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 8⭐ Foundational Distribution & Integer Solutions 2004+4, -1
The number of ways of distributing $8$ identical balls in $3$ distinct boxes so that none of the boxes is empty is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Question 9⭐⭐ Intermediate Fundamental Counting & Words 2005+4, -1
If the letters of word SACHIN are arranged in all possible ways and these words are written out as in dictionary, then the word SACHIN appears at serial number
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are 10 candidates and 4 are of be elected. If a voter votes for at least one candidate, then the number of ways in which he can vote is
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer C.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Question 11⭐ Foundational Distribution & Integer Solutions 2007+4, -1
The set $S = \{1, 2, 3, \dots, 12\}$ is to be partitioned into three sets $A, B, C$ of equal size. Thus, $A \cup B \cup C = S, A \cap B = B \cap C = A \cap C = \phi$. The number of ways to partition $S$ is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value C.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two S are adjacent?
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer D.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 13⭐ Foundational Fundamental Counting & Words 2008+4, -1
In a shop there are five types of ice-creams available. A child buys six ice-creams. Statement -1: The number of different ways the child can buy the six ice-creams is IOC5. Statement —2 : The number of different ways the child can buy the six ice-creams is equal to the number of different ways of arranging 6 AS and 4 B's in a row.
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
From 6 different novels and 3 different dictionaries, 4 novels and 1 dictionary are to be selected and arranged in a row on the shelf so that the dictionary is always in the middle. Then the number of such arrangements is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result D.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 15⭐⭐ Intermediate Distribution & Integer Solutions 2010+4, -1
There are two urns. Urn A has $3$ distinct red balls and urn B has $9$ distinct blue balls. From each urn two balls are taken out at random and then transferred to the other. The number of ways in which this can be done is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value C.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Question 16⭐ Foundational Distribution & Integer Solutions 2011+4, -1
This question has Statement —1 and Statement —2. Of the four choices given after the statements, choose the one that best describes the two statements. Statement - 1 : The number of ways of distributing 10 identical balls in 4 distinct boxes such that no box is empty is 9C3 Statement-2: The number of ways of choosing any 3 places from 9 different places is 9C3.
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Let X — {1, 2, 3, 4, 5}. The number of different ordered pairs (Y, Z) that can be formed such that Y C X, Z C X and Y n Z is empty, is
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key B.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
Question 18⭐⭐ Intermediate Distribution & Integer Solutions 2012 (Offline)+4, -1
Assuming the balls to be identical except for difference in colours, the number of ways in which one or more balls can be selected from $10$ white, $9$ green and $7$ black balls is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
If the number of $5$-element subsets of the set $A = \{a_1, a_2, \dots, a_{20}\}$ of $20$ distinct elements is $k$ times the number of $5$-element subsets containing $a_4$, then $k$ is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of arrangements that can be formed from the letters a, b, c, d, e, f taken 3 at a time without repetition and each arrangement containing at least one vowel, is
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer A.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
If seven women and seven men are to be seated around a circular table such that there is a man on either side of every woman, then the number of seating arrangements is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer A.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Let $T_n$ be the number of all possible triangles formed by joining vertices of an $n$-sided regular polygon. If $T_{n+1} - T_n = 10$, then the value of $n$ is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
A committee of $4$ persons is to be formed from $2$ ladies, $2$ old men and $4$ young men such that it includes at least $1$ lady, at least $1$ old man and at most $2$ young men. Then the total number of ways in which this committee can be formed is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 24⭐⭐ Intermediate Fundamental Counting & Words 2013 (22 Apr)+4, -1
The number of ways in which an examiner can assign 30 marks to 8 questions, giving not less than 2 marks to any question, is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
On the sides $AB, BC, CA$ of a $\triangle ABC$, $3, 4, 5$ distinct points (excluding vertices $A, B, C$) are respectively chosen. The number of triangles that can be constructed using these chosen points as vertices are :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
$5$-digit numbers are to be formed using $2, 3, 5, 7, 9$ without repeating the digits. If $p$ be the number of such numbers that exceed $20000$ and $q$ be the number of those that lie between $30000$ and $90000$, then $p : q$ is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The sum of the digits in the unit's place of all the 4 - digit numbers formed by using the numbers 3, 4, 5 and6, without repetition is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
An eight digit number divisible by 9 is to be formed using digits from O to 9 without repeating the digits. The number of ways in which this can be done is:
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
8-digit numbers are formed using the digits 1, 1, 2, 2, 2, 3, 4, 4. The number of such numbers in which the odd digits do no occupy odd places, is:
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Two women and some men participated in a chess tournament in which every participant played two games with each of the other participants. If the number of games that the men played between them- selves exceeds the number of games that the men played with the women by66, then the number of men who participated in the tournament lies in the interval
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Let A and B be two sets containing four and two elements respectively. Then the number of subsets of the set A x B, each having at least three elements is
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of points, having both co-ordinates as integers, that lie in the interior of the triangle with vertices (O, O) , (0, 41) and (41, 0) is
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result A.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of integers greater than 6000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ways of selecting $15$ teams from $15$ men and $15$ women, such that each team consists of a man and a woman is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 35⭐ Foundational Fundamental Counting & Words 2015 (11 Apr)+4, -1
Let A {:rl, x2, ... , at} andB {YI, !/2, 1/3} be two sets containing seven and three distinct elements respectively. Then the total number of functions f : A —+ B that are onto, if there exist exactly three elements in A such that f (x) = Y2, is equal to:
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 36⭐⭐ Intermediate Fundamental Counting & Words 2015 (11 Apr)+4, -1
Let $A = \{x_1, x_2, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. Then the total number of functions $f: A \to B$ that are onto, if there exist exactly three elements $x \in A$ such that $f(x) = y_2$, is equal to :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 37⭐⭐ Intermediate Fundamental Counting & Words 2016 (03 Apr)+4, -1
If all the words (with or without meaning) having five letters, formed using the letters of the word SMALL and arranged as in a dictionary; then the position of the word SMALL is
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result B.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 38⭐⭐ Intermediate Fundamental Counting & Words 2016 (09 Apr)+4, -1
If the four letter words (need not be meaningful) are to be formed using the letters from the word "MEDITERRANEAN" such that the first letter is R and the fourth letter is E, then the total number of all such words is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result B.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
If $\frac{{}^{n+2}C_6}{{}^{n-2}P_2} = 11$, then $n$ satisfies the equation :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key C.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
A man X has 7 friends, 4 of them are ladies and 3 are men. His wife Y also has 7 friends, 3 of them are ladies and 4 are men. Assume X and Y have no common friends. Then the total number of ways in which X and Y together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of X and Y are in this party is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer A.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 41⭐⭐ Intermediate Fundamental Counting & Words 2017 (08 Apr)+4, -1
If all the words, with or without meaning, are written using the letters of the word QUEEN and are arranged as in English dictionary, then the position of the word QUEEN is:
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
A man $X$ has $7$ friends, $4$ of them are ladies and $3$ are men. His wife $Y$ also has $7$ friends, $3$ of them are ladies and $4$ are men. Assume $X$ and $Y$ have no common friends. Then the total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men, so that $3$ friends of each of $X$ and $Y$ are in this party, is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
From 6 different novels and 3 different dictionaries, 4 novels and I dictionary are to be selected and arranged in a row on a shelf so that the dictionary is always in the middle. The number of such arrangements is:
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
$n$-digit numbers are formed using only three digits $2, 5$ and $7$. The smallest value of $n$ for which $900$ such distinct numbers can be formed is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
$n$-digit numbers are formed using only three digits $2, 5$ and $7$. The smallest value of $n$ for which $900$ such distinct numbers can be formed, is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 46⭐⭐ Intermediate Fundamental Counting & Words 2018 (15 Apr, Shift 2)+4, -1
The number of four letter words that can be formed using the letters of the word BARRACK is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 47⭐⭐ Intermediate Fundamental Counting & Words 2018 (16 Apr)+4, -1
The number of four letter words that can be formed using the letters of the word BARRACK is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Consider a class of 5 girls and 7 boys. The number of different teams consisting of 2 girls and 3 boys that can be formed from this class, if there are two specific boys A and B, who refuse to be the members of the same team, is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result A.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of natural numbers less than $7000$ which can be formed by using the digits $0, 1, 3, 7, 9$ (repetition of digits allowed) is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Consider three boxes, each containing 10 balls labelled 1, 2, .... 10. Suppose one ball is randomly drawn from each of the boxes. Denote by ni, the label of the ball drawn from the ith box, (i = Then, the number of ways in which the balls can be chosen such that < < is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value C.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Lets = 100}, then number of non-empty subsets A of S such that the product of elements in A is even is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
In a tournament, there are $m$ men and $2$ women. Each participant plays two games with every other participant. If the number of games played between the men exceeds the number of games played between the men and the women by $84$, then the value of $m$ is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
If ${}^nC_4, {}^nC_5$ and ${}^nC_6$ are in A.P., then $n$ can be :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key B.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
All possible numbers are formed using the digits I, 1, 2, 2, 2, 2, 3, 4, 4 taken all at a time. The number of such numbers in which the odd digits occupy even places is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of four-digit numbers strictly greater than 4321 that can be formed using the digit 0, 1, 2, 3, 4, 5 (repetition of digits is allowed) is:
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Consider a committee of $10$ people chosen from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of $6$-digit numbers that can be formed using the digits $0, 1, 2, 5, 7$ and $9$ which are divisible by $11$ and no digit is repeated is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Suppose that 20 pillars of the same height have been erected along the boundary of circular stadium. If the top of each pillar has been connected by beams with the top of all its non-adjacent pillars, then the total number of beams is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer A.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The Number of ways of choosing 10 objects out of 31 objects of which 10 are identical and the remaining 21 are distinct, is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value A.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
A group of students comprises of 5 boys and n girls. If the number of ways, in which a team of 3 students can randomly be selected from this group such that there is at least one boy and at least one girl in each team, is 1750, then n is equal to
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer C.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
The number of $6$-digit numbers that can be formed using the digits $0, 1, 2, 5, 7$ and $9$ which are divisible by $11$ and no digit is repeated is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ordered pairs $(r, k)$ for which $6 \cdot {}^{35}C_r = (k^2 - 3) \cdot {}^{36}C_{r+1}$, where $k$ is an integer is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key D.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
Question 63⭐⭐ Intermediate Fundamental Counting & Words 2020 (08 Jan, Shift 1)+4, 0
An urn contains 5 red marbles, 4 black marbles and 3 white marbles. Then, the number of ways in which 4 marbles can be drawn so that at the most three of them are red is
View Solution & Key Concepts
Official NTA Answer:490
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 490.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
If $a, b$ and $c$ are the greatest values of ${}^{19}C_p, {}^{20}C_q$ and ${}^{21}C_r$ respectively, then :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key C.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
Question 65⭐⭐⭐ Advanced Fundamental Counting & Words 2020 (08 Jan, Shift 2)+4, 0
The number of 4 letter words (with or without meaning) that can be formed from the eleven letters of the word EXAMINATION is
View Solution & Key Concepts
Official NTA Answer:2454
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 2454.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
If the number of five digit numbers with distinct digits and $2$ at the $10^{\text{th}}$ place is $336k$, then $k$ is equal to :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 67⭐⭐ Intermediate Fundamental Counting & Words 2020 (02 Sep, Shift 1)+4, 0
If the letters of the word MOTHER be permuted and all the words so formed (with or without meaning) be listed as in a dictionary, then the position of the word MOTHER
View Solution & Key Concepts
Official NTA Answer:309
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 309.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Letn > 2 be an integer. Suppose that there are n Metro stations in a city located around a circular path. Each pair of the nearest stations is connected by a straight track only. Further, each pair of the nearest station is connected by blue line, whereas all remaining pairs of stations are connected by red line. If number of red lines is 99 times the number of blue lines, then the value of n is
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer A.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The total number of 3—digit numbers whose sum of digits is 10, is .......
View Solution & Key Concepts
Official NTA Answer:54
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 54.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 70⭐⭐⭐ Advanced Fundamental Counting & Words 2020 (04 Sep, Shift 2)+4, 0
A test consists of 6 multiple choice questions, each having 4 alternative answers of which only one is correct. The number of ways, in which a candidate answers all six questions such that exactly four of the answers are correct, is
View Solution & Key Concepts
Official NTA Answer:135
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 135.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 71⭐⭐ Intermediate Fundamental Counting & Words 2020 (05 Sep, Shift 1)+4, 0
The number of words, with or without meaning, that can be formed by taking 4 letters at a time from the letters of the word 'SYLLABUS' such that two letters are distinct and two letters are alike, is
View Solution & Key Concepts
Official NTA Answer:240
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 240.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
There are 3 sections in a question paper and each section contains 5 questions. A candidate has to answer a total of 5 questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is:
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer D.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Two families with three members each and one family with four members are to be seated in a row. In how many ways can they be seated so that the same family members are not separated ?
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer B.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The number of words (with or without meaning) that can be formed from all the letters of the word "LEITER" in which vowels never come together is..
View Solution & Key Concepts
Official NTA Answer:120
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 120.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
A scientific committee is to be formed from 6 Indians and 8 foreigners, which includes at least 2 Indians and double the number of foreigners as Indians. Then the number of ways, the committee can be formed, is:
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The students Sl, S2, • , SIO are to be divided into 3 groups A, B and C such that each group has at least one student and the group C has at most 3 students. Then the total number of possibilities of forming such groups is
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer 31650.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
The total number of numbers, lying between 100 and 1000 that can be formed with the digits 1, 2, 3, 4, 5, if the repetition of digits is not allowed and numbers are divisible by either 3 or 5, is
View Solution & Key Concepts
Official NTA Answer:32
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 32.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The total number of positive integral solutions (c, y, z) such that xyz 24 is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value B.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
The total number of two digit numbers $n$ such that $3^n + 7^n$ is a multiple of $10$, is :
View Solution & Key Concepts
Official NTA Answer:45
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 45.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of seven digit integers with sum of the digits equal to 10 and formed by using the digits 1, 2 and 3 only is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer A.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
A natural number has prime factorization given by $n = 2^x 3^y 5^z$, where $y$ and $z$ are such that $y + z = 5$ and $y^{-1} + z^{-1} = \frac{5}{6}, y > z$. Then the number of odd divisors of $n$, including $1$, is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer A.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The total number of 4-digit numbers whose greatest common divisor with 18 is 3 is
View Solution & Key Concepts
Official NTA Answer:1000
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 1000.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Consider a rectangle ABCD having 5, 6, 7, 9 points in the interior of the line segments AB, BC, CD, DA respectively. Let a be the number of triangles having these points from different sides as vertices and be the number of quadrilaterals having these points from different sides as vertices. Then (P — Q) is equal to
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result D.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
In a chess tournament, $n$ boys and $n$ girls participate. If the total number of games played between two boys exceeds the total number of games played between a boy and a girl by $84$, then $n$ is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
If the sides AB, BC and CA of a triangle ABC have 3, 5 and 6 interior points respectively, then the total number of triangles that can be constructed using these points as vertices, is equal to:
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of times the digit 3 will be written when listing the integers from 1 to 1000 is
View Solution & Key Concepts
Official NTA Answer:300
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 300.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The sum of all the 4-digit distinct numbers that can be formed with the digits 1, 2, 2 and 3 is:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer A.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
There are 15 players in a cricket team, out of which 6 are bowlers, 7 are batsmen and 2 are wicketkeepers. The number of ways, a team of 11 players be selected from them so as to include at least 4 bowlers, 5 batsmen and I wicketkeeper, is
View Solution & Key Concepts
Official NTA Answer:777
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 777.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
If the digits are not allowed to repeat in any number formed by using the digits 0, 2, 4, 6, 8, then the number of all numbers greater than 10, 000 is equal to
View Solution & Key Concepts
Official NTA Answer:96
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 96.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The sum of all the elements in the setn G 1, 2, .. , 100 | H.C.F. of n and 2040 is l} is equal to
View Solution & Key Concepts
Official NTA Answer:1251
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key 1251.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
There are 5 students in class 10, 6 students in class 11 and 8 students in class 12. If the number of ways, in which 10 students can be selected from them so as to include at least 2 students from each class and at most 5 students from the total 11 students of class 10 and 11 is 100k, then k is equal to
View Solution & Key Concepts
Official NTA Answer:238
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 238.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
If ${}^n P_r = {}^n P_{r+1}$ and ${}^n C_r = {}^n C_{r-1}$, then the value of $r$ is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key C.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
Question 93⭐⭐ Intermediate Fundamental Counting & Words 2021 (27 Jul, Shift 2)+4, 0
Let n be a non-negative integer. Then the number of divisors of the form 4n + I of the number (10)10 . (11)11 • (13)13 is equal to
View Solution & Key Concepts
Official NTA Answer:924
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 924.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of three-digit even numbers, formed by the digits O, 1, 3, 4, 6, 7 if the repetition of digits is not allowed, is
View Solution & Key Concepts
Official NTA Answer:52
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 52.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The sum of all 3-digit numbers less than or equal to 500, that are formed without using the digit I and they all are multiple of 11, is
View Solution & Key Concepts
Official NTA Answer:7744
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 7744.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
A number is called a palindrome if it reads the same backward as well as forward. For example 285582 is a six digit palindrome. The number of six digit palindromes, which are divisible by 55, is
View Solution & Key Concepts
Official NTA Answer:100
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 100.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let S = 1, 2, 3, 4, 5, 6, 9. Then the number of elements in the set T = {A C S : $ and the sum of all the elements of A is not a multiple of 3 is
View Solution & Key Concepts
Official NTA Answer:80
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 80.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of six letter words (with or without meaning), formed using all the letters of the word 'VOWELS', so that all the consonants never come together, is
View Solution & Key Concepts
Official NTA Answer:576
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 576.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The number of 4-digit numbers which are neither multiple of 7 nor multiple of 3 is .
View Solution & Key Concepts
Official NTA Answer:5143
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 5143.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
All the arrangements, with or without meaning, of the word FARMER are written excluding any word that has two R appearing together. The arrangements are listed serially in the alphabetic order as in the English dictionary. Then the serial number of the word FARMER in this list is
View Solution & Key Concepts
Official NTA Answer:77
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 77.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Let $P_1, P_2, \dots, P_{15}$ be $15$ points on a circle. The number of distinct triangles formed by points $P_i, P_j, P_k$ such that $i + j + k \ne 15$, is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result D.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 102⭐⭐ Intermediate Fundamental Counting & Words 2022 (24 Jun, Shift 1)+4, 0
In an examination, there are 5 multiple choice questions with 3 choices, out of which exactly one is the question is not attempted. Then, the number of ways a student appearing in the examination gets 5 marks is
View Solution & Key Concepts
Official NTA Answer:40
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 40.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of 7-digit numbers which are multiples of 11 and are formed using all the digits 1, 2, 3, 4, 5, 7 and 9 is
View Solution & Key Concepts
Official NTA Answer:576
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 576.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of 3-digit odd numbers, whose sum of digits is a multiple of 7, is
View Solution & Key Concepts
Official NTA Answer:63
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 63.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The total number of three-digit numbers, with one digit repeated exactly two times, is
View Solution & Key Concepts
Official NTA Answer:243
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 243.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
There are ten boys Bl, B2, ... e, BIO and five girls GI, G2, .G5 in a class. Then the number of ways of forming a group consisting of three boys and three girls, if both 131 and B2 together should not be the members of a group, is
View Solution & Key Concepts
Official NTA Answer:1120
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 1120.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The total number of 3-digit numbers, whose greatest common divisor with 36 is 2, is
View Solution & Key Concepts
Official NTA Answer:150
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 150.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ways, 16 identical cubes, of which 11 are blue and rest are red, can be placed in a row so that between any two red cubes there should be at least 2 blue cubes, is
View Solution & Key Concepts
Official NTA Answer:56
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value 56.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
The total number of 5-digit numbers, formed by using the digits 1, 2, 3, 5, 6, 7 without repetition, which are multiple of 6, is
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer A.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ways of distributing $16$ identical candies among four children $C_1, C_2, C_3, C_4$ such that $C_1$ receives at least $2$ and at most $5$ candies, $C_2$ receives at least $4$ and at most $7$ candies, $C_3$ receives at least $2$ and at most $6$ candies, is equal to :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Question 111⭐⭐ Intermediate Fundamental Counting & Words 2022 (29 Jun, Shift 1)+4, 0
Let blb2b3b4 be a 4-element permutation with bi G {1, 2, 3, . .... .... , 100} for I i 4 and bi bj for i j, such that either bl, b2, b3 are consecutive integers or b2, b3, b4 are consecutive integers. Then the number of such permutations blb2b3b4 is equal to
View Solution & Key Concepts
Official NTA Answer:18915
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 18915.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The total number of four digit numbers such that each of the first three digits is divisible by the last digit, is equal to
View Solution & Key Concepts
Official NTA Answer:1086
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 1086.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 113⭐⭐ Intermediate Fundamental Counting & Words 2022 (25 Jul, Shift 1)+4, 0
The letters of the word 'MANKIND' are written in all possible orders and arranged in serial order as in an English dictionary. Then the serial number of the word 'MANKIND' is
View Solution & Key Concepts
Official NTA Answer:1492
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 1492.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of 5-digit natural numbers, such that the product of their digits is 36, is
View Solution & Key Concepts
Official NTA Answer:180
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 180.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Numbers are to be formed between 1000 and 3000, which are divisible by 4, using the digits 1, 2, 3, 4, 5 and 6 without repetition of digits. Then the total number of such numbers is
View Solution & Key Concepts
Official NTA Answer:30
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 30.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let S be the set of all passwords which are six to eight characters long, where each character is either an alphabet from {A, B, C, D, E} or a number from {1, 2, 3, 4, 5} with the repetition of characters allowed. If the number of passwords in S whose at least one character is a number from {1, 2, 3, 4, 5} isa x 56, then a is equal to
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer 7073.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
A class contains b boys and g girls. If the number of ways of selecting 3 boys and 2 girls from the class is 168, then b + 3g is equal to
View Solution & Key Concepts
Official NTA Answer:17
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 17.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Lets = {4, 6, 9} and T = {9, 10, 11, ... 1000}. If , ak G S} then the sum of all the elements in the set T — A is equal to
View Solution & Key Concepts
Official NTA Answer:11
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key 11.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
The number of natural numbers lying between 1012 and 23421 that can be formed using the digits 2, 3, 4, 5, 6 (repetition of digits is not allowed) and divisible by 55 is
View Solution & Key Concepts
Official NTA Answer:6
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 6.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of 9 digit numbers, that can be formed using all the digits of the number 123412341 so that the even digits occupy only even places, is
View Solution & Key Concepts
Official NTA Answer:60
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 60.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
A boy needs to select five courses from 12 available courses, out of which 5 courses are language courses. If he can choose at most two language courses, then the number of ways he can choose five courses is
View Solution & Key Concepts
Official NTA Answer:546
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 546.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of integers, greater than 7000 that can be formed, using the digits 3, 5, 6, 7, 8 without repetition is
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let S = {1, 2, 3, 5, 7, 10, 11}. The number of non-empty subsets of S that have the sum of all elements a multiple of 3, is
View Solution & Key Concepts
Official NTA Answer:43
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 43.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let and y be distinct integers where 1 25 and 1 y S 25. Then, the number of ways of choosing and y, such that + y is divisible by 5 , is
View Solution & Key Concepts
Official NTA Answer:120
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 120.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of numbers, strictly between $5000$ and $10000$ can be formed using the digits $1, 3, 5, 7, 9$ without repetition, is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let $f(x) = 2x^n + \lambda, \lambda \in \mathbb{R}, n \in \mathbb{N}$, and $f(4) = 133, f(5) = 255$. Then the sum of all the positive integer divisors of $(f(3) - f(2))$ is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Suppose Anil's mother wants to give 5 whole fruits to Anil from a basket of 7 red apples, 5 white apples and 8 oranges. If in the selected 5 fruits, at least 2 orange, at least one red apple and at least one white apple must be given, then the number of ways, Anil's mother can offer 5 fruits to Anil is
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer 6860.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Five digit numbers are formed using the digits 1, 2, 3, 5, 7 with repetitions and are written in descending order with serial numbers. For example, the number 77777 has serial number l. Then the serial number of 35337 is
View Solution & Key Concepts
Official NTA Answer:1436
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 1436.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
If all the six digit numbers $x_1 x_2 x_3 x_4 x_5 x_6$ with $0 < x_1 < x_2 < x_3 < x_4 < x_5 < x_6$ are arranged in the increasing order, then the sum of the digits in the $72^{\text{th}}$ number is :
View Solution & Key Concepts
Official NTA Answer:32
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 32.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 130⭐⭐⭐ Advanced Fundamental Counting & Words 2023 (29 Jan, Shift 2)+4, -1
The letters of the word OUGHT are written in all possible ways and these words are arranged as in a dictionary, in a series. Then the serial number of the word TOUGH is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The total number of 4-digit numbers whose greatest common divisor with 54 is 2 , is
View Solution & Key Concepts
Official NTA Answer:3000
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 3000.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Number of 4-digit numbers (the repetition of digits is allowed) which are made using the digits 1, 2, 3 and 5 , and are divisible by 15 , is equal to
View Solution & Key Concepts
Official NTA Answer:21
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 21.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of seven digits odd numbers, that can be formed using all the seven digits 3,5is
View Solution & Key Concepts
Official NTA Answer:240
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 240.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ways of selecting two numbers $a$ and $b$, $a \in \{2, 4, 6, \dots, 100\}$ and $b \in \{1, 3, 5, \dots, 99\}$ such that $2$ is the remainder when $a + b$ is divided by $23$ is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let 5 digit numbers be constructed using the digits 0, 2, 3, 4, 7, 9 with repetition allowed, and are arranged in ascending order with serial numbers. Then the serial number of the number 42923 is
View Solution & Key Concepts
Official NTA Answer:2997
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 2997.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 136⭐⭐ Intermediate Fundamental Counting & Words 2023 (31 Jan, Shift 2)+4, 0
If Pn - 12n+ 1 : Pn2n - 1 = 11 : 21, then n2 + n + 15 is equal to :
View Solution & Key Concepts
Official NTA Answer:45
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 45.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of words, with or without meaning, that can be formed using all the letters of the word ASSASSINATION so that the vowels occur together, is
View Solution & Key Concepts
Official NTA Answer:50400
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 50400.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The total number of six digit numbers, formed using the digits 4, 5, 9 only and divisible by 6, is
View Solution & Key Concepts
Official NTA Answer:81
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 81.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Number of integral solutions to the equation + y + z = 21, where 2 1, y 2 3, z 2 4, is equal to
View Solution & Key Concepts
Official NTA Answer:105
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value 105.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer 171.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Let $A = \{1, 2, 3, 4, 5, 6, 7\}$. If $p$ is the number of relations from $A$ to $A$ which are reflexive and symmetric, and $q$ is the number of relations from $A$ to $A$ which are symmetric, then $\log_2(q/p)$ is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
The coefficient of $x^k$ in $(1 + x + x^2 + \dots)^n$ or multinomial expansion $\frac{n!}{p! q! r! \dots}$. Properties of binomial coefficients: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$.
⚡ JEE Exam Shortcut / Strategic Insight
Use Pascal's Identity iteratively: ${}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r$ to collapse telescoping binomial sums.
Step-by-Step Derivation:
Express the algebraic or combinatorial condition in terms of factorial or binomial expansions.
Apply standard combinatorial identities or generating functions to simplify the expression.
Solve the resulting polynomial or linear relation for the unknown parameter.
Verifying the roots confirms the official key D.
Exam Takeaway & Common Pitfall:In multinomial expansions or repeated partitions, divide by $k!$ whenever $k$ boxes or groups are identical/unlabeled to avoid overcounting.
Question 142⭐⭐ Intermediate Fundamental Counting & Words 2023 (06 Apr, Shift 2)+4, -1
All the letters of the word PUBLIC are written in all possible orders and these words are written as in a dictionary with serial numbers. Then the serial number of the word PUBLIC is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 143⭐⭐ Intermediate Fundamental Counting & Words 2023 (06 Apr, Shift 2)+4, 0
The number of 4-letter words, with or without meaning, each consisting of 2 vowels and 2 consonants, which can be formed from the letters of the word UNIVERSE without repetition is
View Solution & Key Concepts
Official NTA Answer:432
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 432.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 144⭐⭐ Intermediate Fundamental Counting & Words 2023 (08 Apr, Shift 1)+4, -1
All the letters of the word PUBLIC are written in all possible orders and these words are written as in a dictionary with serial numbers. Then the serial number of the word PUBLIC is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of ways, in which $5$ girls and $7$ boys can be seated at a round table so that no two girls sit together is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer B.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 146⭐⭐ Intermediate Fundamental Counting & Words 2023 (08 Apr, Shift 1)+4, 0
The largest natural number n such that 3n divides 66! is
View Solution & Key Concepts
Official NTA Answer:31
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 31.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 147⭐⭐ Intermediate Fundamental Counting & Words 2023 (08 Apr, Shift 2)+4, -1
If the number of words, with or without meaning, which can be made using all the letters of the word MATHEMATICS in which $C$ and $S$ do not come together, is $(6!)k$ then $k$ is equal to :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result B.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Some couples participated in a mixed doubles badminton tournament. If the number of matches played, so that no couple played in a match, is 840, then the total numbers of persons, who participated in the tournament, is
View Solution & Key Concepts
Official NTA Answer:16
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 16.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of permutations, of the digits 1, 2, 3, ... , 7 without repetition, which neither contain the string 153 nor the string 2467, is
View Solution & Key Concepts
Official NTA Answer:4898
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 4898.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 150⭐⭐⭐ Advanced Fundamental Counting & Words 2023 (10 Apr, Shift 2)+4, -1
Eight persons are to be transported from city A to city B in three cars of different makes. If each car can accommodate at most three persons, then the number of ways, in which they can be transported, is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The sum of all the four-digit numbers that can be formed using all the digits 2, 1, 2, 3 is equal to
View Solution & Key Concepts
Official NTA Answer:26664
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 26664.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Some couples participated in a mixed doubles badminton tournament. If the number of matches played, so that no couple played in a match, is $840$, then the total numbers of persons, who participated in the tournament, is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
In an examination, 5 students have been allotted their seats as per their roll numbers. The number of ways, in which none of the students sits on the allotted seat, is
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer 44.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Question 154⭐⭐ Intermediate Fundamental Counting & Words 2023 (11 Apr, Shift 2)+4, -1
If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial numbers, then the serial number of the word THAMS is
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Let the digits a, b, c be in A.P. Nine-digit numbers are to be formed using each of these three digits thrice such that three consecutive digits are in A.P. at least once. How many such numbers can be formed?
View Solution & Key Concepts
Official NTA Answer:1260
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 1260.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of five-digit numbers, greater than 40000 and divisible by 5, which can be formed using the digits 0, 1, 3, 5, 7 and 9 without repetition, is equal to
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of seven digit positive integers formed using the digits l, 2, 3 and 4 only and sum of the digits equal to 12 is
View Solution & Key Concepts
Official NTA Answer:413
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 413.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Total numbers of 3-digit numbers that are divisible by 6 and can be formed by using the digits 1, 2, 3, 4, 5 with repetition, is
View Solution & Key Concepts
Official NTA Answer:16
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 16.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 159⭐⭐ Intermediate Fundamental Counting & Words 2023 (13 Apr. Shift 2)+4, -1
All words, with or without meaning, are made using all the letters of the word MONDAY. These words are written as in a dictionary with serial numbers. The serial number of the word MONDAY is
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
A person forgets his 4-digit ATM pin code. But he remembers that in the code all the digits are different, the greatest digit is 7 and the sum of the first two digits is equal to the sum of the last two digits. Then the maximum number of trials necessary to obtain the correct code is
View Solution & Key Concepts
Official NTA Answer:72
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 72.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The total number of three-digit numbers, divisible by 3, which can be formed using the digits 1, 3, 5, 8 , if repetition of digits is allowed, is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let $\alpha$ be the number of ways $5$ boys and $5$ girls can be seated in a row such that all boys are together and all girls are together. Let $\beta$ be the number of ways they can be seated such that no two boys are together. Then :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer C.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 163⭐⭐ Intermediate Fundamental Counting & Words 2024 (29 Jan, Shift 1)+4, 0
All the letters of the word GTVVENTY are written in all possible ways with or without meaning and these words are written as in a dictionary. The serial number of the word GTVVENTY IS
View Solution & Key Concepts
Official NTA Answer:553
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 553.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Number of ways of arranging 8 identical books into 4 identical shelves where any number of shelves may remain empty is equal to
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
In an examination of Mathematics paper, there are 20 questions of equal marks and the question paper is divided into three sections : A, B and C. A student is required to attempt total 15 questions taking at least 4 questions from each section. If section A has 8 questions, section B has 6 questions and section C has 6 questions, then the total number of ways a student can select 15 questions is
View Solution & Key Concepts
Official NTA Answer:11376
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 11376.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The total number of words (with or without meaning) that can be formed out of the letters of the word "DISTRIBUTION" taken four at a time, is equal to
View Solution & Key Concepts
Official NTA Answer:3734
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value 3734.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
The number of ways in which 21 identical apples can be distributed among three children such that each child gets at least 2 apples, is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
If $n$ is the number of ways five different employees can sit into four indistinguishable offices where any office may have any number of persons including zero, then $n$ is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value C.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
The lines LI, L2, L20 are distinct. For n 1, 2, 3, 10 all the lines L2n_1 are parallel to each other and all the lines 122n pass through a given point P. The maximum number of points of intersection of pairs of lines from the set {LI, L2, 20} is equal to:
View Solution & Key Concepts
Official NTA Answer:101
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 101.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
There are $5$ points $P_1, P_2, P_3, P_4, P_5$ on the side $AB$, excluding $A$ and $B$, of a triangle $ABC$. Similarly there are $6$ points $P_6, P_7, \dots, P_{11}$ on the side $BC$ and $7$ points $P_{12}, P_{13}, \dots, P_{18}$ on the side $CA$ of the triangle. The number of triangles, that can be formed using the points $P_1, P_2, \dots, P_{18}$ as vertices, is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result C.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
There are 4 men and 5 women in Group A, and 5 men and 4 women in Group B. If 4 persons are selected from each group, then the number of ways of selecting 4 men and 4 women is
View Solution & Key Concepts
Official NTA Answer:5626
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 5626.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 172⭐⭐ Intermediate Fundamental Counting & Words 2024 (05 Apr. Shift 1)+4, 0
The number of ways of getting a sum 16 on throwing a dice four times is
View Solution & Key Concepts
Official NTA Answer:125
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 125.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 173⭐⭐ Intermediate Fundamental Counting & Words 2024 (05 Apr, Shift 2)+4, -1
60 words can be made using all the letters of the word BHBJO, with or without meaning. If these words are written as in a dictionary, then the 50th word is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result B.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer D.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
Question 175⭐⭐ Intermediate Fundamental Counting & Words 2024 (06 Apr, Shift 2)+4, -1
n. : . n lcr-l 55 : 35 : 21, then 2n+ is equal to:
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 176⭐⭐ Intermediate Fundamental Counting & Words 2024 (06 Apr, Shift 2)+4, -1
If all the words with or without meaning made using all the letters of the word "NAGPUR" are arranged as in a dictionary, then the word at 315th position in this arrangement is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of 3-digit numbers, formed using the digits 2, 3, 4, 5 and 7 , when the repetition of digits is not allowed, and which are not divisible by 3 , is equal to
View Solution & Key Concepts
Official NTA Answer:36
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 36.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 178⭐⭐ Intermediate Fundamental Counting & Words 2024 (08 Apr, Shift 2)+4, -1
The number of ways five alphabets can be chosen from the alphabets of the word MATHEMATICS, where the chosen alphabets are not necessarily distinct, is equal to :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of integers, between 100 and 1000 having the sum of their digits equals to 14 , is
View Solution & Key Concepts
Official NTA Answer:70
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 70.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 180⭐⭐⭐ Advanced Fundamental Counting & Words 2025 (22 Jan, Shift 1)+4, -1
From all the English alphabets, five letters are chosen and are arranged in alphabetical order. The total number of ways, in which the middle letter is ' M is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result A.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
In a group of 3 girls and 4 boys, there are two boys Bl and B2. The number of ways, in which these girls and boys can stand in a queue such that all the girls stand together, all the boys stand together, but Bl and B2 are not adjacent to each other, is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer B.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
The lines $L_1, L_2, \dots, L_{20}$ are distinct. For $n = 1, 2, 3, \dots, 10$ all the lines $L_{2n-1}$ are parallel to each other and all the lines $L_{2n}$ pass through a given point $P$. The maximum number of points of intersection of pairs of these lines is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result A.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
The number of ways, 5 boys and 4 girls can sit in a row so that either all the boys sit together or no two boys sit together, is
View Solution & Key Concepts
Official NTA Answer:17280
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer 17280.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 184⭐⭐ Intermediate Fundamental Counting & Words 2025 (24 Jan, Shift 2)+4, -1
Group A consists of 7 boys and 3 girls, while group B consists of 6 boys and 5 girls. The number of ways, 4 boys and 4 girls can be invited for a picnic if 5 of them must be from group A and the remaining 3 from group B, is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of different 5 digit numbers greater than 50000 that can be formed using the digits 0 , 1, 2, 3, 4, 5, 6, 7, such that the sum of their first and last digits should not be more than 8 , is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of natural numbers, between 212 and 999 , such that the sum of their digits is 15 , is
View Solution & Key Concepts
Official NTA Answer:64
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 64.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 187⭐⭐ Intermediate Fundamental Counting & Words 2025 (29 Jan, Shift 1)+4, 0
The number of 6-letter words, with or without meaning, that can be formed using the letters of the word MATHS such that any letter that appears in the word must appear at least twice, is
View Solution & Key Concepts
Official NTA Answer:1405
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 1405.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Let P be the set of seven digit numbers with sum of their digits equal to 11 . If the numbers in P are formed by using the digits 1,2 and 3 only, then the number of elements in the set P is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer D.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 189⭐⭐⭐ Advanced Fundamental Counting & Words 2025 (29 Jan, Shift 2)+4, -1
If all the words with or without meaning made using all the letters of the word "KANPUR" are arranged as in a dictionary, then the word at 440th position in this arrangement, is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 190⭐⭐ Intermediate Fundamental Counting & Words 2025 (02 Apr. Shift 1)+4, -1
The number of sequences of ten terms, whose terms are either O or I or 2 , that contain exactly five I s and exactly three 2 s , is equal to
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The largest $n \in \mathbb{N}$ such that $3^n$ divides $50!$ is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer B.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The number of ways, in which the letters A, B, C, D, E can be placed in the 8 boxes of the figure below so that no row remains empty and at most one letter can be placed in a box, is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value D.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
If the number of seven-digit numbers, such that the sum of their digits is even, is m • n • 1011; m,ne 9}, then m + n is equal to
View Solution & Key Concepts
Official NTA Answer:14
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 14.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Line $L_1$ of slope $2$ and line $L_2$ of slope $\frac{1}{2}$ intersect at the origin $O$. In the first quadrant, $P_1, P_2, \dots, P_{12}$ are $12$ points on line $L_1$ and $Q_1, Q_2, \dots, Q_8$ are $8$ points on line $L_2$. The number of triangles that can be formed using $O$ and these $20$ points as vertices is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Let $m$ and $n$ ($m < n$) be two $2$-digit numbers. Then the total numbers of pairs $(m, n)$, such that $\gcd(m, n) = 6$, is :
View Solution & Key Concepts
Official NTA Answer:64
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 64.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
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
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result B.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 197⭐⭐ Intermediate Fundamental Counting & Words 2025 (07 Apr, Shift 1)+4, 0
For $n \ge 2$, let $S_n$ denote the set of all subsets of $\{1, 2, \dots, n\}$ with no two consecutive numbers. For example $\{1, 3, 5\} \in S_6$, but $\{1, 2, 4\} \notin S_6$. Then $n(S_5)$ is equal to :
View Solution & Key Concepts
Official NTA Answer:13
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 13.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Let $p$ be the number of all triangles that can be formed by joining the vertices of a regular polygon $P$ of $n$ sides and $q$ be the number of all quadrilaterals that can be formed by joining the vertices of $P$. If $p + q = 126$, then the eccentricity of the ellipse $\frac{x^2}{16} + \frac{y^2}{n} = 1$ is :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result D.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
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
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result D.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 200⭐⭐ Intermediate Fundamental Counting & Words 2026 (21 Jan, Shift 1)+4, -1
The number of strictly increasing functions $f$ from the set $\{1, 2, 3, 4, 5, 6\}$ to the set $\{1, 2, 3, \dots, 9\}$ such that $f(i) \ne i$ for $1 \le i \le 6$, is equal to :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Let $S = \{(m, n) : m, n \in \{1, 2, 3, \dots, 50\}\}$. If the number of elements $(m, n)$ in $S$ such that $6^m + 9^n$ is a multiple of $5$ is $p$ and the number of elements $(m, n)$ in $S$ such that $m + n$ is a square of a prime number is $q$, then $p + q$ is equal to :
View Solution & Key Concepts
Official NTA Answer:1333
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 1333.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
The largest $n \in \mathbb{N}$, for which $7^n$ divides $101!$, is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer A.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Let $ABC$ be a triangle. Consider four points $p_1, p_2, p_3, p_4$ on the side $AB$, five points $p_5, p_6, p_7, p_8, p_9$ on the side $BC$, and four points $p_{10}, p_{11}, p_{12}, 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_1, p_2, \dots, p_{13}$, is :
View Solution & Key Concepts
Official NTA Answer:660
Core Theorem / Concept Used
Number of selections of $r$ objects from $n$ distinct objects is ${}^nC_r = \frac{n!}{r!(n-r)!}$. Number of triangles from $n$ points with $m$ collinear points is ${}^nC_3 - {}^mC_3$.
⚡ JEE Exam Shortcut / Strategic Insight
Subtract invalid degenerate configurations (collinear selections) from the unconstrained total selections ${}^nC_r$.
Step-by-Step Derivation:
Establish the total number of geometric entities (points, lines, vertices) available.
Compute unconstrained combinations required to form the required figure (e.g. 3 points for a triangle, 4 for a quadrilateral).
Deduct collinear or non-qualifying combinations based on the geometric collinearity constraints.
Simplifying the combinatorial expression confirms the official result 660.
Exam Takeaway & Common Pitfall:Always check if collinear points can form non-degenerate figures: 3 collinear points cannot form a triangle, and 4 points cannot form a quadrilateral if 3 of them are collinear.
Question 204⭐⭐⭐ Advanced Fundamental Counting & Words 2026 (23 Jan, Shift 1)+4, 0
The number of $4$-letter words, with or without meaning, which can be formed using the letters $PQRPQRSTUVP$, is :
View Solution & Key Concepts
Official NTA Answer:1422
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 1422.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 205⭐⭐ Intermediate Fundamental Counting & Words 2026 (23 Jan, Shift 2)+4, 0
Let $S$ denote the set of $4$-digit numbers $abcd$ such that $a > b > c > d$ and $P$ denote the set of $5$-digit numbers having product of its digits equal to $20$. Then $n(S) + n(P)$ is equal to :
View Solution & Key Concepts
Official NTA Answer:260
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 260.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Define the sets of forbidden events and formulate the problem via the Principle of Inclusion-Exclusion.
Calculate the intersection sizes for single sets, pairwise sets, and higher-order overlaps.
Apply the alternating sum formula to isolate the valid constrained configurations.
Evaluating the resulting sum matches official answer A.
Exam Takeaway & Common Pitfall:Watch out for alternating signs: $N(A \cup B \cup C) = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|$. For derangements, remember $D_n$ is nearest integer to $n!/e$.
The number of numbers greater than $5000$, less than $9000$ and divisible by $3$, that can be formed using the digits $0, 1, 2, 5, 9$, if the repetition of the digits is allowed, is :
View Solution & Key Concepts
Official NTA Answer:42
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer 42.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 208⭐⭐ Intermediate Fundamental Counting & Words 2026 (24 Jan, Shift 2)+4, -1
The letters of the word "UDAYPUR" are written in all possible ways with or without meaning and these words are arranged as in a dictionary. The rank of the word "UDAYPUR" is
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 209⭐⭐ Intermediate Fundamental Counting & Words 2026 (24 Jan, Shift 2)+4, -1
The largest value of n, for which divides 60!, is
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 210⭐⭐⭐ Advanced Fundamental Counting & Words 2026 (28 Jan, Shift 1)+4, -1
Let $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}$. Let $x$ be the number of $9$-digit numbers formed using the digits of the set $S$ such that only one digit is repeated and it is repeated exactly twice. Let $y$ be the number of $9$-digit numbers formed using the digits of the set $S$ such that only two digits are repeated and each of these is repeated exactly twice. Then :
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 211⭐⭐ Intermediate Fundamental Counting & Words 2026 (28 Jan, Shift 2)+4, 0
Three persons enter in a lift at the ground floor. The lift will go upto 10th floor. The number of ways, in which the three persons can exit the lift at three different floors, if the lift does not stop at first, second and third floors, is equal to
View Solution & Key Concepts
Official NTA Answer:210
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 210.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of seven-digit numbers, that can be formed by using the digits 1, 2, 3, 5 and 7 such that each digit is used at least once, is :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Divisibility rules: For $3$ or $9$, the sum of digits must be divisible by $3$ or $9$. For $11$, difference between sum of odd-place digits and even-place digits must be a multiple of $11$. For $4$ or $25$, test last two digits.
⚡ JEE Exam Shortcut / Strategic Insight
Partition available digits modulo the divisor (e.g. mod 3: $\{0, 3\}, \{1, 4\}, \{2, 5\}$) to quickly group valid digit sets without enumerating all permutations.
Step-by-Step Derivation:
Identify the divisibility constraint and the set of available digits, noting whether repetition is permitted.
Group the digits by their remainder modulo the divisor to find all permissible subset combinations.
Account for place-value constraints (e.g., the leading digit cannot be zero).
Apply the multiplication rule to arrange digits across valid positional slots, matching official answer C.
Exam Takeaway & Common Pitfall:Never forget to exclude numbers with leading digit zero when counting multi-digit integers. Double-check whether the problem specifies 'between A and B' (strict inequality) or 'from A to B' (inclusive).
Question 213⭐⭐⭐ Advanced Fundamental Counting & Words 2026 (02 Apr, Shift 2)+4, -1
Three persons enter in a lift at the ground floor. The lift will go upto $10^{\text{th}}$ floor. The number of ways, in which the three persons can exit the lift at three different floors, if the lift does not stop at first, second and third floors, is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
The number of ways of forming a queue of 4 boys and 3 girls such that all the girls are not together, is:
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Circular permutation of $n$ distinct objects is $(n-1)!$. String/Block method: treat elements that must be together as a single block. Gap method: arrange unconstrained items first, then insert constrained items into available gaps.
⚡ JEE Exam Shortcut / Strategic Insight
Always apply the Gap Method when no two specified items can be adjacent; apply the Block Method when specified items must remain together.
Step-by-Step Derivation:
Identify whether the arrangement is circular (rotational symmetry $\implies (n-1)!$) or linear ($n!$).
Seat the unconstrained elements to establish fixed reference positions and generate insertion gaps.
Calculate the number of ways to arrange the restricted elements into these distinct gaps.
Multiplying the independent seating stages gives the total ways, matching official answer D.
Exam Takeaway & Common Pitfall:For circular permutations with no distinction between clockwise and anticlockwise (such as necklaces or garlands), divide by 2: $(n-1)! / 2$.
Question 215⭐⭐ Intermediate Fundamental Counting & Words 2026 (04 Apr, Shift 2)+4, -1
Let A = b,c) .
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 216⭐⭐⭐ Advanced Fundamental Counting & Words 2026 (OS Apr, Shift 1)+4, 0
Two players A and B play a series of games of badminton. The player, who wins 5 games first, wins the series. Assuming that no game ends in a draw, the number of ways, in which player A wins the series is
View Solution & Key Concepts
Official NTA Answer:126
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result 126.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
A box contains 5 blue, 6 yellow and 4 red balls. The number of ways, of drawing 8 balls containing at least two balls of each colour, is :
View Solution & Key Concepts
Official NTA Answer:A
Core Theorem / Concept Used
Number of non-negative integer solutions to $x_1 + x_2 + \dots + x_r = n$ is ${}^{n+r-1}C_{r-1}$. For positive integer solutions ($x_i \ge 1$), the number of ways is ${}^{n-1}C_{r-1}$ (Stars and Bars).
⚡ JEE Exam Shortcut / Strategic Insight
Substitute $x_i = y_i + k_i$ to reduce lower-bound constraints ($x_i \ge k_i$) to standard non-negative integer solutions ${}^{N+r-1}C_{r-1}$.
Step-by-Step Derivation:
Translate the problem into an equivalent Diophantine equation of the form $x_1 + x_2 + \dots + x_k = N$.
Apply variable shifts for minimum requirements (e.g. $y_i = x_i - ext{min}$ so that $y_i \ge 0$).
Use the Stars and Bars theorem: total non-negative solutions = \binom{N'+k-1}{k-1}.
Evaluating the binomial coefficient directly produces official value A.
Exam Takeaway & Common Pitfall:Be careful between indistinguishable vs distinguishable objects. For identical objects into distinct boxes use Stars and Bars $\binom{n+r-1}{r-1}$; for distinct objects into distinct boxes use $n^r$.
Question 218⭐⭐ Intermediate Fundamental Counting & Words 2026 (06 Apr, Shift 1)+4, -1
The number of 4-letter words, with or without meaning, each consisting of two vowels and two consonants that can be formed from the letters of the word INCONSEQUENTIAL, without repeating any letter, is:
View Solution & Key Concepts
Official NTA Answer:D
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result D.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 219⭐⭐⭐ Advanced Fundamental Counting & Words 2026 (06 Apr, Shift 2)+4, -1
A building has ground floor and $10$ more floors. Nine persons enter in a lift at the ground floor. The lift goes up to the $10^{\text{th}}$ floor. The number of ways, in which any $4$ persons exit at a floor and the remaining $5$ persons exit at a different floor, if the lift does not stop at the first and the second floors, is equal to :
View Solution & Key Concepts
Official NTA Answer:C
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result C.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).
Question 220⭐⭐ Intermediate Fundamental Counting & Words 2026 (08 Apr, Shift 2)+4, -1
A person has three different bags and four different books. The number of ways, in which he can put these books in the bags so that no bag is empty, is :
View Solution & Key Concepts
Official NTA Answer:B
Core Theorem / Concept Used
Fundamental Principle of Counting: Multiplication rule for sequential independent stages; Addition rule for mutually exclusive cases. Permutations of $n$ items with repetitions: $\frac{n!}{p! q! r!}$.
⚡ JEE Exam Shortcut / Strategic Insight
Rank of a word: Fix alphabetically preceding letters in the first position, multiply by remaining permutations, and repeat for subsequent positions.
Step-by-Step Derivation:
Determine the positional constraints and whether repetitions of elements are allowed.
Calculate the number of independent choices for each successive slot from most constrained to least constrained.
Account for symmetry and overcounting by dividing by identical letter factorials where applicable.
Summing across all valid disjoint cases produces official result B.
Exam Takeaway & Common Pitfall:When words have repeated identical letters, always divide by the product of factorials of their frequencies (e.g. MISSISSIPPI: $11! / (4! 4! 2!)$).