olymmath

IR-TST 2021 Problem 3

  • Test 1

There exist 44 positive integers a,b,c,da,b,c,d such that abcd≠1abcd \neq 1 and each pair of them have a GCD of 11 . Two functions f,g:N→{0,1}f,g : \mathbb{N} \rightarrow \{0,1\} are multiplicative functions such that for each positive integer nn we have : f(an+b)=g(cn+d)f(an+b)=g(cn+d) Prove that at least one of the followings hold. i)i) for each positive integer nn we have f(an+b)=g(cn+d)=0f(an+b)=g(cn+d)=0 ii)ii) There exists a positive integer kk such that for all nn where (n,k)=1(n,k)=1 we have g(n)=f(n)=1g(n)=f(n)=1 (Function ff is multiplicative if for any natural numbers a,ba,b we have f(ab)=f(a)f(b)f(ab)=f(a)f(b) )

Proposed by Navid Safaii

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 ir-tst/2021/p3 · Tag 7BM0F0VGDZ · Edit this page on GitHub · Keys: j next, k previous