Maths Olympiad Prep

Library / /217 of 520

Combinatorics Difficulty 6.5 National olympiad Find the answer

2.45 A monotonically increasing sequence of integers, if its first term is odd, the second term is even, the third term is odd, the fourth term is even, \cdots, and so on, is called an alternating sequence. The empty set is also considered an alternating sequence. Let A(n)A(n) denote the number of alternating sequences, where the integers are all taken from the set {1,2,,n}\{1,2, \cdots, n\}. Clearly, A(1)=2,A(2)=3A(1)=2, A(2)=3. Find A(20)A(20), and prove your conclusion.

A number or a short expression. Spacing and $ signs are ignored.

Solution

[Solution] When n=1n=1, ϕ\phi and {1}\{1\} are two alternating sequences, so A(1)=2A(1)=2. When n=2n=2, ϕ,{1},{1,2}\phi, \{1\}, \{1,2\} are three alternating sequences, so A(2)=3A(2)=3. If {a1,a2,a3,,am}\left\{a_{1}, a_{2}, a_{3}, \cdots, a_{m}\right\} is a non-empty alternating sequence taken from the set {1,2,,n}\{1,2, \cdots, n\}, then when a1=1a_{1}=1,
{a21,a31,,am1}\left\{a_{2}-1, a_{3}-1, \cdots, a_{m}-1\right\}

is an alternating sequence taken from the set {1,2,,n1}\{1,2, \cdots, n-1\}. And when a1=1a_{1}=1, the non-empty alternating sequence {a1,a2,a3,,am}\left\{a_{1}, a_{2}, a_{3}, \cdots, a_{m}\right\} taken from the set {1,2,,n}\{1,2, \cdots, n\} corresponds one-to-one with the alternating sequence {a21,a31,,am1}\left\{a_{2}-1, a_{3}-1, \cdots, a_{m}-1\right\} taken from the set {1,2,,n1}\{1,2, \cdots, n-1\}, so when a1=1a_{1}=1, the non-empty alternating sequence {a1,a2,,am}\left\{a_{1}, a_{2}, \cdots, a_{m}\right\} taken from the set {1,2,,n}\{1,2, \cdots, n\} has A(n1)A(n-1) sequences.

When a13a_{1} \geqslant 3,
{a12,a22,,am2}\left\{a_{1}-2, a_{2}-2, \cdots, a_{m}-2\right\}

is a non-empty alternating sequence taken from the set {1,2,,n2}\{1,2, \cdots, n-2\}. And when a13a_{1} \geqslant 3, the non-empty alternating sequence {a1,a2,,am}\left\{a_{1}, a_{2}, \cdots, a_{m}\right\} taken from the set {1,2,,n}\{1,2, \cdots, n\} corresponds one-to-one with the non-empty alternating sequence {a12,a22,,am2}\left\{a_{1}-2, a_{2}-2, \cdots, a_{m}-2\right\} taken from the set {1,2,,n2}\{1,2, \cdots, n-2\}. So, when a13a_{1} \geqslant 3, the non-empty alternating sequence {a1,a2,,am}\left\{a_{1}, a_{2}, \cdots, a_{m}\right\} taken from the set {1,2,,n}\{1,2, \cdots, n\} has A(n2)1A(n-2)-1 sequences.

From the above discussion, the number of alternating sequences taken from the set {1,2,,n}\{1,2, \cdots, n\}
A(n)=A(n1)+(A(n2)1)+1A(n)=A(n-1)+(A(n-2)-1)+1

i.e.,
A(n)=A(n1)+A(n2)A(n)=A(n-1)+A(n-2)

Using the above equation, we calculate
A(1)=2,A(2)=3,A(3)=A(1)+A(2)=5,A(1)=2, A(2)=3, A(3)=A(1)+A(2)=5,

Similarly, we get
A(4)=8,A(5)=13,A(6)=21,A(7)=34A(8)=55,A(9)=89,A(10)=144,A(11)=233A(12)=377,A(13)=610,A(14)=987,A(15)=1597A(16)=2584,A(17)=4181,A(18)=6765,A(19)=10946A(20)=17711.\begin{array}{llll} A(4)=8, & A(5)=13, & A(6)=21, & A(7)=34 \\ A(8)=55, & A(9)=89, & A(10)=144, & A(11)=233 \\ A(12)=377, & A(13)=610, & A(14)=987, & A(15)=1597 \\ A(16)=2584, & A(17)=4181, & A(18)=6765, & A(19)=10946 \\ A(20)=17711. & & \end{array}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.