Skip to main content

2015 AMC 10A Problem 10

Problem 10 of 25EasierCounting & Probability

How many rearrangements of abcdabcd are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either abab or ba.ba.

Answer choices

Show solution

Solution

The forbidden adjacent pairs are ab,ba,bc,cb,cd,dc.ab,ba,bc,cb,cd,dc. If an arrangement starts with a,a, its second letter must be cc or d.d. After ac,ac, either remaining order contains cbcb or cd.cd. After ad,ad, the remaining bb and cc must be adjacent. Thus no valid arrangement starts with a.a. By symmetry, no valid arrangement starts with d.d. If an arrangement starts with b,b, it must continue with d,d, then a,a, then c,c, giving bdac.bdac. Similarly, starting with cc gives only cadb.cadb. Therefore there are 22 valid rearrangements. Thus, C is the correct answer.

More practice

Concepts: arrangements with restrictions · casework

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.