AMC 10 Step by Step

2015 AMC 10A Problem 10

P1-10~2 minPrint

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 baba .

Log in to save your progress.
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.

  1. List the pairs that may not sit side by side: aa and bb, bb and cc, cc and dd (in either order).
  2. So each letter's allowed neighbors are:
letterallowed neighbors
aacc, dd
bbdd only
ccaa only
ddaa, bb

3. A letter in one of the two middle spots has two neighbors. Since bb has only one allowed neighbor, bb cannot be in the middle. It must be at an end, with dd right beside it.
4. For the same reason cc must be at an end, with aa right beside it.
5. So bb and cc take the two ends, dd sits next to bb, and aa sits next to cc. That leaves just
b d a candc a d b.b\,d\,a\,c \qquad\text{and}\qquad c\,a\,d\,b.
6. Check the middle pair in each: dd and aa are not next to each other in the alphabet. Both arrangements work.

The answer is (C) 2\boxed{\textbf{(C)}\ 2}.

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 4×3×2×1=244 \times 3 \times 2 \times 1 = 24 orders, so you can also list them. It helps to group them by first letter. For example, starting with aa, the next letter must be cc or dd; a ca\,c then needs a neighbor of cc other than aa, which does not exist, and a da\,d then needs bb and then cc, but b cb\,c is not allowed. So nothing starts with aa. Doing the same for the other first letters leaves only bdacbdac and cadbcadb.

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 {a,b}\{a,b\}, {b,c}\{b,c\} and {c,d}\{c,d\}. So the only letter allowed next to bb is dd, and the only letter allowed next to cc is aa.

A letter in one of the two middle positions has two neighbors, but bb has only one permitted neighbor, so bb must sit at an end with dd beside it. The same reasoning forces cc to sit at the other end with aa beside it. That leaves exactly two arrangements:
b d a candc a d b.b\,d\,a\,c \qquad\text{and}\qquad c\,a\,d\,b.
Both satisfy the rule (the interior pair is d,ad, a, which are not alphabetically adjacent).

The answer is (C) 2\boxed{\textbf{(C)}\ 2}.

Review in the AoPS books

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.