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

1979 IMO, 1

If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.

2014 Online Math Open Problems, 27

A frog starts at $0$ on a number line and plays a game. On each turn the frog chooses at random to jump $1$ or $2$ integers to the right or left. It stops moving if it lands on a nonpositive number or a number on which it has already landed. If the expected number of times it will jump is $\tfrac{p}{q}$ for relatively prime positive integers $p$ and $q$, find $p+q$. [i]Proposed by Michael Kural[/i]

2002 Manhattan Mathematical Olympiad, 2

Let us consider the sequence $1,2, 3, \ldots , 2002$. Somebody choses $1002$ numbers from the sequence. Prove that there are two of the chosen numbers which are relatively prime (i.e. do not have any common divisors except $1$).

2011 Costa Rica - Final Round, 5

Given positive integers $a,b,c$ which are pairwise relatively prime, show that \[2abc-ab-bc-ac \] is the biggest number that can't be expressed in the form $xbc+yca+zab$ with $x,y,z$ being natural numbers.

1988 IMO Longlists, 63

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 \]

2014 AIME Problems, 2

Arnold is studying the prevalence of three health risk factors, denoted by A, B, and C. within a population of men. For each of the three factors, the probability that a randomly selected man in the population as only this risk factor (and none of the others) is 0.1. For any two of the three factors, the probability that a randomly selected man has exactly two of these two risk factors (but not the third) is 0.14. The probability that a randomly selected man has all three risk factors, given that he has A and B is $\tfrac{1}{3}$. The probability that a man has none of the three risk factors given that he does not have risk factor A is $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

2012 Today's Calculation Of Integral, 826

Let $G$ be a hyper elementary abelian $p-$group and let $f : G \rightarrow G$ be a homomorphism. Then prove that $\ker f$ is isomorphic to $\mathrm{coker} f$.

2005 International Zhautykov Olympiad, 3

Find all prime numbers $ p,q$ less than 2005 and such that $ q|p^2 \plus{} 4$, $ p|q^2 \plus{} 4$.

2009 AIME Problems, 8

Dave rolls a fair six-sided die until a six appears for the first time. Independently, Linda rolls a fair six-sided die until a six appears for the first time. Let $ m$ and $ n$ be relatively prime positive integers such that $ \frac{m}{n}$ is the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. Find $ m\plus{}n$.

1973 Bulgaria National Olympiad, Problem 1

Let the sequence $a_1,a_2,\ldots,a_n,\ldots$ is defined by the conditions: $a_1=2$ and $a_{n+1}=a_n^2-a_n+1$ $(n=1,2,\ldots)$. Prove that: (a) $a_m$ and $a_n$ are relatively prime numbers when $m\ne n$. (b) $\lim_{n\to\infty}\sum_{k=1}^n\frac1{a_k}=1$ [i]I. Tonov[/i]

2004 AIME Problems, 9

Let $ABC$ be a triangle with sides 3, 4, and 5, and $DEFG$ be a 6-by-7 rectangle. A segment is drawn to divide triangle $ABC$ into a triangle $U_1$ and a trapezoid $V_1$ and another segment is drawn to divide rectangle $DEFG$ into a triangle $U_2$ and a trapezoid $V_2$ such that $U_1$ is similar to $U_2$ and $V_1$ is similar to $V_2$. The minimum value of the area of $U_1$ can be written in the form $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

2014 NIMO Problems, 4

Let $S$ be the set of integers which are both a multiple of $70$ and a factor of $630{,}000$. A random element $c$ of $S$ is selected. If the probability that there exists an integer $d$ with $\gcd (c,d) = 70$ and $\operatorname{lcm} (c,d) = 630{,}000$ is $\frac mn$ for some relatively prime integers $m$ and $n$, compute $100m+n$. [i]Proposed by Eugene Chen[/i]

2010 Purple Comet Problems, 29

Square $ABCD$ is shown in the diagram below. Points $E$, $F$, and $G$ are on sides $\overline{AB}$, $\overline{BC}$ and $\overline{DA}$, respectively, so that lengths $\overline{BE}$, $\overline{BF}$, and $\overline{DG}$ are equal. Points $H$ and $I$ are the midpoints of segments $\overline{EF}$ and $\overline{CG}$, respectively. Segment $\overline{GJ}$ is the perpendicular bisector of segment $\overline{HI}$. The ratio of the areas of pentagon $AEHJG$ and quadrilateral $CIHF$ can be written as $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] draw((0,0)--(50,0)--(50,50)--(0,50)--cycle); label("$A$",(0,50),NW); label("$B$",(50,50),NE); label("$C$",(50,0),SE); label("$D$",(0,0),SW); label("$E$",(0,100/3-1),W); label("$F$",(100/3-1,0),S); label("$G$",(20,50),N); label("$H$",((100/3-1)/2,(100/3-1)/2),SW); label("$I$",(35,25),NE); label("$J$",(((100/3-1)/2+35)/2,((100/3-1)/2+25)/2),S); draw((0,100/3-1)--(100/3-1,0)); draw((20,50)--(50,0)); draw((100/6-1/2,100/6-1/2)--(35,25)); draw((((100/3-1)/2+35)/2,((100/3-1)/2+25)/2)--(20,50)); [/asy]

2002 Manhattan Mathematical Olympiad, 1

Famous French mathematician Pierre Fermat believed that all numbers of the form $F_n = 2^{2^n} + 1$ are prime for all non-negative integers $n$. Indeed, one can check that $F_0 = 3$, $F_1 = 5$, $F_2 = 17$, $F_3 = 257$ are all prime. a) Prove that $F_5$ is divisible by $641$. (Hence Fermat was wrong.) b) Prove that if $k \ne n$ then $F_k$ and $F_n$ are relatively prime (i.e. they do not have any common divisor except $1$) (Notice: using b) one can prove that there are infinitely many prime numbers)

2008 All-Russian Olympiad, 7

A natural number is written on the blackboard. Whenever number $ x$ is written, one can write any of the numbers $ 2x \plus{} 1$ and $ \frac {x}{x \plus{} 2}$. At some moment the number $ 2008$ appears on the blackboard. Show that it was there from the very beginning.

2014 AIME Problems, 11

In $\triangle RED, RD =1, \angle DRE = 75^\circ$ and $\angle RED = 45^\circ$. Let $M$ be the midpoint of segment $\overline{RD}$. Point $C$ lies on side $\overline{ED}$ such that $\overline{RC} \perp \overline{EM}$. Extend segment $\overline{DE}$ through $E$ to point $A$ such that $CA = AR$. Then $AE = \tfrac{a-\sqrt{b}}{c},$ where $a$ and $c$ are relatively prime positive integers, and $b$ is a positive integer. Find $a+b+c$.

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

2012 Singapore MO Open, 4

Let $p$ be an odd prime. Prove that \[1^{p-2}+2^{p-2}+\cdots+\left(\frac{p-1}{2}\right)^{p-2}\equiv\frac{2-2^p}{p}\pmod p.\]

2010 Putnam, B3

There are 2010 boxes labeled $B_1,B_2,\dots,B_{2010},$ and $2010n$ balls have been distributed among them, for some positive integer $n.$ You may redistribute the balls by a sequence of moves, each of which consists of choosing an $i$ and moving [i]exactly[/i] $i$ balls from box $B_i$ into any one other box. For which values of $n$ is it possible to reach the distribution with exactly $n$ balls in each box, regardless of the initial distribution of balls?

2008 ITest, 59

Let $a$ and $b$ be relatively prime positive integers such that \[\dfrac ab=\dfrac1{2^1}+\dfrac2{3^2}+\dfrac3{2^3}+\dfrac4{3^4}+\dfrac5{2^5}+\dfrac6{3^6}+\cdots,\] where the numerators always increase by $1$, and the denominators alternate between powers of $2$ and $3$, with exponents also increasing by $1$ for each subsequent term. Compute $a+b$.

PEN O Problems, 11

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

1991 IMTS, 3

Prove that if $x,y$ and $z$ are pairwise relatively prime positive integers, and if $\frac{1}{x} + \frac{1}{y} = \frac{1}{z}$, then $x+y, x-z, y-z$ are perfect squares of integers.

PEN J Problems, 5

If $n$ is composite, prove that $\phi(n) \le n- \sqrt{n}$.

2008 Romania National Olympiad, 2

A rectangle can be divided by parallel lines to its sides into 200 congruent squares, and also in 288 congruent squares. Prove that the rectangle can also be divided into 392 congruent squares.

2000 AIME Problems, 5

Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is $25.$ One marble is taken out of each box randomly. The probability that both marbles are black is $27/50,$ and the probability that both marbles are white is $m/n,$ where $m$ and $n$ are relatively prime positive integers. What is $m+n?$