This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 5

Suppose that $k$ is a positive integer. A bijective map $f : Z \to Z$ is said to be $k$-[i]jumpy [/i] if $|f(z) - z| \le k$ for all integers $z$. Is it that case that for every $k$, each $k$-jumpy map is a composition of $1$-jumpy maps? [i]It is well known that this is the case when the support of the map is finite.[/i]
Does there exist a second-degree polynomial $p(x, y)$ in two variables such that every non-negative integer $ n $ equals $p(k,m)$ for one and only one ordered pair $(k,m)$ of non-negative integers? [i]Proposed by Finland.[/i]
Does there exist a second-degree polynomial $p(x, y)$ in two variables such that every non-negative integer $ n $ equals $p(k,m)$ for one and only one ordered pair $(k,m)$ of non-negative integers? [i]Proposed by Finland.[/i]
Let $T = \{1,2,...,10\}$. Find the number of bijective functions $f : T\to T$ that satis es the following for all $x \in T$: $f(f(x)) = x$ $|f(x) - x| \ge 2$
Let $\mathbb{N}$ be the set of all natural numbers. Let $f:\mathbb{N} \to \mathbb{N}$ be a bijective function. Show that there exists three numbers $a$, $b$, $c$ in arithmatic progression such that $f(a)<f(b)<f(c)$