Olympiad problems

2010 Indonesia TST, 3

For every natural number $ n $, define $ s(n) $ as the smallest natural number so that for every natural number $ a $ relatively prime to $n$, this equation holds: \[ a^{s(n)} \equiv 1 (mod n) \] Find all natural numbers $ n $ such that $ s(n) = 2010 $

2011 Nordic, 4

Tags: relatively prime , number theory , greatest common divisor

Show that for any integer $n \ge 2$ the sum of the fractions $\frac{1}{ab}$, where $a$ and $b$ are relatively prime positive integers such that $a < b \le n$ and $a+b > n$, equals $\frac{1}{2}$. (Integers $a$ and $b$ are called relatively prime if the greatest common divisor of $a$ and $b$ is $1$.)

2013 Iran MO (3rd Round), 1

Tags: modular inverse , multiplicative order , relatively prime , modular arithmetic , number theory

Let $p$ a prime number and $d$ a divisor of $p-1$. Find the product of elements in $\mathbb Z_p$ with order $d$. ($\mod p$). (10 points)

2020 Switzerland Team Selection Test, 4

Tags: relatively prime , number theory , divisor

Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.

2015 Postal Coaching, Problem 3

Tags: relatively prime , number theory

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

2000 All-Russian Olympiad, 8

Tags: relatively prime , greatest common divisor , modular arithmetic , number theory

One hundred natural numbers whose greatest common divisor is $1$ are arranged around a circle. An allowed operation is to add to a number the greatest common divisor of its two neighhbors. Prove that we can make all the numbers pairwise copirme in a finite number of moves.

2015 Romanian Master of Mathematics, 1

Tags: relatively prime , number theory

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

1988 IMO Shortlist, 22

Tags: quadratic , equation , relatively prime , number theory

Let $ p$ be the product of two consecutive integers greater than 2. Show that there are no integers $ x_1, x_2, \ldots, x_p$ satisfying the equation \[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1 \] [b]OR[/b] Show that there are only two values of $ p$ for which there are integers $ x_1, x_2, \ldots, x_p$ satisfying \[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1 \]

2007 Germany Team Selection Test, 3

Tags: relatively prime , number theory , greatest common divisor

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]

2019 PUMaC Algebra B, 4

Tags: relatively prime , number theory , algebra

Let $f(x)=x^2+4x+2$. Let $r$ be the difference between the largest and smallest real solutions of the equation $f(f(f(f(x))))=0$. Then $r=a^{\frac{p}{q}}$ for some positive integers $a$, $p$, $q$ so $a$ is square-free and $p,q$ are relatively prime positive integers. Compute $a+p+q$.

1990 USAMO, 3

Tags: number theory , relatively prime , modular arithmetic , greatest common divisor , combinatorics

Suppose that necklace $\, A \,$ has 14 beads and necklace $\, B \,$ has 19. Prove that for any odd integer $n \geq 1$, there is a way to number each of the 33 beads with an integer from the sequence \[ \{ n, n+1, n+2, \dots, n+32 \} \] so that each integer is used once, and adjacent beads correspond to relatively prime integers. (Here a ``necklace'' is viewed as a circle in which each bead is adjacent to two other beads.)

2020 AMC 12/AHSME, 25

Tags: relatively prime , number theory

The number $a = \tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, has the property that the sum of all real numbers $x$ satisfying $$\lfloor x \rfloor \cdot \{x\} = a \cdot x^2$$ is $420$, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$ and $\{x\} = x - \lfloor x \rfloor$ denotes the fractional part of $x$. What is $p + q?$ $\textbf{(A) } 245 \qquad \textbf{(B) } 593 \qquad \textbf{(C) } 929 \qquad \textbf{(D) } 1331 \qquad \textbf{(E) } 1332$

1997 AIME Problems, 4

Tags: relatively prime , pythagorean theorem , geometry , number theory

Circles of radii 5, 5, 8, and $m/n$ are mutually externally tangent, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

2007 Korea National Olympiad, 4

Tags: prime number , induction , relatively prime , inequalities , number theory

For all positive integer $ n\geq 2$, prove that product of all prime numbers less or equal than $ n$ is smaller than $ 4^{n}$.

1994 AIME Problems, 9

Tags: recursion , relatively prime , probability , number theory

A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$

PEN H Problems, 12

Tags: diophantine equation , number theory , relatively prime

Find all $(x,y,z) \in {\mathbb{N}}^3$ such that $x^{4}-y^{4}=z^{2}$.

1993 Greece National Olympiad, 15

Tags: relatively prime , pythagorean theorem , geometry , number theory

Let $\overline{CH}$ be an altitude of $\triangle ABC$. Let $R$ and $S$ be the points where the circles inscribed in the triangles $ACH$ and $BCH$ are tangent to $\overline{CH}$. If $AB = 1995$, $AC = 1994$, and $BC = 1993$, then $RS$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime integers. Find $m + n$

1983 Tournament Of Towns, (045) 2

Tags: sum , relatively prime , number theory

Find all natural numbers $k$ which can be represented as the sum of two relatively prime numbers not equal to $1$.

2020 BMT Fall, 21

Tags: relatively prime , number theory

Let $P$ be the probability that the product of $2020$ real numbers chosen independently and uniformly at random from the interval $[-1, 2]$ is positive. The value of $2P - 1$ can be written in the form $\left(\frac{m}{n}\right)^b$ , where $m, n$ and $b$ are positive integers such that $m$ and $n$ are relatively prime and $b$ is as large as possible. Compute $m + n + b$.

2007 ITest, 48

Tags: complex analysis , relatively prime , trigonometry , function , number theory

Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the maximum possible value of \[\sin^2x_1+\sin^2x_2+\sin^2x_3+\cdots+\sin^2x_{2007},\] where, for $1\leq i\leq 2007$, $x_i$ is a nonnegative real number, and \[x_1+x_2+x_3+\cdots+x_{2007}=\pi.\] Find the value of $a+b$.

2014 AIME Problems, 6

Tags: conditional probability , relatively prime , probability

Charles has two six-sided dice. One of the dice is fair, and the other die is biased so that it comes up six with probability $\tfrac23,$ and each of the other five sides has probability $\tfrac{1}{15}.$ Charles chooses one of the two dice at random and rolls it three times. Given that the first two rolls are both sixes, the probability that the third roll will also be a six is $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

1995 Baltic Way, 3

Tags: number theory , relatively prime

The positive integers $a,b,c$ are pairwise relatively prime, $a$ and $c$ are odd and the numbers satisfy the equation $a^2+b^2=c^2$. Prove that $b+c$ is the square of an integer.

2021 Nigerian Senior MO Round 2, 4

Tags: number theory , relatively prime , algebra , inequalities

let $x_1$, $x_2$ .... $x_6$ be non-negative reals such that $x_1+x_2+x_3+x_4+x_5+x_6=1$ and $x_1x_3x_5$ + $x_2x_4x_6$ $\geq$ $\frac{1}{540}$. Let $p$ and $q$ be relatively prime integers such that $\frac{p}{q}$ is the maximum value of $x_1x_2x_3+x_2x_3x_4+x_3x_4x_5+x_4x_5x_6+x_5x_6x_1+x_6x_1x_2$. Find $p+q$

2013 Online Math Open Problems, 5

Tags: number theory , probability , relatively prime , analytic geometry

A wishing well is located at the point $(11,11)$ in the $xy$-plane. Rachelle randomly selects an integer $y$ from the set $\left\{ 0, 1, \dots, 10 \right\}$. Then she randomly selects, with replacement, two integers $a,b$ from the set $\left\{ 1,2,\dots,10 \right\}$. The probability the line through $(0,y)$ and $(a,b)$ passes through the well can be expressed as $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [i]Proposed by Evan Chen[/i]

1990 IMO Shortlist, 13

Tags: counting , frobenius , relatively prime , number theory , recurrence relation

An eccentric mathematician has a ladder with $ n$ rungs that he always ascends and descends in the following way: When he ascends, each step he takes covers $ a$ rungs of the ladder, and when he descends, each step he takes covers $ b$ rungs of the ladder, where $ a$ and $ b$ are fixed positive integers. By a sequence of ascending and descending steps he can climb from ground level to the top rung of the ladder and come back down to ground level again. Find, with proof, the minimum value of $ n,$ expressed in terms of $ a$ and $ b.$