Maths Olympiad Prep

Library / /254 of 520

Number theory Difficulty 5.5 AIME, harder Prove it

19. (FRG 2) Denote by ana_{n} the greatest number that is not divisible by 3 and that divides nn. Consider the sequence s0=0,sn=a1+a2++ans_{0}=0, s_{n}=a_{1}+a_{2}+\cdots+a_{n}, nNn \in \mathbb{N}. Denote by A(n)A(n) the number of all sums sk(0k3n,kN0)s_{k}\left(0 \leq k \leq 3^{n}, k \in \mathbb{N}_{0}\right) that are divisible by 3 . Prove the formula
A(n)=3n1+23(n/2)1cos(nπ/6),nN0. A(n)=3^{n-1}+2 \cdot 3^{(n / 2)-1} \cos (n \pi / 6), \quad n \in \mathbb{N}_{0} .

Solution

None

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.