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

2019 PUMaC Algebra B, 1

Let $a,b$ be positive integers such that $a+b=10$. Let $\tfrac{p}{q}$ be the difference between the maximum and minimum possible values of $\tfrac{1}{a}+\tfrac{1}{b}$, where $p$ and $q$ are relatively prime positive integers. Compute $p+q$.

2010 Purple Comet Problems, 3

The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

1994 India Regional Mathematical Olympiad, 7

Find the number of rationals $\frac{m}{n}$ such that (i) $0 < \frac{m}{n} < 1$; (ii) $m$ and $n$ are relatively prime; (iii) $mn = 25!$.

2015 Postal Coaching, Problem 3

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

2005 AIME Problems, 3

An infinite geometric series has sum $2005$. A new series, obtained by squaring each term of the original series, has $10$ times the sum of the original series. The common ratio of the original series is $\frac{m}{n}$ where $m$ and $n$ are relatively prime integers. Find $m+n$.

2010 Balkan MO, 4

For each integer $n$ ($n \ge 2$), let $f(n)$ denote the sum of all positive integers that are at most $n$ and not relatively prime to $n$. Prove that $f(n+p) \neq f(n)$ for each such $n$ and every prime $p$.

2012 ELMO Shortlist, 2

For positive rational $x$, if $x$ is written in the form $p/q$ with $p, q$ positive relatively prime integers, define $f(x)=p+q$. For example, $f(1)=2$. a) Prove that if $f(x)=f(mx/n)$ for rational $x$ and positive integers $m, n$, then $f(x)$ divides $|m-n|$. b) Let $n$ be a positive integer. If all $x$ which satisfy $f(x)=f(2^nx)$ also satisfy $f(x)=2^n-1$, find all possible values of $n$. [i]Anderson Wang.[/i]

2003 Iran MO (3rd Round), 1

suppose this equation: x <sup>2</sup> +y <sup>2</sup> +z <sup>2</sup> =w <sup>2</sup> . show that the solution of this equation ( if w,z have same parity) are in this form: x=2d(XZ-YW), y=2d(XW+YZ),z=d(X <sup>2</sup> +Y <sup>2</sup> -Z <sup>2</sup> -W <sup>2</sup> ),w=d(X <sup>2</sup> +Y <sup>2</sup> +Z <sup>2</sup> +W <sup>2</sup> )

2014 AMC 12/AHSME, 24

Let $ABCDE$ be a pentagon inscribed in a circle such that $AB=CD=3$, $BC=DE=10$, and $AE=14$. The sum of the lengths of all diagonals of $ABCDE$ is equal to $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $\textbf{(A) }129\qquad \textbf{(B) }247\qquad \textbf{(C) }353\qquad \textbf{(D) }391\qquad \textbf{(E) }421\qquad$

1977 IMO Longlists, 12

Let $z$ be an integer $> 1$ and let $M$ be the set of all numbers of the form $z_k = 1+z + \cdots+ z^k, \ k = 0, 1,\ldots$. Determine the set $T$ of divisors of at least one of the numbers $z_k$ from $M.$

1974 Putnam, A1

Call a set of positive integers "conspiratorial" if no three of them are pairwise relatively prime. What is the largest number of elements in any "conspiratorial" subset of the integers $1$ to $16$?

2010 Princeton University Math Competition, 4

Erick stands in the square in the 2nd row and 2nd column of a 5 by 5 chessboard. There are \$1 bills in the top left and bottom right squares, and there are \$5 bills in the top right and bottom left squares, as shown below. \[\begin{tabular}{|p{1em}|p{1em}|p{1em}|p{1em}|p{1em}|} \hline \$1 & & & & \$5 \\ \hline & E & & &\\ \hline & & & &\\ \hline & & & &\\ \hline \$5 & & & & \$1 \\ \hline \end{tabular}\] Every second, Erick randomly chooses a square adjacent to the one he currently stands in (that is, a square sharing an edge with the one he currently stands in) and moves to that square. When Erick reaches a square with money on it, he takes it and quits. The expected value of Erick's winnings in dollars is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

2013 Online Math Open Problems, 17

Determine the number of ordered pairs of positive integers $(x,y)$ with $y < x \le 100$ such that $x^2-y^2$ and $x^3 - y^3$ are relatively prime. (Two numbers are [i]relatively prime[/i] if they have no common factor other than $1$.) [i]Ray Li[/i]

2000 AIME Problems, 13

The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r,$ where $m, n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0.$ Find $m+n+r.$

2009 Purple Comet Problems, 20

Five men and seven women stand in a line in random order. Let m and n be relatively prime positive integers so that $\tfrac{m}{n}$ is the probability that each man stands next to at least one woman. Find $m + n.$

1991 IMO, 3

Let $ S \equal{} \{1,2,3,\cdots ,280\}$. Find the smallest integer $ n$ such that each $ n$-element subset of $ S$ contains five numbers which are pairwise relatively prime.

2020 China Northern MO, BP5

It is known that subsets $A_1,A_2, \cdots , A_n$ of set $I=\{1,2,\cdots ,101\}$ satisfy the following condition $$\text{For any } i,j \text{ } (1 \leq i < j \leq n) \text{, there exists } a,b \in A_i \cap A_j \text{ so that } (a,b)=1$$ Determine the maximum positive integer $n$. *$(a,b)$ means $\gcd (a,b)$

2014 NIMO Problems, 6

Suppose we wish to pick a random integer between $1$ and $N$ inclusive by flipping a fair coin. One way we can do this is through generating a random binary decimal between $0$ and $1$, then multiplying the result by $N$ and taking the ceiling. However, this would take an infinite amount of time. We therefore stopping the flipping process after we have enough flips to determine the ceiling of the number. For instance, if $N=3$, we could conclude that the number is $2$ after flipping $.011_2$, but $.010_2$ is inconclusive. Suppose $N=2014$. The expected number of flips for such a process is $\frac{m}{n}$ where $m$, $n$ are relatively prime positive integers, find $100m+n$. [i]Proposed by Lewis Chen[/i]

2012 Online Math Open Problems, 11

If \[\frac{1} {x} + \frac{1} {2x^2} +\frac{1} {4x^3}+\frac{1}{8x^4}+\frac{1}{16x^5}+\cdots=\frac{1} {64}, \] and $x$ can be expressed in the form $\frac{m}{n},$ where $m,n$ are relatively prime positive integers, find $m+n$. [i]Author: Ray Li[/i]

2009 AIME Problems, 10

Four lighthouses are located at points $ A$, $ B$, $ C$, and $ D$. The lighthouse at $ A$ is $ 5$ kilometers from the lighthouse at $ B$, the lighthouse at $ B$ is $ 12$ kilometers from the lighthouse at $ C$, and the lighthouse at $ A$ is $ 13$ kilometers from the lighthouse at $ C$. To an observer at $ A$, the angle determined by the lights at $ B$ and $ D$ and the angle determined by the lights at $ C$ and $ D$ are equal. To an observer at $ C$, the angle determined by the lights at $ A$ and $ B$ and the angle determined by the lights at $ D$ and $ B$ are equal. The number of kilometers from $ A$ to $ D$ is given by $ \displaystyle\frac{p\sqrt{r}}{q}$, where $ p$, $ q$, and $ r$ are relatively prime positive integers, and $ r$ is not divisible by the square of any prime. Find $ p\plus{}q\plus{}r$,

2009 Purple Comet Problems, 18

On triangle $ABC$ let $D$ be the point on $AB$ so that $CD$ is an altitude of the triangle, and $E$ be the point on $BC$ so that $AE$ bisects angle $BAC.$ Let $G$ be the intersection of $AE$ and $CD,$ and let point $F$ be the intersection of side $AC$ and the ray $BG.$ If $AB$ has length $28,$ $AC$ has length $14,$ and $CD$ has length $10,$ then the length of $CF$ can be written as $\tfrac{k-m\sqrt{p}}{n}$ where $k, m, n,$ and $p$ are positive integers, $k$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $k - m + n + p.$

2023 Turkey Junior National Olympiad, 3

Let $m,n$ be relatively prime positive integers. Prove that the numbers $$\frac{n^4+m}{m^2+n^2} \qquad \frac{n^4-m}{m^2-n^2}$$ cannot be integer at the same time.

2003 Korea - Final Round, 3

There are $n$ distinct points on a circumference. Choose one of the points. Connect this point and the $m$th point from the chosen point counterclockwise with a segment. Connect this $m$th point and the $m$th point from this $m$th point counterclockwise with a segment. Repeat such steps until no new segment is constructed. From the intersections of the segments, let the number of the intersections - which are in the circle - be $I$. Answer the following questions ($m$ and $n$ are positive integers that are relatively prime and they satisfy $6 \leq 2m < n$). 1) When the $n$ points take different positions, express the maximum value of $I$ in terms of $m$ and $n$. 2) Prove that $I \geq n$. Prove that there is a case, which is $I=n$, when $m=3$ and $n$ is arbitrary even number that satisfies the condition.

2005 Purple Comet Problems, 20

The summation $\sum_{k=1}^{360} \frac{1}{k \sqrt{k+1} + (k+1)\sqrt{k}}$ is the ratio of two relatively prime positive integers $m$ and $n$. Find $m + n$.

2010 Tournament Of Towns, 2

Pete has an instrument which can locate the midpoint of a line segment, and also the point which divides the line segment into two segments whose lengths are in a ratio of $n : (n + 1)$, where $n$ is any positive integer. Pete claims that with this instrument, he can locate the point which divides a line segment into two segments whose lengths are at any given rational ratio. Is Pete right?