Found problems: 2008
1985 IberoAmerican, 1
Find all the triples of integers $ (a, b,c)$ such that:
\[ \begin{array}{ccc}a\plus{}b\plus{}c &\equal{}& 24\\ a^{2}\plus{}b^{2}\plus{}c^{2}&\equal{}& 210\\ abc &\equal{}& 440\end{array}\]
2013 National Olympiad First Round, 18
What is remainder when the sum
\[\binom{2013}{1}+2013\binom{2013}{3} + 2013^2\binom{2013}{5} + \dots + 2013^{1006}\binom{2013}{2013}\] is divided by $41$?
$
\textbf{(A)}\ 20
\qquad\textbf{(B)}\ 14
\qquad\textbf{(C)}\ 7
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ \text{None}
$
1997 Baltic Way, 6
Find all triples $(a,b,c)$ of non-negative integers satisfying $a\ge b\ge c$ and
\[1\cdot a^3+9\cdot b^2+9\cdot c+7=1997 \]
PEN O Problems, 6
Let $S$ be a set of integers such that [list][*] there exist $a, b \in S$ with $\gcd(a, b)=\gcd(a-2,b-2)=1$, [*] if $x,y\in S$, then $x^2 -y\in S$.[/list] Prove that $S=\mathbb{Z}$.
1958 November Putnam, B2
Hi everybody!
I've an interesting problem!
Can you solve it?
Prove [b]Erdös-Ginzburg-Ziv Theorem[/b]: [i]"Among any $2n-1$ integers, there are some $n$ whose sum is divisible by $n$."[/i]
2009 China Team Selection Test, 3
Let $ f(x)$ be a $ n \minus{}$degree polynomial all of whose coefficients are equal to $ \pm 1$, and having $ x \equal{} 1$ as its $ m$ multiple root. If $ m\ge 2^k (k\ge 2,k\in N)$, then $ n\ge 2^{k \plus{} 1} \minus{} 1.$
2013 AMC 8, 1
Danica wants to arrange her model cars in rows with exactly 6 cars in each row. She now has 23 model cars. What is the smallest number of additional cars she must buy in order to be able to arrange all her cars this way?
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$
2010 Contests, 3
Let $a_0, a_1, \ldots, a_9$ and $b_1 , b_2, \ldots,b_9$ be positive integers such that $a_9<b_9$ and $a_k \neq b_k, 1 \leq k \leq 8.$ In a cash dispenser/automated teller machine/ATM there are $n\geq a_9$ levs (Bulgarian national currency) and for each $1 \leq i \leq 9$ we can take $a_i$ levs from the ATM (if in the bank there are at least $a_i$ levs). Immediately after that action the bank puts $b_i$ levs in the ATM or we take $a_0$ levs. If we take $a_0$ levs from the ATM the bank doesn’t put any money in the ATM. Find all possible positive integer values of $n$ such that after finite number of takings money from the ATM there will be no money in it.
2012 Kyrgyzstan National Olympiad, 6
The numbers $ 1, 2,\ldots, 50 $ are written on a blackboard. Each minute any two numbers are erased and their positive difference is written instead. At the end one number remains. Which values can take this number?
1998 Belarus Team Selection Test, 2
Let $ p$ be a prime number and $ f$ an integer polynomial of degree $ d$ such that $ f(0) = 0,f(1) = 1$ and $ f(n)$ is congruent to $ 0$ or $ 1$ modulo $ p$ for every integer $ n$. Prove that $ d\geq p - 1$.
1985 Federal Competition For Advanced Students, P2, 1
Determine all quadruples $ (a,b,c,d)$ of nonnegative integers satisfying:
$ a^2\plus{}b^2\plus{}c^2\plus{}d^2\equal{}a^2 b^2 c^2$.
2009 Portugal MO, 1
A circumference was divided in $n$ equal parts. On each of these parts one number from $1$ to $n$ was placed such that the distance between consecutive numbers is always the same. Numbers $11$, $4$ and $17$ were in consecutive positions. In how many parts was the circumference divided?
1987 IMO Longlists, 54
Let $n$ be a natural number. Solve in integers the equation
\[x^n + y^n = (x - y)^{n+1}.\]
2014 Online Math Open Problems, 22
Let $f(x)$ be a polynomial with integer coefficients such that $f(15) f(21) f(35) - 10$ is divisible by $105$. Given $f(-34) = 2014$ and $f(0) \ge 0$, find the smallest possible value of $f(0)$.
[i]Proposed by Michael Kural and Evan Chen[/i]
2002 Tournament Of Towns, 3
Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.
2014 Online Math Open Problems, 6
Let $L_n$ be the least common multiple of the integers $1,2,\dots,n$. For example, $L_{10} = 2{,}520$ and $L_{30} = 2{,}329{,}089{,}562{,}800$. Find the remainder when $L_{31}$ is divided by $100{,}000$.
[i]Proposed by Evan Chen[/i]
2013 Harvard-MIT Mathematics Tournament, 3
Find the rightmost non-zero digit of the expansion of $(20)(13!)$.
2002 Canada National Olympiad, 5
Let $\mathbb N = \{0,1,2,\ldots\}$. Determine all functions $f: \mathbb N \to \mathbb N$ such that
\[ xf(y) + yf(x) = (x+y) f(x^2+y^2) \]
for all $x$ and $y$ in $\mathbb N$.
2012 AIME Problems, 1
Find the number of ordered pairs of positive integer solutions $(m,n)$ to the equation $20m+12n=2012.$
2012 IberoAmerican, 3
Let $n$ to be a positive integer. Given a set $\{ a_1, a_2, \ldots, a_n \} $ of integers, where $a_i \in \{ 0, 1, 2, 3, \ldots, 2^n -1 \},$ $\forall i$, we associate to each of its subsets the sum of its elements; particularly, the empty subset has sum of its elements equal to $0$. If all of these sums have different remainders when divided by $2^n$, we say that $\{ a_1, a_2, \ldots, a_n \} $ is [i]$n$-complete[/i].
For each $n$, find the number of [i]$n$-complete[/i] sets.
2024 Abelkonkurransen Finale, 1b
Find all functions $f:\mathbb{Z} \to \mathbb{Z}$ such that the numbers
\[n, f(n),f(f(n)),\dots,f^{m-1}(n)\]
are distinct modulo $m$ for all integers $n,m$ with $m>1$.
(Here $f^k$ is defined by $f^0(n)=n$ and $f^{k+1}(n)=f(f^{k}(n))$ for $k \ge 0$.)
PEN D Problems, 6
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n}\] is eventually constant.
1977 Germany Team Selection Test, 3
Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$
2006 France Team Selection Test, 3
Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$.
[i]Proposed by Mohsen Jamali, Iran[/i]
2013 China Second Round Olympiad, 1
Let $n$ be a positive odd integer , $a_1,a_2,\cdots,a_n$ be any permutation of the positive integers $1,2,\cdots,n$ . Prove that :$(a_1-1)(a^2_2-2)(a^3_3-3)\cdots (a^n_n-n)$ is an even number.