Find all non-negative integers $n$, $a$, and $b$ satisfying \[2^a + 5^b + 1 = n!.\]

Find the maximum number of colors used in coloring integers $n$ from $49$ to $94$ such that if $a, b$ (not necessarily different) have the same color but $c$ has a different color, then $c$ does not divide $a+b$.

For any positive integer $ k$, let $ f_k$ be the number of elements in the set $ \{ k \plus{} 1, k \plus{} 2, \ldots, 2k\}$ whose base 2 representation contains exactly three 1s. (a) Prove that for any positive integer $ m$, there exists at least one positive integer $ k$ such that $ f(k) \equal{} m$. (b) Determine all positive integers $ m$ for which there exists [i]exactly one[/i] $ k$ with $ f(k) \equal{} m$.

Let $x, y, p, n$, and $k$ be positive integers such that $x^n + y^n = p^k$. Prove that if $n > 1$ is odd, and $p$ is an odd prime, then $n$ is a power of $p$. [i]A. Kovaldji, V. Senderov[/i]

There is one nonzero digit in every cell of $2017\times 2017 $ table. On the board we writes $4034$ numbers that are rows and columns of table. It is known, that $4033$ numbers are divisible by prime $p$ and last is not divisible by $p$. Find all possible values of $p$. [hide=Example]Example for $2\times2$. If table is |1|4| |3|7|. Then numbers on board are $14,37,13,47$[/hide]

In a Greek village of $100$ inhabitants in the beginning there lived $12$ Olympians and $88$ humans, they were the first generation. The Olympians are $100\%$ gods while humans are $0\%$ gods. In each generation they formed $50$ couples and each couple had $2$ children, who form the next generation (also consisting of $100$ members). From the second generation onwards, every person’s percentage of godness is the average of the percentages of his/her parents’ percentages. (For example the children of $25\%$ and $12.5\% $gods are $18.75\%$ gods.) a) Which is the earliest generation in which it is possible that there are equally many $100\%$ gods as $ 0\%$ gods? b) At most how many members of the fifth generation are at least 25% gods?

Find all functions $f:\mathbb{N}\rightarrow\mathbb{N}$ such that for every positive integer $n$ the following is valid: If $d_1,d_2,\ldots,d_s$ are all the positive divisors of $n$, then $$f(d_1)f(d_2)\ldots f(d_s)=n.$$

Define $ f(n) = \dfrac{n^2 + n}{2} $. Compute the number of positive integers $ n $ such that $ f(n) \leq 1000 $ and $ f(n) $ is the product of two prime numbers.

Given two positive integers $a$ and $b$, an [i]legal move[/i] consists in choosing a proper divisor of one of them and adding it to $a$ or adding it to $b$. Two players, Agustin and Ian, take turns making an legal move; Agustin plays first. Whoever gets a number greater than or equal to $2015$ wins the game. [list=a] [*]Determine which of the players has a winning strategy if $a=3, b=5$. [*]Determine which of the players has a winning strategy if $a=6, b=7$. [/list]

Find all pairs of integers $(m, n)$ such that $$m+n = 3(mn+10).$$

Find all $l,m,n \in\mathbb{N}$ that satisfies the equation $5^l43^m+1=n^3$

Prove that there exist distinct positive integers $a_1, a_2,\ldots , a_{2024}$ such that for each $i\in\{1,2,\ldots,2024\}$\[a_i\mid a_1a_2\cdots a_{i-1}a_{i+1}\cdots a_{2024}+k,\]where a) $k=1$ and b) $k=2024.$ [i]Proposed by Ishan Nath[/i]

Find all integers $n$, $n>1$, with the following property: for all $k$, $0\le k < n$, there exists a multiple of $n$ whose digits sum leaves a remainder of $k$ when divided by $n$.

A polynomial is called Fermat polynomial if it can be written as the sum of squares of two polynomials with integer coefficients. Suppose that $f(x)$ is a Fermat polynomial such that $f(0)=1000$. Prove that $f(x)+2x$ is not a fermat polynomial

Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that [list] [*]$m = 1$ and $l = 2k$; or [*]$l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$. [/list]

Let $n\geq 2$ be a positive integer. Prove that there exists a positive integer $m$, such that $n\mid m, \ m<n^4$ and at most four distinct digits are used in the decimal representation of $m$.

For a positive integer $k$, denote by $f(k)$ the number of positive integer $m$ such that the remainder of $km$ modulo $2019^3$ is greater than $m$. Find the amount of different numbers among $f(1), f(2), ..., f(2019^3)$.

A natural number $n$ is said to be $good$ if $n$ is the sum or $r$ consecutive positive integers, for some $r \geq 2 $. Find the number of good numbers in the set $\{1,2 \dots , 100\}$.

Starting at $(0,0),$ an object moves in the coordinate plane via a sequence of steps, each of length one. Each step is left, right, up, or down, all four equally likely. Let $p$ be the probability that the object reaches $(2,2)$ in six or fewer steps. Given that $p$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Find all integers that can be written as $\frac{(a+b)(b+c)(c+a)}{abc}$, where $a,b,c$ are pairwise coprime positive integers.

Given a positive integer $m$. Let $$A_l = (4l+1)(4l+2)...(4(5^m+1)l)$$ for any positive integer $l$. Prove that there exist infinite number of positive integer $l$ which $$5^{5^ml}\mid A_l\text{ and } 5^{5^ml+1}\nmid A_l$$ and find the minimum value of $l$ satisfying the above condition.

Let $p$ be an odd prime number. Let $S=a_1,a_2,\dots$ be the sequence defined as follows: $a_1=1,a_2=2,\dots,a_{p-1}=p-1$, and for $n\ge p$, $a_n$ is the smallest integer greater than $a_{n-1}$ such that in $a_1,a_2,\dots,a_n$ there are no arithmetic progressions of length $p$. We say that a positive integer is a [i]ghost[/i] if it doesn’t appear in $S$. What is the smallest ghost that is not a multiple of $p$? [i]Proposed by Guerrero[/i]

Find all nonnegative integer solutions $(x,y,z,w)$ of the equation\[2^x\cdot3^y-5^z\cdot7^w=1.\]

Let $x,y,z$ be positive integers such that $\frac{x+1}{y}+\frac{y+1}{z}+\frac{z+1}{x}$ is an integer. Let $d$ be the greatest common divisor of $x,y$ and $z$. Prove that $d\le \sqrt[3]{xy+yz+zx}$.

A point $ P$ of integer coordinates in the Cartesian plane is said [i]visible[/i] if the segment $ OP$ does not contain any other points with integer coordinates (except its ends). Prove that for any $ n\in\mathbb{N}^*$ there exists a visible point $ P_{n}$, at distance larger than $ n$ from any other visible point. [b]Dan Schwarz[/b]