MathDB

Problems(2)

Who can guess the polynomials ?

Source: Iranian TST 2021, second exam day 1, problem 3

5/22/2021
Prove there exist two relatively prime polynomials P(x),Q(x)P(x),Q(x) having integer coefficients and a real number u>0u>0 such that if for positive integers a,b,c,da,b,c,d we have: ac12021udc1010|\frac{a}{c}-1|^{2021} \le \frac{u}{|d||c|^{1010}} (ac)2020bdudc1010| (\frac{a}{c})^{2020}-\frac{b}{d}| \le \frac{u}{|d||c|^{1010}} Then we have : bP(ac)=dQ(ac)bP(\frac{a}{c})=dQ(\frac{a}{c})
(Two polynomials are relatively prime if they don't have a common root)
Proposed by Navid Safaii and Alireza Haghi
algebrapolynomialinequalitiesnumber theoryrelatively prime
multiplicative functions on a Tst

Source: Iranian TST 2021, first exam day 1, problem 3

5/20/2021
There exist 44 positive integers a,b,c,da,b,c,d such that abcd1abcd \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
functionnumber theory