返回题库

AIME 2008 II · 第 6 题

AIME 2008 II — Problem 6

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

The sequence {an}\{a_n\} is defined by

a0=1,a1=1, and an=an1+an12an2 for n2.a_0 = 1,a_1 = 1, \text{ and } a_n = a_{n - 1} + \frac {a_{n - 1}^2}{a_{n - 2}}\text{ for }n\ge2. The sequence {bn}\{b_n\} is defined by

b0=1,b1=3, and bn=bn1+bn12bn2 for n2.b_0 = 1,b_1 = 3, \text{ and } b_n = b_{n - 1} + \frac {b_{n - 1}^2}{b_{n - 2}}\text{ for }n\ge2. Find b32a32\frac {b_{32}}{a_{32}}.

解析

Solution

Rearranging the definitions, we have

anan1=an1an2+1,bnbn1=bn1bn2+1\frac{a_n}{a_{n-1}} = \frac{a_{n-1}}{a_{n-2}} + 1,\quad \frac{b_n}{b_{n-1}} = \frac{b_{n-1}}{b_{n-2}} + 1 from which it follows that anan1=1+an1an2==(n1)+a1a0=n\frac{a_n}{a_{n-1}} = 1+ \frac{a_{n-1}}{a_{n-2}} = \cdots = (n-1) + \frac{a_{1}}{a_0} = n and bnbn1=(n1)+b1b0=n+2\frac{b_n}{b_{n-1}} = (n-1) + \frac{b_{1}}{b_0} = n+2. These recursions, an=nan1a_{n} = na_{n-1} and bn=(n+2)bn1b_{n} = (n+2)b_{n-1}, respectively, correspond to the explicit functions an=n!a_n = n! and bn=(n+2)!2b_n = \frac{(n+2)!}{2} (after applying our initial conditions). It follows that b32a32=34!232!=34332=561\frac{b_{32}}{a_{32}} = \frac{\frac{34!}{2}}{32!} = \frac{34 \cdot 33}{2} = \boxed{561}.

From this, we can determine that the sequence bnan\frac {b_n}{a_n} corresponds to the triangular numbers.