2015 AMC 10A Problem 10
How many rearrangements of are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either or .
Show solution without answering
Key insight
The letter b may only sit next to d, and c only next to a. With one allowed neighbor each, both must sit at the ends.
Solution
Start with the letters that have the fewest choices.
- List the pairs that may not sit side by side: and , and , and (in either order).
- So each letter's allowed neighbors are:
| letter | allowed neighbors |
|---|---|
| , | |
| only | |
| only | |
| , |
3. A letter in one of the two middle spots has two neighbors. Since has only one allowed neighbor, cannot be in the middle. It must be at an end, with right beside it.
4. For the same reason must be at an end, with right beside it.
5. So and take the two ends, sits next to , and sits next to . That leaves just
6. Check the middle pair in each: and are not next to each other in the alphabet. Both arrangements work.
The answer is .
Why this works
In a "who can sit next to whom" problem, look first at the most limited item. A letter with only one allowed neighbor has to be at an end of the row, and it drags its one partner with it. Here two such letters decide the whole row.
Alternative approach
There are only orders, so you can also list them. It helps to group them by first letter. For example, starting with , the next letter must be or ; then needs a neighbor of other than , which does not exist, and then needs and then , but is not allowed. So nothing starts with . Doing the same for the other first letters leaves only and .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
The forbidden neighbor pairs are , and . So the only letter allowed next to is , and the only letter allowed next to is .
A letter in one of the two middle positions has two neighbors, but has only one permitted neighbor, so must sit at an end with beside it. The same reasoning forces to sit at the other end with beside it. That leaves exactly two arrangements:
Both satisfy the rule (the interior pair is , which are not alphabetically adjacent).
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Counting & Probability, Chapter 3: Correcting for Overcounting (§3.2, §3.4)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.