Školjka

%V0 Let $P\!\left(x\right)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n\!\left(x\right) = x$ is equal to $P\!\left(n\right)$ for every $n \geqslant 1$, where $T^n$ denotes the $n$-fold application of $T$. Proposed by Jozsef Pelikan, Hungary

%V0 For every $n\in\mathbb{N}$ let $d(n)$ denote the number of (positive) divisors of $n$. Find all functions $f: \mathbb{N}\to\mathbb{N}$ with the following properties: $d\left(f(x)\right) = x$ for all $x\in\mathbb{N}$. $f(xy)$ divides $(x - 1)y^{xy - 1}f(x)$ for all $x$, $y\in\mathbb{N}$. Proposed by Bruno Le Floch, France

%V0 Find all surjective functions $f: \mathbb{N} \mapsto \mathbb{N}$ such that for every $m,n \in \mathbb{N}$ and every prime $p,$ the number $f(m + n)$ is divisible by $p$ if and only if $f(m) + f(n)$ is divisible by $p.$ Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran

%V0 Let $A$ be a non-empty set of positive integers. Suppose that there are positive integers $b_1,\ldots b_n$ and $c_1,\ldots,c_n$ such that - for each $i$ the set $b_iA+c_i=\left\{b_ia+c_i\colon a\in A\right\}$ is a subset of $A$, and - the sets $b_iA+c_i$ and $b_jA+c_j$ are disjoint whenever $i\ne j$ Prove that $${1\over b_1}+\,\ldots\,+{1\over b_n}\leq1.$$

%V0 Let $n$ be a positive integer that is not a perfect cube. Define real numbers $a,b,c$ by $$a=\root3\of n\kern1.5pt,\qquad b={1\over a-[a]}\kern1pt,\qquad c={1\over b-[b]}\kern1.5pt,$$ where $[x]$ denotes the integer part of $x$. Prove that there are infinitely many such integers $n$ with the property that there exist integers $r,s,t$, not all zero, such that $ra+sb+tc=0$.

%V0 $a > 0$ and $b$, $c$ are integers such that $ac$ – $b^2$ is a square-free positive integer P. For example P could be 3*5, but not 3^2*5. Let $f(n)$ be the number of pairs of integers $d, e$ such that $ad^2 + 2bde + ce^2= n$. Show that$f(n)$ is finite and that $f(n) = f(P^{k}n)$ for every positive integer $k$. Original Statement: Let $a,b,c$ be given integers $a > 0,$ $ac-b^2 = P = P_1 \cdots P_n$ where $P_1 \cdots P_n$ are (distinct) prime numbers. Let $M(n)$ denote the number of pairs of integers $(x,y)$ for which $$ax^2 + 2bxy + cy^2 = n.$$ Prove that $M(n)$ is finite and $M(n) = M(P_k \cdot n)$ for every integer $k \geq 0.$ Note that the "$n$" in $P_N$ and the "$n$" in $M(n)$ do not have to be the same.