olymmath

BALKAN-SL 2021 A4

Let f,gf, g be functions from the positive integers to the integers. Vlad the impala is jumping around the integer grid. His initial position is x0=(0,0)\mathbf{x}_{0}=(0,0), and for every n⩾1n \geqslant 1, his jump is

xn−xn−1=(±f(n),±g(n)) or (±g(n),±f(n))\mathbf{x}_{n}-\mathbf{x}_{n-1}=( \pm f(n), \pm g(n)) \text { or }( \pm g(n), \pm f(n))

with eight possibilities in total. Is it always possible that Vlad can choose his jumps to return to his initial location (0,0)(0,0) infinitely many times when (a) f,gf, g are polynomials with integer coefficients? (b) f,gf, g are any pair of functions from the positive integers to the integers?

Dataset text NuminaMath olympiads. 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 balkan-sl/2021/a4 · Tag 1YP72T5QFF · Edit this page on GitHub · Keys: j next, k previous