Olympiad problems

2008 Brazil Team Selection Test, 4

Find all odd integers $n$ for which $\frac{2^{\phi (n)}-1}{n}$ is a perfect square.

2023 Brazil National Olympiad, 5

An integer $n \geq 3$ is [i]fabulous[/i] when there exists an integer $a$ with $2 \leq a \leq n - 1$ for which $a^n - a$ is divisible by $n$. Find all the [i]fabulous[/i] integers.

fermat's little theorem number theory euler s phi function Chinese remainder theorem Fermat's little theorem modular arithmetic

VMEO III 2006 Shortlist, N13

Prove the following two inequalities: 1) If $n > 49$, then exist positive integers $a, b > 1$ such that $a+b=n$ and $$\frac{\phi (a)}{a}+\frac{\phi (b)}{b}<1$$ 2) If $n > 4$, then exist integer integers $a, b > 1$ such that $a+b=n$ and $$\frac{\phi (a)}{a}+\frac{\phi (b)}{b}>1$$

inequalities number theory euler s phi function euler totient function

2022 Durer Math Competition Finals, 1

Let $c \ge 2$ be a fixed integer. Let $a_1 = c$ and for all $n \ge 2$ let $a_n = c \cdot \phi (a_{n-1})$. What are the numbers $c$ for which sequence $(a_n)$ will be bounded? $\phi$ denotes Euler’s Phi Function, meaning that $\phi (n)$ gives the number of integers within the set $\{1, 2, . . . , n\}$ that are relative primes to $n$. We call a sequence $(x_n)$ bounded if there exist a constant $D$ such that $|x_n| < D$ for all positive integers $n$.

sequence phi function number theory euler s phi function algebra factorization prime factorization sequences

2020 Peru Cono Sur TST., P4

Find all odd integers $n$ for which $\frac{2^{\phi (n)}-1}{n}$ is a perfect square.

phi function number theory euler s phi function perfect square perfect squares

2020 Peru Iberoamerican Team Selection Test, P4

Find all odd integers $n$ for which $\frac{2^{\phi (n)}-1}{n}$ is a perfect square.

phi function number theory euler s phi function perfect square perfect squares

2020 International Zhautykov Olympiad, 1

Given natural number n such that, for any natural $a,b$ number $2^a3^b+1$ is not divisible by $n$.Prove that $2^c+3^d$ is not divisible by $n$ for any natural $c$ and $d$

order zhautykov number theory euler s phi function prime number modular arithmetic prime numbers proof by contradiction

Dumbest FE I ever created, 1.

Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $m$ and $n$, $$ m^{\phi(n)}+n^{\phi(m)} \mid f(m)^n + f(n)^m$$

function functional equation number theory euler s phi function divisibility functional equations