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: 15460

1998 Israel National Olympiad, 2

Show that there is a multiple of $2^{1998}$ whose decimal representation consists only of the digits $1$ and $2$.

2005 Germany Team Selection Test, 1

Find the smallest positive integer $n$ with the following property: For any integer $m$ with $0 < m < 2004$, there exists an integer $k$ such that \[\frac{m}{2004}<\frac{k}{n}<\frac{m+1}{2005}.\]

2020 BMT Fall, 27

Estimate the number of $1$s in the hexadecimal representation of $2020!$. If $E$ is your estimate and $A$ is the correct answer, you will receive $\max (25 - 0.5|A - E|, 0)$ points, rounded to the nearest integer.

2003 Italy TST, 1

Find all triples of positive integers $(a,b,p)$ with $a,b$ positive integers and $p$ a prime number such that $2^a+p^b=19^a$

2016 All-Russian Olympiad, 5

Let $n$ be a positive integer and let $k_0,k_1, \dots,k_{2n}$ be nonzero integers such that $k_0+k_1 +\dots+k_{2n}\neq 0$. Is it always possible to a permutation $(a_0,a_1,\dots,a_{2n})$ of $(k_0,k_1,\dots,k_{2n})$ so that the equation \begin{align*} a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_0=0 \end{align*} has not integer roots?

2006 QEDMO 3rd, 10

Define a sequence $\left( a_{n}\right) _{n\in\mathbb{N}}$ by $a_{1}=a_{2}=a_{3}=1$ and $a_{n+1}=\dfrac{a_{n}^{2}+a_{n-1}^{2}}{a_{n-2}}$ for every integer $n\geq3$. Show that all elements $a_{i}$ of this sequence are integers. (L. J. Mordell and apparently Dana Scott, see also http://oeis.org/A064098)

1984 Putnam, A6

Let $n$ be a positive integer, and let $f(n)$ denote the last nonzero digit in the decimal expansion of $n!$. $(\text a)$ Show that if $a_1,a_2,\ldots,a_k$ are distinct nonnegative integers, then $f(5^{a_1}+5^{a_2}+\ldots+5^{a_k})$ depends only on the sum $a_1+a_2+\ldots+a_k$. $(\text b)$ Assuming part $(\text a)$, we can define $$g(s)=f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}),$$where $s=a_1+a_2+\ldots+a_k$. Find the least positive integer $p$ for which $$g(s)=g(s+p),\enspace\text{for all }s\ge1,$$or show that no such $p$ exists.

1973 Polish MO Finals, 5

Prove that every positive rational number $m/n$ can be represented as a sum of reciprocals of distinct positive integers.

2003 IMO Shortlist, 5

An integer $n$ is said to be [i]good[/i] if $|n|$ is not the square of an integer. Determine all integers $m$ with the following property: $m$ can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer. [i]Proposed by Hojoo Lee, Korea[/i]

2001 Switzerland Team Selection Test, 5

Let $a_1 < a_2 < ... < a_n$ be a sequence of natural numbers such that for $i < j$ the decimal representation of $a_i$ does not occur as the leftmost digits of the decimal representation of $a_j$ . (For example, $137$ and $13729$ cannot both occur in the sequence.) Prove that $\sum_{i=1}^n \frac{1}{a_i} \le 1+\frac12 +\frac13 +...+\frac19$ .

2009 Purple Comet Problems, 14

Let $ABCD$ be a trapezoid with $AB$ parallel to $CD, AB$ has length $1,$ and $CD$ has length $41.$ Let points $X$ and $Y$ lie on sides $AD$ and $BC,$ respectively, such that $XY$ is parallel to $AB$ and $CD,$ and $XY$ has length $31.$ Let $m$ and $n$ be two relatively prime positive integers such that the ratio of the area of $ABYX$ to the area of $CDXY$ is $\tfrac{m}{n}.$ Find $m+2n.$

1990 Austrian-Polish Competition, 4

Find all solutions in positive integers to: $$\begin{cases} x_1^4 + 14x_1x_2 + 1 = y_1^4 \\ x_2^4 + 14x_2x_3 + 1 = y_2^4 \\ ... \\ x_n^4 + 14x_nx_1 + 1 = y_n^4 \end{cases}$$

2020 MOAA, TO3

Consider the addition $\begin{tabular}{cccc} & O & N & E \\ + & T & W & O \\ \hline F & O & U & R \\ \end{tabular}$ where different letters represent different nonzero digits. What is the smallest possible value of the four-digit number $FOUR$?

2008 China National Olympiad, 3

Find all triples $(p,q,n)$ that satisfy \[q^{n+2} \equiv 3^{n+2} (\mod p^n) ,\quad p^{n+2} \equiv 3^{n+2} (\mod q^n)\] where $p,q$ are odd primes and $n$ is an positive integer.

2014 May Olympiad, 1

A natural number $N$ is [i]good [/i] if its digits are $1, 2$, or $3$ and all $2$-digit numbers are made up of digits located in consecutive positions of $N$ are distinct numbers. Is there a good number of $10$ digits? Of $11$ digits?

2013 IMAC Arhimede, 4

Let $p,n$ be positive integers, such that $p$ is prime and $p <n$. If $p$ divides $n + 1$ and $ \left(\left[\frac{n}{p}\right], (p-1)!\right) = 1$, then prove that $p\cdot \left[\frac{n}{p}\right]^2$ divides ${n \choose p} -\left[\frac{n}{p}\right]$ . (Here $[x]$ represents the integer part of the real number $x$.)

2013 ELMO Shortlist, 2

For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]

2009 Tournament Of Towns, 3

Find all positive integers $a$ and $b$ such that $(a + b^2)(b + a^2) = 2^m$ for some integer $m.$ [i](6 points)[/i]

1987 Kurschak Competition, 1

Find all quadruples of positive integers $(a,b,c,d)$ such that $a+b=cd$ and $c+d=ab$.

2013 Junior Balkan Team Selection Tests - Moldova, 1

Given are positive integers $a, b, c$ such that $a$ is odd, $b>c$, $a, b, c$ are coprime and $a(b-c) =2bc$. Prove that $abc$ is square

2017 China Team Selection Test, 4

An integer $n>1$ is given . Find the smallest positive number $m$ satisfying the following conditions: for any set $\{a,b\}$ $\subset \{1,2,\cdots,2n-1\}$ ,there are non-negative integers $ x, y$ ( not all zero) such that $2n|ax+by$ and $x+y\leq m.$

1997 All-Russian Olympiad, 1

Find all integer solutions of the equation $(x^2 - y^2)^2 = 1 + 16y$. [i]M. Sonkin[/i]

2015 India PRMO, 14

$14.$ If $3^x+2^y=985.$ and $3^x-2^y=473.$ What is the value of $xy ?$

2019 Azerbaijan BMO TST, 1

For positive integers $m$ and $n$, let $d(m, n)$ be the number of distinct primes that divide both $m$ and $n$. For instance, $d(60, 126) = d(2^2 \cdot 3 \cdot 5, 2 \cdot 3^2 \cdot 7) = 2.$ Does there exist a sequence $(a_n)$ of positive integers such that: [list] [*] $a_1 \geq 2018^{2018};$ [*] $a_m \leq a_n$ whenever $m \leq n$; [*] $d(m, n) = d(a_m, a_n)$ for all positive integers $m\neq n$? [/list] [i](Dominic Yeo, United Kingdom)[/i]

2021 Balkan MO Shortlist, N5

A natural number $n$ is given. Determine all $(n - 1)$-tuples of nonnegative integers $a_1, a_2, ..., a_{n - 1}$ such that $$\lfloor \frac{m}{2^n - 1}\rfloor + \lfloor \frac{2m + a_1}{2^n - 1}\rfloor + \lfloor \frac{2^2m + a_2}{2^n - 1}\rfloor + \lfloor \frac{2^3m + a_3}{2^n - 1}\rfloor + ... + \lfloor \frac{2^{n - 1}m + a_{n - 1}}{2^n - 1}\rfloor = m$$ holds for all $m \in \mathbb{Z}$.