Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2009-part-05 — 172 problems (EN–VI) Question 34

Math Olympiad Vault · MathNet 2009-part-05 — 172 problems (EN–VI)

Question 34

Bob is writing a sequence of letters of the alphabet, each of which can be either uppercase or lowercase, according to the following two rules:
- If he had just written an uppercase letter, he can either write the same letter in lowercase after it, or the next letter of the alphabet in uppercase.
- If he had just written a lowercase letter, he can either write the same letter in uppercase after it, or the preceding letter of the alphabet in lowercase.

For instance, one such sequence is $a A a A B C D d c b B C$. How many sequences of 32 letters can he write that start at (lowercase) $a$ and end at (lowercase) $z$? (The alphabet contains 26 letters from $a$ to $z$.)