$\mathbb{N}_{10}$ is generalization of $\mathbb{N}$ that every hypernumber in $\mathbb{N}_{10}$ is something like: $\overline{...a_2a_1a_0}$ with $a_i \in {0,1..9}$ (Notice that $\overline {...000} \in \mathbb{N}_{10}$) Also we easily have $+,*$ in $\mathbb{N}_{10}$. first $k$ number of $a*b$= first $k$ nubmer of (first $k$ number of a * first $k$ number of b) first $k$ number of $a+b$= first $k$ nubmer of (first $k$ number of a + first $k$ number of b) Fore example $\overline {...999}+ \overline {...0001}= \overline {...000}$ Prove that every monic polynomial in $\mathbb{N}_{10}[x]$ with degree $d$ has at most $d^2$ roots.

A function $f_n(x)\ (n=1,\ 2,\ \cdots)$ is defined by $f_1(x)=x$ and \[f_n(x)=x+\frac{e}{2}\int_0^1 f_{n-1}(t)e^{x-t}dt\ (n=2,\ 3,\ \cdots)\]. Find $f_n(x)$.

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Let $ x \in \mathbb{Q}^+$. Prove that there exits $\alpha_1,\alpha_2,...,\alpha_k \in \mathbb{N}$ and pairwe distinct such that \[x= \sum_{i=1}^{k} \frac{1}{\alpha_i}\]

From an unlimited supply of 1-cent coins, 10-cent coins, and 25-cent coins, Silas wants to find a collection of coins that has a total value of $N$ cents, where $N$ is a positive integer. He uses the so-called greedy algorithm, successively choosing the coin of greatest value that does not cause the value of his collection to exceed $N.$ For example, to get 42 cents, Silas will choose a 25-cent coin, then a 10-cent coin, then 7 1-cent coins. However, this collection of 9 coins uses more coins than necessary to get a total of 42 cents; indeed, choosing 4 10-cent coins and 2 1-cent coins achieves the same total value with only 6 coins. In general, the greedy algorithm succeeds for a given $N$ if no other collection of 1-cent, 10-cent, and 25-cent coins gives a total value of $N$ cents using strictly fewer coins than the collection given by the greedy algorithm. Find the number of values of $N$ between $1$ and $1000$ inclusive for which the greedy algorithm succeeds.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

At a math contest there are $2n$ students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the $2n$ problems submitted. One says that the contest is [i]fair[/i] is there are $n$ participants which receive their problems from the other $n$ participants. Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]

Noah has to fit 8 species of animals into 4 cages of the Arc. He planes to put two species of animal in each cage. It turns out that, for each species of animal, there are at most 3 other species with which it cannot share a cage. Prove that there is a way to assign the animals to the cages so that each species shares a cage with a compatible species.

Let $n$ be a positive integer. The numbers $\{1, 2, ..., n^2\}$ are placed in an $n \times n$ grid, each exactly once. The grid is said to be [i]Muirhead-able[/i] if the sum of the entries in each column is the same, but for every $1 \le i,k \le n-1$, the sum of the first $k$ entries in column $i$ is at least the sum of the first $k$ entries in column $i+1$. For which $n$ can one construct a Muirhead-able array such that the entries in each column are decreasing? [i]Proposed by Evan Chen[/i]

In each cell, a strip of length $100$ is worth a chip. You can change any $2$ neighboring chips and pay $1$ rouble, and you can also swap any $2$ chips for free, between which there are exactly $4$ chips. For what is the smallest amount of rubles you can rearrange chips in reverse order?

Mr. Fat and Ms. Taf play a game. Mr. Fat chooses a sequence of positive integers $ k_1, k_2, \ldots , k_n$. Ms. Taf must guess this sequence of integers. She is allowed to give Mr. Fat a red card and a blue card, each with an integer written on it. Mr. Fat replaces the number on the red card with $ k_1$ times the number on the red card plus the number on the blue card, and replaces the number on the blue card with the number originally on the red card. He repeats this process with number $ k_2$. (That is, he replaces the number on the red card with $ k_2$ times the number now on the red card plus the number now on the blue card, and replaces the number on the blue card with the number that was just placed on the red card.) He then repeats this process with each of the numbers $ k_3, \ldots k_n$, in this order. After has has gone through the sequence of integers, Mr. Fat then gives the cards back to Ms. Taf. How many times must Ms. Taf submit the red and blue cards in order to be able to determine the sequence of integers $ k_1, k_2, \ldots k_n$?

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

Let $p$ and $q$ be relatively prime positive integers. A subset $S\subseteq \mathbb{N}_0$ is called ideal if $0 \in S$ and, for each element $n \in S$, the integers $n+p$ and $n+q$ belong to $S$. Determine the number of ideal subsets of $\mathbb{N}_0$.

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]