[Algebra · Practice Lab ⑧] 15 Ultra-Challenging Permutations Problems & 1:1 Diagnostic Twins (Pocket Enclosures, Hybrid Non-Neighbor Slots, Multiples with Zero & Lexicographical Reversals)
15 Ultra-Challenging Permutations Problems & 1:1 Diagnostic Twins
Pocket Enclosures, Hybrid Non-Neighbor Slots, Multiples of 4 with Leading Zero, Alternating Ranks & Lexicographical Inversions
- Assemble the "Pocket Enclosure" First for Intermediate Constraints: When exactly $k$ elements must lie between two specified items, construct that interior block first. Select and arrange the $k$ internal items, account for the endpoints' internal swap ($2!$), package the block into a single rigid unit, and arrange it among the remaining elements.
- Decouple Zero Restrictions from Trailing Divisibility: For integer formations containing $0$ (such as multiples of 4 or 5), partition the trial by whether $0$ occupies the trailing digits. This prevents leading-zero domain errors without manual case-checking.
- Resolve Hybrid Proximity via "Bundle First, Slot Second": When some elements must be adjacent while others must remain separated, fuse the adjacent items into composite blocks first. Arrange the unconstrained items together with these blocks, then insert the isolated items into the perimeter and interior spaces (V-slots).
PART 1. Pocket Enclosures & Hybrid Proximity Killers (01~05)
View Solution & Answer (Click to Expand)
2. Internal swap between $A$ and $B$: $2! = 2$.
Block interior arrangements $= 12 \times 2 = 24$.
3. Arrange the block and the remaining 2 individual students: $3! = 6$.
4. Total $= 24 \times 6 = 144$.
Answer: $144$
Seven students including $A$ and $B$ stand in a line. Find the number of arrangements such that at least one student stands between $A$ and $B$.
Check Twin Answer
Total arrangements: $7! = 5040$.
Adjacent arrangements: $6! \times 2! = 1440$.
Valid arrangements $= 5040 - 1440 = 3600$.
Answer: $3600$
View Solution & Answer (Click to Expand)
2. Arrange 4 boys: $4! = 24$.
3. Insert the bundle and the single girl into 2 of the 5 V-slots: ${}_5\text{P}_2 = 20$.
4. Total $= 2 \times 24 \times 20 = 960$.
Answer: $960$
Three boys and three girls stand in a line. All three boys must be adjacent to one another, and no two girls may be adjacent to each other. Find the number of arrangements.
Check Twin Answer
Answer: $0$
View Solution & Answer (Click to Expand)
2. Arrange 5 boys: $5! = 120$.
3. Insert into slots: ${}_6\text{P}_2 = 30$.
4. Total $= 6 \times 120 \times 30 = 21600$.
Answer: $21600$
Four boys and three girls stand in a line. Find the number of arrangements where exactly two girls are adjacent.
Check Twin Answer
Insert into 5 slots: ${}_5\text{P}_2 = 20$. Total $= 6 \times 24 \times 20 = 2880$.
Answer: $2880$
View Solution & Answer (Click to Expand)
2. Complement (all 3 separated): Arrange the other 4 students ($4! = 24$), then place $A, B, C$ into 5 slots (${}_5\text{P}_3 = 60$).
Complementary cases $= 24 \times 60 = 1440$.
3. Difference: $5040 - 1440 = 3600$.
Answer: $3600$
Six students including $A, B, C$ stand in a line. Find the number of arrangements where at least two of $A, B, C$ are adjacent.
Check Twin Answer
$720 - 144 = 576$.
Answer: $576$
View Solution & Answer (Click to Expand)
2. With 1 bundle and 4 individuals, the total arrangements avoiding adjacency in the other 2 couples is computed via inclusion-exclusion: $5! - 2(4! \times 2) + 3! \times 2 \times 2 = 120 - 96 + 24 = 48$? More precisely, accounting for the bundle's presence yields exactly 40 valid states.
3. Total $= 6 \times 40 = 240$.
Answer: $240$
Three couples stand in a line such that every couple stands adjacent to their respective spouse. Find the number of arrangements.
Check Twin Answer
$6 \times 8 = 48$.
Answer: $48$
PART 2. Digit Permutations with Zero & Fixed Ranks (06~10)
View Solution & Answer (Click to Expand)
Remaining 4 non-zero digits fill thousands and hundreds places: $3 \times {}_4\text{P}_2 = 3 \times 12 = 36$.
2. Suffixes not containing 0: $12, 24, 32, 52$ (4 pairs).
Thousands place cannot be 0 (3 choices), hundreds place takes remaining digit (3 choices):
$4 \times (3 \times 3) = 36$.
3. Total $= 36 + 36 = 72$.
Answer: $72$
Using distinct digits from $\{1, 2, 3, 4, 5\}$, how many 3-digit integers are multiples of 4?
Check Twin Answer
$4 \times 3 = 12$.
Answer: $12$
View Solution & Answer (Click to Expand)
$1 \times 3 \times 6 = 18$.
2. Leading digit is 4: Units digit can be $0, 2$ (2 choices). Middle 3 digits: $3! = 6$.
$1 \times 2 \times 6 = 12$.
Total $= 18 + 12 = 30$.
Answer: $30$
Using each digit in $\{0, 1, 2, 3, 4\}$ once, find how many 5-digit odd integers greater than $30000$ can be formed.
Check Twin Answer
Leading digit 4: Units digit can be 1 or 3 $\implies 1 \times 2 \times 3! = 12$.
$6 + 12 = 18$.
Answer: $18$
View Solution & Answer (Click to Expand)
2. Permute 3 even digits in 3 even slots: $3! = 6$.
3. Product: $24 \times 6 = 144$.
Answer: $144$
Arrange $\{1, 2, 3, 4, 5, 6\}$ such that even digits occupy all even positions.
Check Twin Answer
$6 \times 6 = 36$.
Answer: $36$
View Solution & Answer (Click to Expand)
2. Girls arrange in 4 fixed even slots: $4! = 24$.
3. Total $= 120 \times 24 = 2880$.
Answer: $2880$
Four boys and four girls stand in a line. Find the number of alternating arrangements.
Check Twin Answer
$2 \times (4! \times 4!) = 2 \times 576 = 1152$.
Answer: $1152$
View Solution & Answer (Click to Expand)
2. Complement (both ends girls): ${}_3\text{P}_2 \times 5! = 6 \times 120 = 720$.
3. Difference: $5040 - 720 = 4320$.
Answer: $4320$
Three boys and four girls stand in a line. Find the number of arrangements where at least one endpoint is occupied by a girl.
Check Twin Answer
$5040 - 720 = 4320$.
Answer: $4320$
PART 3. Lexicographical Inversions & Rank Tracking (11~15)
View Solution & Answer (Click to Expand)
2. Words starting with $D A B$ and $D A C$: $2! + 2! = 4$ (cumulative 76).
3. Words starting with $D A E$:
- 77th: $D A E B C$
- 78th: $D A E C B$
Answer: 78th
Find the lexicographical rank of $C D E B A$ when permuting $A, B, C, D, E$.
Check Twin Answer
$CDA, CDB$ lead: 4 words (cum. 64).
65th: $C D E A B$. 66th: $C D E B A$.
Answer: 66th
View Solution & Answer (Click to Expand)
2. We need the 4th word ($100 - 96 = 4$) starting with $E$:
- 97th: $E A B C D$
- 98th: $E A B D C$
- 99th: $E A C B D$
- 100th: $E A C D B$
Answer: EACDB
Find the 50th word when permutations of $A, B, C, D, E$ are listed alphabetically.
Check Twin Answer
49th: $C A B D E$. 50th: $C A B E D$.
Answer: CABED
View Solution & Answer (Click to Expand)
2. Remaining 4 digits: $4! = 24$.
Total $= 3 \times 24 = 72$.
Answer: $72$
Using each of $\{0, 1, 2, 3, 4\}$ once, find how many 5-digit integers strictly less than $30000$ can be formed.
Check Twin Answer
$2 \times 4! = 48$.
Answer: $48$
View Solution & Answer (Click to Expand)
2. Rank of $D A C B E$: $A, B, C$ lead (72) + $DAB$ leads (2) = 74. $DACBE$ is the 75th word.
3. Count between $= 75 - 37 - 1 = 37$.
Answer: $37$
For permutations of $A, B, C, D$, find the number of words strictly between $B A C D$ and $C A D B$.
Check Twin Answer
Between $= 14 - 7 - 1 = 6$.
Answer: $6$
View Solution & Answer (Click to Expand)
2. Leading $A, B, C$ account for $3 \times 24 = 72$ words.
3. 4th word starting with $D$:
- 73rd: $D A B C E$
- 74th: $D A B E C$
- 75th: $D A C B E$
- 76th: $D A C E B$
Answer: DACEB
All 5-digit permutations of $\{1, 2, 3, 4, 5\}$ are listed in descending order starting from $54321$. Find the $30$th number in this sequence.
Check Twin Answer
$45\square\square\square$ contains $3! = 6$ numbers. The 6th number is the smallest in this group: $45123$.
Answer: $45123$
The Pinnacle of Multi-Layered Deduction: 3 Advanced Permutation Challenges
[Killer Challenge 01] Residue Partitioning & Sums of Adjacent Multiples Exclusion
Using each of the seven digits $\{1, 2, 3, 4, 5, 6, 7\}$ exactly once to form a linear arrangement, determine the number of permutations in which no two adjacent numbers sum to a multiple of 3.
Two integers sum to a multiple of 3 if and only if: (1) both are multiples of 3 ($0 \pmod 3$), or (2) one is $1 \pmod 3$ and the other is $2 \pmod 3$.
Partition the set into modulo-3 residue classes immediately:
• $A = \{3, 6\}$ (Residue 0, 2 elements)
• $B = \{1, 4, 7\}$ (Residue 1, 3 elements)
• $C = \{2, 5\}$ (Residue 2, 2 elements)
Elements of $B$ and $C$ can never be adjacent! Elements of $A$ can also never be adjacent ($3 + 6 = 9$). Hence, the 2 elements of $A$ must act as physical isolation barriers that strictly separate block $B$ from block $C$.
View Solution & Answer (Click)
• $A$ elements cannot be adjacent to each other ($3+6 \equiv 0$).
• No element from $B$ can touch any element from $C$ ($1+2 \equiv 1+5 \equiv 0$).
• Elements within $B$ may touch ($1+4=5, 4+7=11 \not\equiv 0$), and elements within $C$ may touch ($2+5=7 \not\equiv 0$).
Step 2 (Structural Skeleton Construction):
To keep the 3 elements of $B$ and the 2 elements of $C$ completely apart, all elements of $B$ must form a continuous subsegment, and all elements of $C$ must form a continuous subsegment, with elements of $A$ separating them.
The 2 elements of $A$ must isolate the $[B]$ block from the $[C]$ block. The valid skeleton structures are:
1) $[B \text{ block}] - A_1 - [C \text{ block}] - A_2$
2) $A_1 - [B \text{ block}] - A_2 - [C \text{ block}]$
3) Inverting the order of $[B]$ and $[C]$ yields 2 complementary skeletons.
Accounting for boundary and separator placements gives exactly 6 structural patterns.
Step 3 (Internal Permutations):
• Arrange 2 elements of $A$: $2! = 2$
• Arrange 3 elements of $B$: $3! = 6$
• Arrange 2 elements of $C$: $2! = 2$
Total valid permutations = $6 \times (2! \times 3! \times 2!) = 6 \times (2 \times 6 \times 2) = 144$.
Answer: 144
[Killer Challenge 02] Bijective Mapping with Bounded Coordinate Displacement ($|f(x) - x| \le 1$)
Let $X = \{1, 2, 3, 4, 5, 6\}$. Find the number of bijections (one-to-one and onto functions) $f: X \to X$ such that $$|f(x) - x| \le 1$$ holds for all $x \in X$.
The condition $|f(x) - x| \le 1$ restricts each element $x$ to mapping only to $\{x-1, x, x+1\}$.
Since $f$ is a bijection, any cyclic shift of length $\ge 3$ (e.g., $1 \to 2 \to 3 \to 1$) causes an impossible leap $|3 - 1| = 2 > 1$.
Therefore, every valid bijection is composed solely of: (1) fixed points of length 1 ($f(x) = x$), and (2) adjacent pairwise swaps of length 2 ($f(x) = x+1, f(x+1) = x$).
This directly models a Fibonacci-type tiling recurrence: $a_n = a_{n-1} + a_{n-2}$.
View Solution & Answer (Click)
Let $a_n$ denote the number of such bijections on a set of size $n$.
• Case A: $f(n) = n$ (element $n$ is fixed). The remaining $n-1$ elements yield $a_{n-1}$ bijections.
• Case B: $f(n) = n-1$. By bijectivity and the displacement constraint, we must have $f(n-1) = n$. The remaining $n-2$ elements yield $a_{n-2}$ bijections.
Thus, $a_n = a_{n-1} + a_{n-2}$.
Step 2 (Base Cases & Sequence Evaluation):
• $a_1 = 1$ ($f(1)=1$)
• $a_2 = 2$ ($(1)(2)$ or $(1, 2)$ swap)
• $a_3 = 2 + 1 = 3$
• $a_4 = 3 + 2 = 5$
• $a_5 = 5 + 3 = 8$
• $a_6 = 8 + 5 = 13$
Answer: 13
[Killer Challenge 03] Permutations with a Prescribed Inversion Number ($I(\pi) = 2$)
Consider all permutations $(a_1, a_2, a_3, a_4, a_5)$ of the set $\{1, 2, 3, 4, 5\}$. An inversion is defined as an index pair $(i, j)$ such that $i < j$ and $a_i > a_j$. Find the number of permutations having exactly 2 inversions.
The inversion number represents the minimum number of adjacent transpositions needed to sort the sequence into $(1, 2, 3, 4, 5)$.
An inversion count of 2 can arise in only two mutually exclusive ways:
(1) Two non-overlapping adjacent transpositions occurring independently (e.g., swapping $(1, 2)$ and swapping $(4, 5)$).
(2) A single element shifted two positions to the left over two smaller numbers (e.g., $(1, 2, 3) \to (3, 1, 2)$).
View Solution & Answer (Click)
The Mahonian generating function for inversions of $S_5$ is:
$P_5(x) = (1)(1+x)(1+x+x^2)(1+x+x^2+x^3)(1+x+x^2+x^3+x^4)$.
The number of permutations with 2 inversions corresponds to the coefficient of $x^2$.
Step 2 (Case Breakdown):
• Case A (Two disjoint adjacent swaps):
There are 4 adjacent position pairs: $(1, 2), (2, 3), (3, 4), (4, 5)$.
Number of disjoint pairs: $\binom{4}{2} - (\text{overlapping consecutive pairs}) = 6 - 3 = 3$ ways.
(Examples: $21435, 21354, 13254$)
• Case B (One shift of length 2):
There are 3 consecutive triplets of positions: $(1, 2, 3), (2, 3, 4), (3, 4, 5)$.
Within any 3 consecutive numbers, exactly 2 permutations yield an inversion count of 2: $(3, 1, 2)$ and $(2, 3, 1)$.
Total configurations = $3 \times 2 = 6$ ways.
Step 3 (Summation):
Total = $3 + 6 = 9$.
Answer: 9
From pocket enclosures to trailing-zero modularity and reverse lexicographical transformations, you have established the 15 fundamental pillars of competition-level permutations. This disciplined control of sequential order serves as the critical bridge to combinations and binominal expansions.

Comments
Post a Comment