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

1996 Bosnia and Herzegovina Team Selection Test, 2

$a)$ Let $m$ and $n$ be positive integers. If $m>1$ prove that $ n \mid \phi(m^n-1)$ where $\phi$ is Euler function $b)$ Prove that number of elements in sequence $1,2,...,n$ $(n \in \mathbb{N})$, which greatest common divisor with $n$ is $d$, is $\phi\left(\frac{n}{d}\right)$

2008 Indonesia MO, 3

Find all natural number which can be expressed in $ \frac{a\plus{}b}{c}\plus{}\frac{b\plus{}c}{a}\plus{}\frac{c\plus{}a}{b}$ where $ a,b,c\in \mathbb{N}$ satisfy $ \gcd(a,b)\equal{}\gcd(b,c)\equal{}\gcd(c,a)\equal{}1$

2016 Dutch BxMO TST, 1

For a positive integer $n$ that is not a power of two, we de fine $t(n)$ as the greatest odd divisor of $n$ and $r(n)$ as the smallest positive odd divisor of $n$ unequal to $1$. Determine all positive integers $n$ that are not a power of two and for which we have $n = 3t(n) + 5r(n)$.

2012 Dutch BxMO/EGMO TST, 5

Let $A$ be a set of positive integers having the following property: for each positive integer $n$ exactly one of the three numbers $n, 2n$ and $3n$ is an element of $A$. Furthermore, it is given that $2 \in A$. Prove that $13824 \notin A$.

2014 PUMaC Number Theory A, 7

Find the number of positive integers $n \le 2014$ such that there exists integer $x$ that satisfies the condition that $\frac{x+n}{x-n}$ is an odd perfect square.

2021 Regional Olympiad of Mexico Southeast, 2

Let $n\geq 2021$. Let $a_1<a_2<\cdots<a_n$ an arithmetic sequence such that $a_1>2021$ and $a_i$ is a prime number for all $1\leq i\leq n$. Prove that for all $p$ prime with $p<2021, p$ divides the diference of the arithmetic sequence.

2024 ELMO Shortlist, N3

Given a positive integer $k$, find all polynomials $P$ of degree $k$ with integer coefficients such that for all positive integers $n$ where all of $P(n)$, $P(2024n)$, $P(2024^2n)$ are nonzero, we have $$\frac{\gcd(P(2024n), P(2024^2n))}{\gcd(P(n), P(2024n))}=2024^k.$$ [i]Allen Wang[/i]

2003 Moldova National Olympiad, 8.5

$\text{Prove that each integer}$ $n\ge3$ can be written as a sum of some consecutive natural numbers only and only if it isn't a power of 2

2002 China Girls Math Olympiad, 6

Find all pairs of positive integers $ (x,y)$ such that \[ x^y \equal{} y^{x \minus{} y}. \] [i]Albania[/i]

2025 Greece National Olympiad, 4

Prove that no perfect cube is of the form $y^2+108$ where $y \in \mathbb{Z}$.

1999 Poland - Second Round, 6

Suppose that $a_1,a_2,...,a_n$ are integers such that $a_1 +2^ia_2 +3^ia_3 +...+n^ia_n = 0$ for $i = 1,2,...,k -1$, where $k \ge 2$ is a given integer. Prove that $a_1+2^ka_2+3^ka_3+...+n^ka_n$ is divisible by $k!$.

2019 Dutch IMO TST, 3

Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.

2023 Dutch Mathematical Olympiad, 3

Felix chooses a positive integer as the starting number and writes it on the board. He then repeats the next step: he replaces the number $n$ on the board by $\frac12n$ if $n$ is even and by $n^2 + 3$ if $n$ is odd. For how many choices of starting numbers below $2023$ will Felix never write a number of more than four digits on the board?

2021 Lusophon Mathematical Olympiad, 1

Juca has decided to call all positive integers with 8 digits as $sextalternados$ if it is a multiple of 30 and its consecutive digits have different parity. At the same time, Carlos decided to classify all $sextalternados$ that are multiples of 12 as $super sextalternados$. a) Show that $super sextalternados$ numbers don't exist. b) Find the smallest $sextalternado$ number.

2010 Abels Math Contest (Norwegian MO) Final, 4b

Let $n > 2$ be an integer. Show that it is possible to choose $n$ points in the plane, not all of them lying on the same line, such that the distance between any pair of points is an integer (that is, $\sqrt{(x_1 -x_2)^2 +(y_1 -y_2)^2}$ is an integer for all pairs $(x_1, y_1)$ and $(x_2, y_2)$ of points).

2017 Polish Junior Math Olympiad First Round, 5.

Let $a$ and $b$ be the positive integers. Show that at least one of the numbers $a$, $b$, $a+b$ can be expressed as the difference of the squares of two integers.

1998 USAMTS Problems, 2

For a nonzero integer $i$, the exponent of $2$ in the prime factorization of $i$ is called $ord_2 (i)$. For example, $ord_2(9)=0$ since $9$ is odd, and $ord_2(28)=2$ since $28=2^2\times7$. The numbers $3^n-1$ for $n=1,2,3,\ldots$ are all even so $ord_2(3^n-1)>0$ for $n>0$. a) For which positive integers $n$ is $ord_2(3^n-1) = 1$? b) For which positive integers $n$ is $ord_2(3^n-1) = 2$? c) For which positive integers $n$ is $ord_2(3^n-1) = 3$? Prove your answers.

1998 Belarus Team Selection Test, 1

Let $S(n)$ be the sum of all different natural divisors of odd natural number $n> 1$ (including $n$ and $1$). Prove that $(S(n))^3 <n^4$.

2024 Indonesia TST, N

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for every prime number $p$ and natural number $x$, $$\{ x,f(x),\cdots f^{p-1}(x) \} $$ is a complete residue system modulo $p$. With $f^{k+1}(x)=f(f^k(x))$ for every natural number $k$ and $f^1(x)=f(x)$. [i]Proposed by IndoMathXdZ[/i]

1995 China Team Selection Test, 1

Find the smallest prime number $p$ that cannot be represented in the form $|3^{a} - 2^{b}|$, where $a$ and $b$ are non-negative integers.

2007 Polish MO Finals, 6

6. Sequence $a_{0}, a_{1}, a_{2},...$ is determined by $a_{0}=-1$ and $a_{n}+\frac{a_{n-1}}{2}+\frac{a_{n-2}}{3}+...+\frac{a_{1}}{n}+\frac{a_{0}}{n+1}=0$ for $n\geq 1$ Prove that $a_{n}>0$ for $n\geq 1$

1987 IMO, 3

Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.

2011 Princeton University Math Competition, A8

Calculate the sum of the coordinates of all pairs of positive integers $(n, k)$ such that $k\equiv 0, 3\pmod 4$, $n > k$, and $\displaystyle\sum^n_{i = k + 1} i^3 = (96^2\cdot3 - 1)\displaystyle\left(\sum^k_{i = 1} i\right)^2 + 48^2$

2002 China Team Selection Test, 3

Let $ p_i \geq 2$, $ i \equal{} 1,2, \cdots n$ be $ n$ integers such that any two of them are relatively prime. Let: \[ P \equal{} \{ x \equal{} \sum_{i \equal{} 1}^{n} x_i \prod_{j \equal{} 1, j \neq i}^{n} p_j \mid x_i \text{is a non \minus{} negative integer}, i \equal{} 1,2, \cdots n \} \] Prove that the biggest integer $ M$ such that $ M \not\in P$ is greater than $ \displaystyle \frac {n \minus{} 2}{2} \cdot \prod_{i \equal{} 1}^{n} p_i$, and also find $ M$.

2018 Romanian Master of Mathematics, 4

Let $a,b,c,d$ be positive integers such that $ad \neq bc$ and $gcd(a,b,c,d)=1$. Let $S$ be the set of values attained by $\gcd(an+b,cn+d)$ as $n$ runs through the positive integers. Show that $S$ is the set of all positive divisors of some positive integer.