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

2024/2025 TOURNAMENT OF TOWNS, P5

Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.

2014 HMNT, 3

Compute the greatest common divisor of $4^8 - 1$ and $8^{12} - 1$.

1999 Junior Balkan MO, 2

For each nonnegative integer $n$ we define $A_n = 2^{3n}+3^{6n+2}+5^{6n+2}$. Find the greatest common divisor of the numbers $A_0,A_1,\ldots, A_{1999}$. [i]Romania[/i]

2007 All-Russian Olympiad Regional Round, 10.7

Given an integer $ n>6$. Consider those integers $ k\in (n(n\minus{}1),n^{2})$ which are coprime with $ n$. Prove that the greatest common divisor of the considered numbers is $ 1$.

1970 Regional Competition For Advanced Students, 4

Find all real solutions of the following set of equations: \[72x^3+4xy^2=11y^3\] \[27x^5-45x^4y-10x^2y^3=\frac{-143}{32}y^5\]

2014 India Regional Mathematical Olympiad, 3

let $m,n$ be natural number with $m>n$ . find all such pairs of $(m,n) $ such that $gcd(n+1,m+1)=gcd(n+2,m+2) =..........=gcd(m, 2m-n) = 1 $

2011 South East Mathematical Olympiad, 2

If positive integers, $a,b,c$ are pair-wise co-prime, and, \[\ a^2|(b^3+c^3), b^2|(a^3+c^3), c^2|(a^3+b^3) \] find $a,b,$ and $c$

Oliforum Contest I 2008, 2

Find all non-negative integers $ x,y,z$ such that $ 5^x \plus{} 7^y \equal{} 2^z$. :lol: ([i]Daniel Kohen, University of Buenos Aires - Buenos Aires,Argentina[/i])

2008 Indonesia TST, 3

Let $n$ be an arbitrary positive integer. (a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$. (b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).

2004 IMO Shortlist, 2

The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\] a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$. b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution. c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.

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$.

2007 Indonesia TST, 4

Determine all pairs $ (n,p)$ of positive integers, where $ p$ is prime, such that $ 3^p\minus{}np\equal{}n\plus{}p$.

2023 Regional Competition For Advanced Students, 4

Determine all pairs $(x, y)$ of positive integers such that for $d = gcd(x, y)$ the equation $$xyd = x + y + d^2$$ holds. [i](Walther Janous)[/i]

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$.

2019 BMT Spring, 17

Let $C$ be a circle of radius $1$ and $O$ its center. Let $\overline{AB}$ be a chord of the circle and $D$ a point on $\overline{AB}$ such that $OD =\frac{\sqrt2}{2}$ such that $D$ is closer to $ A$ than it is to $ B$, and if the perpendicular line at $D$ with respect to $\overline{AB}$ intersects the circle at $E $and $F$, $AD = DE$. The area of the region of the circle enclosed by $\overline{AD}$, $\overline{DE}$, and the minor arc $AE$ may be expressed as $\frac{a + b\sqrt{c} + d\pi}{e}$ where $a, b, c, d, e$ are integers, gcd $(a, b, d, e) = 1$, and $c$ is squarefree. Find $a + b + c + d + e$

2007 Germany Team Selection Test, 3

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

2018 lberoAmerican, 4

A set $X$ of positive integers is said to be [i]iberic[/i] if $X$ is a subset of $\{2, 3, \dots, 2018\}$, and whenever $m, n$ are both in $X$, $\gcd(m, n)$ is also in $X$. An iberic set is said to be [i]olympic[/i] if it is not properly contained in any other iberic set. Find all olympic iberic sets that contain the number $33$.

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$

2011 Canadian Mathematical Olympiad Qualification Repechage, 8

Determine all pairs $(n,m)$ of positive integers for which there exists an infinite sequence $\{x_k\}$ of $0$'s and $1$'s with the properties that if $x_i=0$ then $x_{i+m}=1$ and if $x_i = 1$ then $x_{i+n} = 0.$

2008 Indonesia TST, 3

Let $n$ be an arbitrary positive integer. (a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$. (b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).

1996 Dutch Mathematical Olympiad, 5

For the positive integers $x , y$ and $z$ apply $\frac{1}{x}+\frac{1}{y}=\frac{1}{z}$ . Prove that if the three numbers $x , y,$ and $z$ have no common divisor greater than $1$, $x + y$ is the square of an integer.

1995 Korea National Olympiad, Day 2

Let $a,b$ be integers and $p$ be a prime number such that: (i) $p$ is the greatest common divisor of $a$ and $b$; (ii) $p^2$ divides $a$. Prove that the polynomial $x^{n+2}+ax^{n+1}+bx^{n}+a+b$ cannot be decomposed into the product of two polynomials with integer coefficients and degree greater than $1$.

2017 Brazil National Olympiad, 2.

[b]2.[/b] Let $n \geq 3$ be an integer. Prove that for all integers $k$, with $1 \leq k \leq \binom{n}{2}$, there exists a set $A$ with $n$ distinct positive integer elements such that the set $B = \{\gcd(x, y): x, y \in A, x \neq y \}$ (gotten from the greatest common divisor of all pairs of distinct elements from $A$) contains exactly $k$ distinct elements.

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$.)

1998 USAMTS Problems, 2

Prove that there are infinitely many ordered triples of positive integers $(a,b,c)$ such that the greatest common divisor of $a,b,$ and $c$ is $1$, and the sum $a^2b^2+b^2c^2+c^2a^2$ is the square of an integer.