Let $S$ be a subset of $\{0,1,2,\dots ,9\}$. Suppose there is a positive integer $N$ such that for any integer $n>N$, one can find positive integers $a,b$ so that $n=a+b$ and all the digits in the decimal representations of $a,b$ (expressed without leading zeros) are in $S$. Find the smallest possible value of $|S|$. [i]Proposed by Sutanay Bhattacharya[/i] [hide=Original Wording] As pointed out by Wizard_32, the original wording is: Let $X=\{0,1,2,\dots,9\}.$ Let $S \subset X$ be such that any positive integer $n$ can be written as $p+q$ where the non-negative integers $p, q$ have all their digits in $S.$ Find the smallest possible number of elements in $S.$ [/hide]

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Given the positive integer $n$, find the integer $f(n)$ so that $f(n)$ is the next positive integer that is always a number whose all digits are divisible by $n$.

What is the largest number $N$ for which there exist $N$ consecutive positive integers such that the sum of the digits in the $k$-th integer is divisible by $k$ for $1 \le k \le N$ ? (S Tokarev)

Find the maximum value of $n$, such that there exist $n$ pairwise distinct positive numbers $x_1,x_2,\cdots,x_n$, satisfy $$x_1^2+x_2^2+\cdots+x_n^2=2017$$

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

Given regular $45$-gon. Can you mark its corners with the digits $\{0,1,...,9\}$ in such a way, that for every pair of digits there would be a side with both ends marked with those digits?

Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.

A positive integer is called [i]fancy[/i] if it can be expressed in the form $$2^{a_1}+2^{a_2}+ \cdots+ 2^{a_{100}},$$ where $a_1,a_2, \cdots, a_{100}$ are non-negative integers that are not necessarily distinct. Find the smallest positive integer $n$ such that no multiple of $n$ is a [i]fancy[/i] number. [i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]

How many ordered pairs of integers $(m,n)$ are there such that $m$ and $n$ are the legs of a right triangle with an area equal to a prime number not exceeding $80$?

Solve in positive integers $x,y$ the equation $2^x - 3^y = 7$.

For positive integer $k$, define $x_k=3k+\sqrt{k^2-1}-2(\sqrt{k^2-k}+\sqrt{k^2+k})$. Then $\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_{1681}}=\sqrt{m}-n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $k$ be a positive integer and let $n$ be the smallest number with exactly $k$ divisors. Given $n$ is a cube, is it possible that $k$ is divisible by a prime factor of the form $3j+2$?

For any integer $n\ge 4$, prove that there exists a $n$-degree polynomial $f(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_0$ satisfying the two following properties: [b](1)[/b] $a_i$ is a positive integer for any $i=0,1,\ldots,n-1$, and [b](2)[/b] For any two positive integers $m$ and $k$ ($k\ge 2$) there exist distinct positive integers $r_1,r_2,...,r_k$, such that $f(m)\ne\prod_{i=1}^{k}f(r_i)$.

Given any positive integer, we can write the integer in base $12$ and add together the digits of its base $12$ representation. We perform this operation on the number $ 7^{6^{5^{4^{3^{2^{1}}}}}}$ repeatedly until a single base $12$ digit remains. Find this digit.

Determine all pairs $(a,b)$ of positive integers such that $(a+b)^3-2a^3-2b^3$ is a power of two.

Larry and Rob are two robots travelling in one car from Argovia to Zillis. Both robots have control over the steering and steer according to the following algorithm: Larry makes a 90 degrees left turn after every $ \ell$ kilometer driving from start, Rob makes a 90 degrees right turn after every $ r$ kilometer driving from start, where $ \ell$ and $ r$ are relatively prime positive integers. In the event of both turns occurring simultaneously, the car will keep going without changing direction. Assume that the ground is flat and the car can move in any direction. Let the car start from Argovia facing towards Zillis. For which choices of the pair ($ \ell$, $ r$) is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?

Determine all such pairs pf positive integers $(a, b)$ such that $a + b + (gcd (a, b))^ 2 = lcm (a, b) = 2 \cdot lcm(a -1, b)$, where $lcm (a, b)$ denotes the smallest common multiple, and $gcd (a, b)$ denotes the greatest common divisor of numbers $a, b$.

Solve the equation $p^3-q^3=pq^3-1$ in primes $p,q$.

Let $a, b$ be positive integers and $p, q$ be prime numbers for which $p \nmid q - 1$ and $q \mid a^p - b^p$. Prove that $q \mid a - b$.

Juan found an easy (but wrong) way to simplify fractions. He proposes to simplify a fraction $\frac{M}{N}$ , where $M <N$ are two natural numbers, erase simultaneously the equal digits in the numerator and denominator. For instance, $\frac{12356}{5789}$ transforms after simplification of Juan in $\frac{126}{789}$. Find out if there is at least one fraction $\frac{M}{N}$, with $10 <M <N <100$ for which this method gives a correct result.

For a given positive integer $n$ and prime number $p$, find the minimum value of positive integer $m$ that satisfies the following property: for any polynomial $$f(x)=(x+a_1)(x+a_2)\ldots(x+a_n)$$ ($a_1,a_2,\ldots,a_n$ are positive integers), and for any non-negative integer $k$, there exists a non-negative integer $k'$ such that $$v_p(f(k))<v_p(f(k'))\leq v_p(f(k))+m.$$ Note: for non-zero integer $N$,$v_p(N)$ is the largest non-zero integer $t$ that satisfies $p^t\mid N$.

Find all positive integers $1 \le n \le 2008$ so that there exist a prime number $p \ge n$ such that $$\frac{2008^p + (n -1)!}{n}$$ is a positive integer.

Let $n$ be a positive integer. Prove that every prime $p > 2$ that divides $(2-\sqrt{3})^n + (2+\sqrt{3})^n$ satisfy $p=1 (mod3)$

If we divide the number $13$ by the three numbers $5, 7$, and $9$, then these divisions leave remainders: when dividing by $5$ the remainder is $3$, when dividing by $7$ the remainder is $6$, and when dividing by $9$ the remainder is 4. If we add these remainders, we obtain $3 + 6 + 4 = 13$, the original number. (a) Let $n$ be a positive integer and let $a$ and $b$ be two positive integers smaller than $n$. Prove: if you divide $n$ by $a$ and $b$, then the sum of the two remainders never equals $n$. (b) Determine all integers $n > 229$ having the property that if you divide $n$ by $99, 132$, and $229$, the sum of the three remainders is $n$.