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

2004 Iran MO (3rd Round), 30

Find all polynomials $ p\in\mathbb Z[x]$ such that $ (m,n)\equal{}1\Rightarrow (p(m),p(n))\equal{}1$

1953 Moscow Mathematical Olympiad, 244

Prove that $gcd (a + b, lcm(a, b)) = gcd (a, b)$ for any $a, b$.

2013 ELMO Shortlist, 1

Find all ordered triples of non-negative integers $(a,b,c)$ such that $a^2+2b+c$, $b^2+2c+a$, and $c^2+2a+b$ are all perfect squares. [i]Proposed by Matthew Babbitt[/i]

2021 Junior Balkan Team Selection Tests - Romania, P3

Let $p,q$ be positive integers. For any $a,b\in\mathbb{R}$ define the sets $$P(a)=\bigg\{a_n=a \ + \ n \ \cdot \ \frac{1}{p} : n\in\mathbb{N}\bigg\}\text{ and }Q(b)=\bigg\{b_n=b \ + \ n \ \cdot \ \frac{1}{q} : n\in\mathbb{N}\bigg\}.$$ The [i]distance[/i] between $P(a)$ and $Q(b)$ is the minimum value of $|x-y|$ as $x\in P(a), y\in Q(b)$. Find the maximum value of the distance between $P(a)$ and $Q(b)$ as $a,b\in\mathbb{R}$.

2025 Belarusian National Olympiad, 10.7

For every positive integer $n$ write all its divisors in increasing order: $1=d_1<d_2<\ldots<d_k=n$. Find all $n$ such that $2025 \cdot n=d_{20} \cdot d_{25}$. [i]I. Voronovich[/i]

2019 LIMIT Category A, Problem 9

Last digit of $2019^{2019}$ is

2012 AIME Problems, 11

Let $f_1(x) = \frac{2}{3}-\frac{3}{3x+1}$, and for $n \ge 2$, define $f_n(x) = f_1(f_{n-1} (x))$. The value of x that satisfies $f_{1001}(x) = x - 3$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

2010 Slovenia National Olympiad, 2

Let $a, b$ and $c$ be nonzero digits. Let $p$ be a prime number which divides the three digit numbers $\overline{abc}$ and $\overline{cba}.$ Show that $p$ divides at least one of the numbers $a+b+c, a-b+c$ and $a-c.$

2019 LIMIT Category B, Problem 2

The digit in unit place of $1!+2!+\ldots+99!$ is $\textbf{(A)}~3$ $\textbf{(B)}~0$ $\textbf{(C)}~1$ $\textbf{(D)}~7$

2014 Hanoi Open Mathematics Competitions, 11

Find all pairs of integers $(x,y)$ satisfying the following equality $8x^2y^2 + x^2 + y^2 = 10xy$

2022 Regional Olympiad of Mexico West, 5

Determine all positive integers $n$ such that $\lfloor \sqrt{n} \rfloor - 1$ divides $n + 1$ and $\lfloor \sqrt{n} \rfloor +2$ divides $ n + 4$.

2004 Italy TST, 2

A positive integer $n$ is said to be a [i]perfect power[/i] if $n=a^b$ for some integers $a,b$ with $b>1$. $(\text{a})$ Find $2004$ perfect powers in arithmetic progression. $(\text{b})$ Prove that perfect powers cannot form an infinite arithmetic progression.

2024 Brazil Team Selection Test, 4

Let $a,b,c,d$ be positive integers satisfying \[\frac{ab}{a+b}+\frac{cd}{c+d}=\frac{(a+b)(c+d)}{a+b+c+d}.\] Determine all possible values of $a+b+c+d$.

2021 Estonia Team Selection Test, 3

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

1966 Kurschak Competition, 2

Show that the $n$ digits after the decimal point in $(5 +\sqrt{26})^n$ are all equal.

2016 Ukraine Team Selection Test, 7

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

2010 District Olympiad, 1

a) Prove that one cannot assign to each vertex of a cube $ 8$ distinct numbers from the set $\{0, 1, 2, 3, . . . , 11, 12\}$ such that, for every edge, the sum of the two numbers assigned to its vertices is even. b) Prove that one can assign to each vertex of a cube $8$ distinct numbers from the set $\{0, 1, 2, 3, . . . , 11, 12\}$ such that, for every edge, the sum of the two numbers assigned to its vertices is divisible by $3$.

2015 District Olympiad, 2

Determine the real numbers $ a,b, $ such that $$ [ax+by]+[bx+ay]=(a+b)\cdot [x+y],\quad\forall x,y\in\mathbb{R} , $$ where $ [t] $ is the greatest integer smaller than $ t. $

2019 India IMO Training Camp, P2

Show that there do not exist natural numbers $a_1, a_2, \dots, a_{2018}$ such that the numbers \[ (a_1)^{2018}+a_2, (a_2)^{2018}+a_3, \dots, (a_{2018})^{2018}+a_1 \] are all powers of $5$ [i]Proposed by Tejaswi Navilarekallu[/i]

2014 India IMO Training Camp, 3

For integers $a,b$ we define $f((a,b))=(2a,b-a)$ if $a<b$ and $f((a,b))=(a-b,2b)$ if $a\geq b$. Given a natural number $n>1$ show that there exist natural numbers $m,k$ with $m<n$ such that $f^{k}((n,m))=(m,n)$,where $f^{k}(x)=f(f(f(...f(x))))$,$f$ being composed with itself $k$ times.

2024-IMOC, N5

Find all positive integers $n$ such that $$2^n+15|3^n+200$$

2012 China Northern MO, 3

Suppose $S= \{x|x=a^2+ab+b^2,a,b \in Z\}$. Prove that: (1) If $m \in S$, $3|m$ , then $\frac{m}{3} \in S$ (2) If $m,n \in S$ , then $mn\in S$.

2024-IMOC, N1

Proof that for every primes $p$, $q$ \[p^{q^2-q+1}+q^{p^2-p+1}-p-q\] is never a perfect square. [i]Proposed by chengbilly[/i]

2021 China Second Round, 3

If $n\ge 4,\ n\in\mathbb{N^*},\ n\mid (2^n-2)$. Prove that $\frac{2^n-2}{n}$ is not a prime number.

2024 Kyiv City MO Round 2, Problem 2

Mykhailo wants to arrange all positive integers from $1$ to $2024$ in a circle so that each number is used exactly once and for any three consecutive numbers $a, b, c$ the number $a + c$ is divisible by $b + 1$. Can he do it? [i]Proposed by Fedir Yudin[/i]