19. (FRG 2) Denote by an the greatest number that is not divisible by 3 and that divides n. Consider the sequence s0=0,sn=a1+a2+⋯+an, n∈N. Denote by A(n) the number of all sums sk(0≤k≤3n,k∈N0) that are divisible by 3 . Prove the formula A(n)=3n−1+2⋅3(n/2)−1cos(nπ/6),n∈N0.
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.