Maths Olympiad Prep

Library / /252 of 520

Algebra Difficulty 6.6 National olympiad Find the answer

868 \cdot 6 Let the sequence a0,a1,a2,a_{0}, a_{1}, a_{2}, \cdots satisfy
a0=a1=11,am+n=12(a2m+a2n)(mn)2,m,n0.a_{0}=a_{1}=11, a_{m+n}=\frac{1}{2}\left(a_{2 m}+a_{2 n}\right)-(m-n)^{2}, m, n \geqslant 0 .

Find a45a_{45}.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

[Solution] From a1=a1+0=12(a2+a0)1a_{1}=a_{1+0}=\frac{1}{2}\left(a_{2}+a_{0}\right)-1, we have a2=13a_{2}=13.
For n1n \geqslant 1, by the assumption,
a2n=an+1+n1=12(a2n+2+a2n2)4a_{2 n}=a_{n+1+n-1}=\frac{1}{2}\left(a_{2 n+2}+a_{2 n-2}\right)-4 \text {, }

Thus, let bn=a2nb_{n}=a_{2 n}, we get
b0=11,b1=13, and bn+1=2bnbn1+8,n1.b_{0}=11, b_{1}=13 \text {, and } \quad b_{n+1}=2 b_{n}-b_{n-1}+8, n \geqslant 1 .

From this, we have k=1nbk+1=2k=1nbkk=1nbk1+8n\sum_{k=1}^{n} b_{k+1}=2 \sum_{k=1}^{n} b_{k}-\sum_{k=1}^{n} b_{k-1}+8 n,
which means bn+1=bn+b1b0+8n=bn+8n+2b_{n+1}=b_{n}+b_{1}-b_{0}+8 n=b_{n}+8 n+2.
Therefore, we get bn+1=b1+2n+8k=1nk=4n2+6n+13b_{n+1}=b_{1}+2 n+8 \sum_{k=1}^{n} k=4 n^{2}+6 n+13.
Given b0=11,b1=13b_{0}=11, b_{1}=13, we have
bn=4(n1)2+6(n1)+13=4n22n+11,n=0,1,2,b_{n}=4(n-1)^{2}+6(n-1)+13=4 n^{2}-2 n+11, n=0,1,2, \cdots

Thus, a2n=4n22n+11,n=0,1,2,a_{2 n}=4 n^{2}-2 n+11, n=0,1,2, \cdots.
For any n0n \geqslant 0, using the assumption, we get
an=an+0=12(a2n+a0)n2=12(4n22n+11+11)n2=n2n+11\begin{aligned} a_{n} & =a_{n+0}=\frac{1}{2}\left(a_{2 n}+a_{0}\right)-n^{2} \\ & =\frac{1}{2}\left(4 n^{2}-2 n+11+11\right)-n^{2} \\ & =n^{2}-n+11 \end{aligned}

Therefore, a45=4544+11=1991a_{45}=45 \cdot 44+11=1991.

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.