Let $a, b, c, d, e$ be distinct positive integers such that $a^4 + b^4 = c^4 + d^4 = e^5$. Show that $ac + bd$ is a composite number.
There is a prime number $p$ such that $16p+1$ is the cube of a positive integer. Find $p$.
Let $N$ be the least positive integer that is both $22$ percent less than one integer and $16$ percent greater than another integer. Find the remainder when $N$ is divided by $1000$.
Show that, if $a,b$ are positive integers satisfying $4(ab-1)\mid (4a^2-1)$, then $a=b$
Show that $2x^2 - 5y^2 = 7$ has no integer solution.
Let positive integer $d$ is a divisor of $2n^2$, where $n$ is also a positive integer. Prove $(n^2 + d)$ cannot be a perfect square.
Prove there exist infinite number of positive integer $a$ such that for any positive integer $n$, $n^4 + a$ is not a prime number.
What is the smallest positive integer than can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers?
Find all positive integer $n$ such that $(3^{2n+1} -2^{2n+1}- 6^n)$ is a composite number.
Find $n$ different positive integers such that any two of them are relatively prime, but the sum of any $k$ ($k < n$) of them is a composite number.
Let $B$ be the set of all binary integers that can be written using exactly $5$ zeros and $8$ ones where leading zeros are allowed. If all possible subtractions are performed in which one element of $B$ is subtracted from another, find the number of times the answer $1$ is obtained.
Let $S$ be the increasing sequence of positive integers whose binary representation has exactly $8$ ones. Find the $1000^{th}$ number in $S$ (in base $10$).
Find the number of positive integers $m$ for which there exist nonnegative integers $x_0$, $x_1$ , $\dots$ , $x_{2011}$ such that \[m^{x_0} = \sum_{k = 1}^{2011} m^{x_k}.\]
Joe uses 9 different digits out of 0 to 9 to create a 2-digit number, a 3-digit number, and a 4-digit number. He \ffinds the sum of these three numbers is 2014. Do you know which digit is not used?
Let $N$ be the greatest integer multiple of $36$ all of whose digits are even and no two of whose digits are the same. Find the remainder when $N$ is divided by $1000$.
Let $K$ be the product of all factors $(b-a)$ (not necessarily distinct) where $a$ and $b$ are integers satisfying $1\le a < b \le 20$. Find the greatest positive integer $n$ such that $2^n$ divides $K$.
True or false: Let $\tau({n})$ denotes the number of positive divisors that $n$ has. Then $$\tau({1}) + \tau({2}) +\tau({3}) +\cdots + \tau({2015})$$ is an odd number.
Is it possible to equally divide the set {$1, 2, 3, \cdots, 972$} into 12 non-intersect subsets so that each subset has exactly 81 elements, and the sums of those subsets are all equal?
Eleven members of the Middle School Math Club each paid the same amount for a guest speaker to talk about problem solving at their math club meeting. They paid their guest speaker \$ $\underline{1}\underline{A}\underline{2}$. What is the missing digit A of this 3-digit number?
What is the minimum number of digits to the right of the decimal point needed to express the fraction $\frac{123456789}{2^{26}\cdot 5^4}$ as a decimal?
Back in 1930, Tillie had to memorize her multiplication facts from $0 \times 0$ to $12 \times 12$. The multiplication table she was given had rows and columns labeled with the factors, and the products formed the body of the table. To the nearest hundredth, what fraction of the numbers in the body of the table are odd?
For every composite positive integer $n$, define $r(n)$ to be the sum of the factors in the prime factorization of $n$. For example, $r(50) = 12$ because the prime factorization of $50$ is $2 \times 5^{2}$, and $2 + 5 + 5 = 12$. What is the range of the function $r$, $\{r(n): n \text{ is a composite positive integer}\}$ ?
For how many positive integers $n$ is $\frac{n}{30-n}$ also a positive integer?
Let $S$ be the set of positive integers $n$ for which $\tfrac{1}{n}$ has the repeating decimal representation $0.\overline{ab} = 0.ababab\cdots,$ with $a$ and $b$ different digits. What is the sum of the elements of $S$?
A group of $12$ pirates agree to divide a treasure chest of gold coins among themselves as follows. The $k^\text{th}$ pirate to take a share takes $\frac{k}{12}$ of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the $12^{\text{th}}$ pirate receive?
PolynomialAndEquation BasicCountingPrinciple NumberTheoryBasic OddEvenAnalysis SquareNumber AlternativeBase
AMC8 AMC10/12 AIME IMO