Processing math: 100%
Home
Book
Learn
Library
Practice
Contact
Log In
Combinatorics
AMC10/12
2015
Problem - 1234
How many rearrangements of
a
b
c
d
are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either
a
b
or
b
a
.
report an error