Permutations Of Digits
The number of distinct four-digit numbers greater than 3000 that can be formed using the digits 1, 2, 3, 4, 5 without repetition of any digit equals which value?
Select the correct option:
🔒 Solution Hidden from View
Submit your answer to unlock the detailed step-by-step solution.
More permutations and combinations Practice Questions
Using the standard combinatorial identity, the value of the sum C(8,0) + C(8,1) + C(8,2) + ... + C(8...
Using the standard combinatorial identity, the value of the sum C(8,0) + C(8,1) + C(8,2) + ... + C(8...
If all the distinct arrangements of the letters of the word RANK are listed in dictionary order, the...
If all the distinct arrangements of the letters of the word RANK are listed in dictionary order, the...
At a party every pair of guests shakes hands exactly once, and the total number of handshakes record...
At a party every pair of guests shakes hands exactly once, and the total number of handshakes record...
The number of ways to arrange 5 boys and 3 girls in a row so that all 3 girls always stand together ...
The number of ways to arrange 5 boys and 3 girls in a row so that all 3 girls always stand together ...
If the combinatorial equation C(n, 2) equals 28 holds for a positive integer n, then the value of n ...
If the combinatorial equation C(n, 2) equals 28 holds for a positive integer n, then the value of n ...
The number of ways to place 5 distinct letters into 3 distinct mailboxes, where any mailbox may rece...
The number of ways to place 5 distinct letters into 3 distinct mailboxes, where any mailbox may rece...
From 20 points placed on a straight line, the number of line segments that can be formed by joining ...
From 20 points placed on a straight line, the number of line segments that can be formed by joining ...
The number of ways to arrange 4 boys and 4 girls in a row so that no two girls are adjacent to each ...
The number of ways to arrange 4 boys and 4 girls in a row so that no two girls are adjacent to each ...
Given 10 points in a plane of which no three are collinear, the number of distinct triangles that ca...
Given 10 points in a plane of which no three are collinear, the number of distinct triangles that ca...
Using all five digits 1, 2, 3, 4 and 5 exactly once to form five-digit numbers, the sum of all such ...
Using all five digits 1, 2, 3, 4 and 5 exactly once to form five-digit numbers, the sum of all such ...
A student must travel from city A to city C passing through city B, with 4 roads from A to B and 5 r...
A student must travel from city A to city C passing through city B, with 4 roads from A to B and 5 r...
The number of ways to arrange the letters of the word MONDAY so that all the vowels occupy only the ...
The number of ways to arrange the letters of the word MONDAY so that all the vowels occupy only the ...
About This Question
- Subject
- mathematics
- Chapter
- permutations and combinations
- Topic
- permutations of digits
- Difficulty
- Medium
- Year
- 2025
Solution
Correct Answer:
72
Forming numbers with a size restriction is handled by constraining the leading digit first, then arranging the rest, a frequent JEE Advanced pattern. A four-digit number using the distinct digits 1, 2, 3, 4, 5 without repetition must exceed 3000, so its thousands digit must be at least 3, giving 3 choices: 3, 4, or 5. After fixing the leading digit, the remaining three places are filled by any 3 of the remaining 4 digits in P(4,3) = 4·3·2 = 24 ways. By the multiplication principle, the total is 3 × 24 = 72. Option 120 = 5·4·3·2 ignores the size restriction. Option 60 uses an incorrect leading-digit count. Option 96 overcounts the leading choices. Hence there are 72 such numbers. Plausibility check: the unrestricted count of four-digit numbers from these digits is P(5,4) = 120, and exactly three of the five possible leading digits qualify, so the restricted count is (3/5)·120 = 72, consistent with the leading-digit argument. Magnitude conditions on formed numbers are managed by first fixing the most significant digit to satisfy the size constraint, then freely arranging the remaining digits. This leading-digit-first strategy generalizes to divisibility and range problems, where the controlling position is identified and constrained before the multiplication principle is applied to the comparatively free remaining places.
This medium difficulty mathematics question is from the chapter permutations and combinations, covering the topic of permutations of digits. It appeared in the 2025 exam.
Looking for more practice? Explore all mathematics questions or browse permutations and combinations questions on RankGuru.