Home
Book
Learn
Library
Practice
Contact
Log In
Combinatorics
AMC10/12
2015
Problem - 1234
How many rearrangements of $abcd$ are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either $ab$ or $ba$.
report an error