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