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

2016 Iran Team Selection Test, 3

Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.

2008 Brazil Team Selection Test, 1

Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$. [i]Author: Dan Brown, Canada[/i]

2023 Dutch BxMO TST, 5

Find all pairs of prime numbers $(p,q)$ for which \[2^p = 2^{q-2} + q!.\]

2007 Tournament Of Towns, 3

Anna's number is obtained by writing down $20$ consecutive positive integers, one after another in arbitrary order. Bob's number is obtained in the same way, but with $21$ consecutive positive integers. Can they obtain the same number?

1997 Federal Competition For Advanced Students, Part 2, 2

A positive integer $K$ is given. Define the sequence $(a_n)$ by $a_1 = 1$ and $a_n$ is the $n$-th positive integer greater than $a_{n-1}$ which is congruent to $n$ modulo $K$. [b](a)[/b] Find an explicit formula for $a_n$. [b](b)[/b] What is the result if $K = 2$?

2010 Baltic Way, 17

Find all positive integers $n$ such that the decimal representation of $n^2$ consists of odd digits only.

2012 Nordic, 3

Find the smallest positive integer $n$, such that there exist $n$ integers $x_1, x_2, \dots , x_n$ (not necessarily different), with $1\le x_k\le n$, $1\le k\le n$, and such that \[x_1 + x_2 + \cdots + x_n =\frac{n(n + 1)}{2},\quad\text{ and }x_1x_2 \cdots x_n = n!,\] but $\{x_1, x_2, \dots , x_n\} \ne \{1, 2, \dots , n\}$.

2003 China Western Mathematical Olympiad, 3

Let $ n$ be a given positive integer. Find the smallest positive integer $ u_n$ such that for any positive integer $ d$, in any $ u_n$ consecutive odd positive integers, the number of them that can be divided by $ d$ is not smaller than the number of odd integers among $ 1, 3, 5, \ldots, 2n \minus{} 1$ that can be divided by $ d$.

2004 Iran MO (3rd Round), 11

assume that ABC is acute traingle and AA' is median we extend it until it meets circumcircle at A". let $AP_a$ be a diameter of the circumcircle. the pependicular from A' to $AP_a$ meets the tangent to circumcircle at A" in the point $X_a$; we define $X_b,X_c$ similary . prove that $X_a,X_b,X_c$ are one a line.

2012 China Girls Math Olympiad, 3

Find all pairs $(a,b)$ of integers satisfying: there exists an integer $d \ge 2$ such that $a^n + b^n +1$ is divisible by $d$ for all positive integers $n$.

1971 IMO Longlists, 46

Natural numbers from $1$ to $99$ (not necessarily distinct) are written on $99$ cards. It is given that the sum of the numbers on any subset of cards (including the set of all cards) is not divisible by $100$. Show that all the cards contain the same number.

1983 IMO Longlists, 13

Let $p$ be a prime number and $a_1, a_2, \ldots, a_{(p+1)/2}$ different natural numbers less than or equal to $p.$ Prove that for each natural number $r$ less than or equal to $p$, there exist two numbers (perhaps equal) $a_i$ and $a_j$ such that \[p \equiv a_i a_j \pmod r.\]

2007 Purple Comet Problems, 21

What is the greatest positive integer $m$ such that $ n^2(1+n^2-n^4)\equiv 1\pmod{2^m} $ for all odd integers $n$?

Oliforum Contest II 2009, 3

Find all $ (x,y,z) \in \mathbb{Z}^3$ such that $ x^3 \minus{} 5x \equal{} 1728^{y}\cdot 1733^z \minus{} 17$. [i](Paolo Leonetti)[/i]

PEN O Problems, 12

Let $m$ and $n$ be positive integers. If $x_1$, $x_2$, $\cdots$, $x_m$ are positive integers whose arithmetic mean is less than $n+1$ and if $y_1$, $y_2$, $\cdots$, $y_n$ are positive integers whose arithmetic mean is less than $m+1$, prove that some sum of one or more $x$'s equals some sum of one or more $y$'s.

2003 Iran MO (3rd Round), 15

Assume $m\times n$ matrix which is filled with just 0, 1 and any two row differ in at least $n/2$ members, show that $m \leq 2n$. ( for example the diffrence of this two row is only in one index 110 100) [i]Edited by Myth[/i]

2009 Miklós Schweitzer, 2

Let $ p_1,\dots,p_k$ be prime numbers, and let $ S$ be the set of those integers whose all prime divisors are among $ p_1,\dots,p_k$. For a finite subset $ A$ of the integers let us denote by $ \mathcal G(A)$ the graph whose vertices are the elements of $ A$, and the edges are those pairs $ a,b\in A$ for which $ a \minus{} b\in S$. Does there exist for all $ m\geq 3$ an $ m$-element subset $ A$ of the integers such that (i) $ \mathcal G(A)$ is complete? (ii) $ \mathcal G(A)$ is connected, but all vertices have degree at most 2?

2001 Irish Math Olympiad, 1

Find the least positive integer $ a$ such that $ 2001$ divides $ 55^n\plus{}a \cdot 32^n$ for some odd $ n$.

2005 IberoAmerican, 3

Let $p > 3$ be a prime. Prove that if \[ \sum_{i=1 }^{p-1}{1\over i^p} = {n\over m}, \] with $\gdc(n,m) = 1$, then $p^3$ divides $n$.

2006 Finnish National High School Mathematics Competition, 3

The numbers $p, 4p^2 + 1,$ and $6p^2 + 1$ are primes. Determine $p.$

1989 APMO, 2

Prove that the equation \[ 6(6a^2 + 3b^2 + c^2) = 5n^2 \] has no solutions in integers except $a = b = c = n = 0$.

2014 Online Math Open Problems, 30

Let $p = 2^{16}+1$ be an odd prime. Define $H_n = 1+ \frac{1}{2} + \frac{1}{3} + ... + \frac{1}{n}$. Compute the remainder when \[ (p-1)! \sum_{n = 1}^{p-1} H_n \cdot 4^n \cdot \binom{2p-2n}{p-n} \] is divided by $p$. [i]Proposed by Yang Liu[/i]

2013 NIMO Problems, 2

How many integers $n$ are there such that $(n+1!)(n+2!)(n+3!)\cdots(n+2013!)$ is divisible by $210$ and $1 \le n \le 210$? [i]Proposed by Lewis Chen[/i]

2003 AMC 10, 16

What is the units digit of $ 13^{2003}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

1978 Romania Team Selection Test, 1

Show that for every natural number $ a\ge 3, $ there are infinitely many natural numbers $ n $ such that $ a^n\equiv 1\pmod n . $ Does this hold for $ n=2? $