olymmath

RMM 2020 Problem 2

  • Day 1

Let N≥2N \geq 2 be an integer, and let a\mathbf a =(a1,…,aN)= (a_1, \ldots, a_N) and b\mathbf b =(b1,…bN)= (b_1, \ldots b_N) be sequences of non-negative integers. For each integer i∉{1,…,N}i \not \in \{1, \ldots, N\} , let ai=aka_i = a_k and bi=bkb_i = b_k , where k∈{1,…,N}k \in \{1, \ldots, N\} is the integer such that i−ki-k is divisible by nn . We say a\mathbf a is b\mathbf b -harmonic if each aia_i equals the following arithmetic mean: ai=12bi+1∑s=−bibiai+s.a_i = \frac{1}{2b_i+1} \sum_{s=-b_i}^{b_i} a_{i+s}. Suppose that neither a\mathbf a nor b\mathbf b is a constant sequence, and that both a\mathbf a is b\mathbf b -harmonic and b\mathbf b is a\mathbf a -harmonic.

Prove that at least N+1N+1 of the numbers a1,…,aN,b1,…,bNa_1, \ldots, a_N,b_1, \ldots, b_N are zero.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator rmm/2020/p2 · Tag 713ZDCYXM3 · Edit this page on GitHub · Keys: j next, k previous