olymmath

CIIM 2017 Problem 3

  • Day 1

Let GG be a finite abelian group and f:Z+→Gf :\mathbb{Z}^+ \to G a completely multiplicative function (i.e. f(mn)=f(m)f(n)f(mn) = f(m)f(n) for any positive integers m,nm, n ). Prove that there are infinitely many positive integers kk such that f(k)=f(k+1).f(k) = f(k + 1).

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 ciim/2017/p3 · Tag J8RKGD19B0 · Edit this page on GitHub · Keys: j next, k previous