Found problems: 310
Let $m$ be a positive integer less than $2015$. Suppose that the remainder when $2015$ is divided by $m$ is $n$. Compute the largest possible value of $n$.
[i] Proposed by Michael Ren [/i]
The number $60$ is written on a blackboard. In every move, Andris wipes the numbers on the board one by one, and writes all its divisors in its place (including itself). After $10$ such moves, how many times will $1$ appear on the board?
A positive integer $n$ has exactly $12$ positive divisors $1 = d_1 < d_2 < d_3 < ... < d_{12} = n$. Let $m = d_4 - 1$. We have $d_m = (d_1 + d_2 + d_4) d_8$. Find $n$.
Let $a > 3$ be an odd integer. Show that for every positive integer $n$ the number $a^{2^n}- 1$ has at least $n + 1$ distinct prime divisors.
Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.
A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.
For positive integer $k$, let $p(k)$ denote the greatest odd divisor of $k$. Prove that for every positive integer $n$,
$$\frac{2n}{3} < \frac{p(1)}{1}+ \frac{p(2)}{2}+... +\frac{ p(n)}{n}<\frac{2(n + 1)}{3}$$
The number $4$ has an odd number of odd positive divisors, namely $1$, and an even number of even positive divisors, namely $2$ and $4$. Is there a number with an odd number of even positive divisors and an even number of odd positive divisors?
Find all positive integers $n$ for which there exists a positive integer $k$ such that for every positive divisor $d$ of $n$, the number $d - k$ is also a (not necessarily positive) divisor of $n$.
Let $S(n)$ be the sum of all different natural divisors of odd natural number $n> 1$ (including $n$ and $1$).
Prove that $(S(n))^3 <n^4$.