This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 25

Given $2n$ natural numbers, so that the average arithmetic of those $2n$ number is $2$. If all the number is not more than $2n$. Prove we can divide those $2n$ numbers into $2$ sets, so that the sum of each set to be the same.
Determine all natural numbers $ \overline{ab} $ with $ a<b $ which are equal with the sum of all the natural numbers between $ a $ and $ b, $ inclusively.
Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]
Pasha and Vova play the following game, making moves in turn; Pasha moves first. Initially, they have a large piece of plasticine. By a move, Pasha cuts one of the existing pieces into three(of arbitrary sizes), and Vova merges two existing pieces into one. Pasha wins if at some point there appear to be $100$ pieces of equal weights. Can Vova prevent Pasha's win?
Let $S = \{1, 2, 3, \ldots , 2046, 2047, 2048\}$. Two subsets $A$ and $B$ of $S$ are said to be [i]friends[/i] if the following conditions are true: [list] [*] They do not share any elements. [*] They both have the same number of elements. [*] The product of all elements from $A$ equals the product of all elements from $B$. [/list] Prove that there are two subsets of $S$ that are [i]friends[/i] such that each one of them contains at least $738$ elements.
Without using a calculator, determine which number is greater: $17^{24}$ or $31^{19}$
Show that the number $ 7^{100}-3^{100} $ has $ 85 $ digits and find its last $ 4 $ ones.
$ \frac{10^7}{5 \times 10^4}\equal{}$ \[ \textbf{(A)}\ .002 \qquad \textbf{(B)}\ .2 \qquad \textbf{(C)}\ 20 \qquad \textbf{(D)}\ 200 \qquad \textbf{(E)}\ 2000 \]
Find the value of \[+1+2+3-4-5-6+7+8+9-10-11-12+\cdots -2020,\] where the sign alternates between $+$ and $-$ after every three numbers.
On a blackboard there are written the numbers $ 11 $ and $ 13. $ One [i]step[/i] means to sum two written numbers and write it. Show that: [b]a)[/b] after any number of steps, the number $ 86 $ will not be written. [b]b)[/b] after some number of steps, the number $ 2015 $ may be written.
[b]a)[/b] Show that the number $ \sqrt{9-\sqrt{77}}\cdot\sqrt {2}\cdot\left(\sqrt{11}-\sqrt{7}\right)\cdot\left( 9+\sqrt{77}\right) $ is natural. [b]b)[/b] Consider two real numbers $ x,y $ such that $ xy=6 $ and $ x,y>2. $ Show that $ x+y<5. $
Find the number of perfect squares of five digits whose last two digits are equal. [i]Gheorghe Iurea[/i]
Carlos went to a sports store to buy running shoes. Running shoes were on sale, with prices reduced by 20% on every pair of shoes. Carlos also knew that he had to pay a 7.5% sales tax on the discounted price. He had 43 dollars. What is the original (before discount) price of the most expensive shoes he could afford to buy? A)$46$ B)$50$ C)$48$ D)$47$ E)$49$
Prove that $$1\cdot 4 + 2\cdot 5 + 3\cdot 6 + \cdots + n(n+3) = \frac{n(n+1)(n+5)}{3}$$ for all positive integer $n$.
A and B are friends at a summer school. When B asks A for his address, he answers: "My house is on XYZ street, and my house number is a 3-digit number with distinct digits, and if you permute its digits, you will have other 5 numbers. The interesting thing is that the sum of these 5 numbers is exactly 2017. That's all.". After a while, B can determine A's house number. And you, can you find his house number?
Carlos went to a sports store to buy running shoes. Running shoes were on sale, with prices reduced by 20% on every pair of shoes. Carlos also knew that he had to pay a 7.5% sales tax on the discounted price. He had 43 dollars. What is the original (before discount) price of the most expensive shoes he could afford to buy? A)$46$ B)$50$ C)$48$ D)$47$ E)$49$
[b]a)[/b] Show that the three last digits of $ 1038^2 $ are equal with $ 4. $ [b]b)[/b] Show that there are infinitely many perfect squares whose last three digits are equal with $ 4. $ [b]c)[/b] Prove that there is no perfect square whose last four digits are equal to $ 4. $
Pasha and Vova play the following game, making moves in turn; Pasha moves first. Initially, they have a large piece of plasticine. By a move, Pasha cuts one of the existing pieces into three(of arbitrary sizes), and Vova merges two existing pieces into one. Pasha wins if at some point there appear to be $100$ pieces of equal weights. Can Vova prevent Pasha's win?
Determine the perfect squares $ \overline{aabcd} $ of five digits such that $ \overline{dcbaa} $ is a perfect square of five digits.
$1.$ A man walks a certain distance and rides back in $3\frac{3}{4};$ he could ride both ways in $2\frac{1}{2}$ hours. How many hours would it take him to walk both ways $?$
Find the largest positive integer with the property that each digit apart from the first and the last one is smaller than the arithmetic mean of her neighbours.
For any natural number $ n, $ denote $ x_n $ as being the number of natural numbers of $ n $ digits that are divisible by $ 4 $ and formed only with the digits $ 0,1,2 $ or $ 6. $ [b]a)[/b] Calculate $ x_1,x_2,x_3,x_4. $ [b]b)[/b] Find the natural number $ m $ such that $$ 1+\left\lfloor \frac{x_2}{x_1}\right\rfloor +\left\lfloor \frac{x_3}{x_2}\right\rfloor +\left\lfloor \frac{x_4}{x_3}\right\rfloor +\cdots +\left\lfloor \frac{x_{m+1}}{x_m}\right\rfloor =2016 , $$ where $ \lfloor\rfloor $ is the usual integer part.
Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]
Determine all pairs of natural numbers, the components of which have the same number of digits and the double of their product is equal with the number formed by concatenating them.
Let be two natural numbers $ m\ge n $ and a nonnegative integer $ r<2^n. $ How many numbers of $ m $ digits, each digit being either the number $ 1 $ or $ 2, $ are there whose residue modulo $ 2^n $ is $ r? $ [i]Dorel Miheț[/i]