Difference between revisions of "AoPS Wiki:Competition ratings"

Revision as of 09:01, 22 July 2009

This page contains an approximate estimation of the difficulty level of various competitions. It is designed with the intention of introducing contests of similar difficulty levels (but possibly different styles of problems) that readers may like to try to gain more experience.

Each entry groups the problems into sets of similar difficulty levels and suggests an approximate difficulty rating, on a scale from 1 to 10 (from easiest to hardest). Note that many of these ratings are not directly comparable, because the actual competitions have many different rules; the ratings are generally synchronized with the amount of available time, etc. Also, due to variances within a contest, ranges shown may overlap. A sample problem is provided with each entry, with a link to a solution.

As you may have guessed with time many competitions got more challenging because many countries got more access to books targeted at olympiad preparation. But especially web site where one can discuss olympiad as our very own ML/AoPS! Thus when judging the difficulty level consider the last 10-15 years with more priority.

If you have some experience with mathematical competitions, we hope that you can help us make the difficulty rankings more accurate. Currently, the system is on a scale from 1 to 10 where 1 is the easiest level, i.e. early AMC problems and 10 is hardest level, i.e. China IMO Team Selection Test. When considering problem difficulty put more emphasis on problem-solving aspects and less so on technical skill requirements.^[1]

Competitions

MOEMS

Division E: 1
The whole number $N$ is divisible by $7$ . $N$ leaves a remainder of $1$ when divided by $2,3,4,$ or $5$ . What is the smallest value that $N$ can be? (Solution)
Division M: 1
The value of a two-digit number is $10$ times more than the sum of its digits. The units digit is 1 more than twice the tens digit. Find the two-digit number. (Solution)

Mathcounts

AMC 8

Problem 1 - Problem 12: 1
What is the number of degrees in the smaller angle between the hour hand and the minute hand on a clock that reads seven o'clock? (Solution)
Problem 13 - Problem 25: 2
A fifth number, $n$ , is added to the set $\{ 3,6,9,10 \}$ to make the mean of the set of five numbers equal to its median. What is the number of possible values of $n$ ? (Solution)

AMC 10

Problem 1 - 5: 1
The larger of two consecutive odd integers is three times the smaller. What is their sum? (Solution)
Problem 6 - 22: 2
How many non-similar triangles have angles whose degree measures are distinct positive integers in arithmetic progression? (Solution)
Problem 18 - 25: 3
Mr. Jones has eight children of different ages. On a family trip his oldest child, who is 9, spots a license plate with a 4-digit number in which each of two digits appears two times. "Look, daddy!" she exclaims. "That number is evenly divisible by the age of each of us kids!" "That's right," replies Mr. Jones, "and the last two digits just happen to be my age." Which of the following is not the age of one of Mr. Jones's children? (Solution)

AMC 12

Problem 1-5: 2
A solid box is $15$ cm by $10$ cm by $8$ cm. A new solid is formed by removing a cube $3$ cm on a side from each corner of this box. What percent of the original volume is removed? (Solution)
Problem 3-18: 3
An object in the plane moves from one lattice point to another. At each step, the object may move one unit to the right, one unit to the left, one unit up, or one unit down. If the object starts at the origin and takes a ten-step path, how many different points could be the final point? (Solution)
Problem 22-25: 4
Functions $f$ and $g$ are quadratic, $g(x) = - f(100 - x)$ , and the graph of $g$ contains the vertex of the graph of $f$ . The four $x$ -intercepts on the two graphs have $x$ -coordinates $x_1$ , $x_2$ , $x_3$ , and $x_4$ , in increasing order, and $x_3 - x_2 = 150$ . The value of $x_4 - x_1$ is $m + n\sqrt p$ , where $m$ , $n$ , and $p$ are positive integers, and $p$ is not divisible by the square of any prime. What is $m + n + p$ ? (Solution)

AIME

Problem 1 - 5: 3
If $\tan x+\tan y=25$ and $\cot x + \cot y=30$ , what is $\tan(x+y)$ ? (Solution)
Problem 5 - 10: 4
Triangle $ABC$ has $AB=21$ , $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ . (Solution)
Problem 11 - 15: 5
A right cone|right circular cone has a base with radius $600$ and height $200\sqrt{7}.$ A fly starts at a point on the surface of the cone whose distance from the vertex of the cone is $125$ , and crawls along the surface of the cone to a point on the exact opposite side of the cone whose distance from the vertex is $375\sqrt{2}.$ Find the least distance that the fly could have crawled. (Solution)
Problem 14 - 15: 6
Find the largest integer $n$ satisfying the following conditions: (i) $n^2$ can be expressed as the difference of two consecutive cubes; (ii) $2n + 79$ is a perfect square. (Solution)

ARML

Individuals, Problem 1-5,7,9: 3
Individuals, Problem 6,8: 4
Individuals, Problem 10: 6.5
Team/power, Problem 1-5: 3.5
Team/power, Problem 6-10: 5

HMMT

Individuals, Problem 1-5: 4
Individuals, Problem 6-10: 5

JBMO

Problem 1: 4
Find all real numbers $a,b,c,d$ such that

$\left\{\begin{array}{cc}a+b+c+d = 20,\\ ab+ac+ad+bc+bd+cd = 150.\end{array}\right.$

Problem 2: 5
Let $ABCD$ be a convex quadrilateral with $\angle DAC=\angle BDC=36^\circ$ , $\angle CBD=18^\circ$ and $\angle BAC=72^\circ$ . The diagonals intersect at point $P$ . Determine the measure of $\angle APD$ .
Problem 3: 5
Find all prime numbers $p,q,r$ , such that $\frac pq-\frac4{r+1}=1$ .
Problem 4: 6
A $4\times4$ table is divided into $16$ white unit square cells. Two cells are called neighbors if they share a common side. A move consists in choosing a cell and changing the colors of neighbors from white to black or from black to white. After exactly $n$ moves all the $16$ cells were black. Find all possible values of $n$ .

USAMTS

Problem 1-2: 4
Find three isosceles triangles, no two of which are congruent, with integer sides, such that each triangle’s area is numerically equal to 6 times its perimeter. (Solution)
Problem 3-5: 5
Call a positive real number groovy if it can be written in the form $\sqrt{n} + \sqrt{n + 1}$ for some positive integer $n$ . Show that if $x$ is groovy, then for any positive integer $r$ , the number $x^r$ is groovy as well. (Solution)

Germany Bundeswettbewerb Mathematik

Round 1, Problem 1 x
Round 1, Problem 2 x
Round 1, Problem 3 x
Round 1, Problem 4 x
Round 2, Problem 1 x
Round 2, Problem 2 x
Round 2, Problem 3 x
Round ", Problem 4 x

IMO Shortlist

Problem 1-2: 5
Problem 3-4: 7
Problem 5+: 8.5+

USAMO

Problem 1/4: 5.5
Let $\mathcal{P}$ be a convex polygon with $n$ sides, $n\ge3$ . Any set of $n - 3$ diagonals of $\mathcal{P}$ that do not intersect in the interior of the polygon determine a triangulation of $\mathcal{P}$ into $n - 2$ triangles. If $\mathcal{P}$ is regular and there is a triangulation of $\mathcal{P}$ consisting of only isosceles triangles, find all the possible values of $n$ . (Solution)
Problem 2/5: 7
Three nonnegative real numbers $r_1$ , $r_2$ , $r_3$ are written on a blackboard. These numbers have the property that there exist integers $a_1$ , $a_2$ , $a_3$ , not all zero, satisfying $a_1r_1 + a_2r_2 + a_3r_3 = 0$ . We are permitted to perform the following operation: find two numbers $x$ , $y$ on the blackboard with $x \le y$ , then erase $y$ and write $y - x$ in its place. Prove that after a finite number of such operations, we can end up with at least one $0$ on the blackboard. (Solution)
Problem 3/6: 8.5
Prove that any monic polynomial (a polynomial with leading coefficient 1) of degree $n$ with real coefficients is the average of two monic polynomials of degree $n$ with $n$ real roots. (Solution)

APMO

Problem 1: 6.5
Problem 2: 7

All-Russian Olympiad

USA TST

(seems to vary more than other contests; estimates based on 08 and 09)

Problem 1/4/7: 7.5
Problem 2/5/8: 8
Problem 3/6/9: 8.5

Iran TST

China TST

Problem 1/4:
Problem 2/5:
Problem 3/6: 8.5

IMO

Problem 1/4: 6.5
Find all functions $f: (0, \infty) \mapsto (0, \infty)$ (so $f$ is a function from the positive real numbers) such that

$\frac {\left( f(w) \right)^2 + \left( f(x) \right)^2}{f(y^2) + f(z^2) } = \frac {w^2 + x^2}{y^2 + z^2}$

for all positive real numbers $w,x,y,z,$ satisfying $wx = yz.$ (Solution)

Problem 2/5: 7.5
Let $P(x)$ be a polynomial of degree $n>1$ with integer coefficients, and let $k$ be a positive integer. Consider the polynomial $Q(x) = P( P ( \ldots P(P(x)) \ldots ))$ , where $P$ occurs $k$ times. Prove that there are at most $n$ integers $t$ such that $Q(t)=t$ . (Solution)
Problem 3/6: 9
Assign to each side $b$ of a convex polygon $P$ the maximum area of a triangle that has $b$ as a side and is contained in $P$ . Show that the sum of the areas assigned to the sides of $P$ is at least twice the area of $P$ . (<url>viewtopic.php?p=572824#572824 Solution</url>)

Putnam

Problem A/B,1-2: 5.5
Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola $xy = 1$ and both branches of the hyperbola $xy = - 1.$ (A set $S$ in the plane is called convex if for any two points in $S$ the line segment connecting them is contained in $S.$ ) (<url>viewtopic.php?p=978383#p978383 Solution</url>)
Problem A/B,3-4: 7
Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n$ . (<url>viewtopic.php?p=383280#383280 Solution</url>)
Problem A/B,5-6: 9
For any $a > 0$ , define the set $S(a) = \{[an]|n = 1,2,3,...\}$ . Show that there are no three positive reals $a,b,c$ such that $S(a)\cap S(b) = S(b)\cap S(c) = S(c)\cap S(a) = \phi,S(a)\cup S(b)\cup S(c) = \{1,2,3,...\}$ . (<url>viewtopic.php?t=127810 Solution</url>)

Miklós Schweitzer

Problem 1-3:
Problem 4-6:
Problem 7-9:
Problem 10-12:

Scale

^[1] All levels estimated and refer to averages. The following is a rough standard based on the USA tier system AMC 8 – AMC 10 – AMC 12 – AIME – USAMO, representing Middle School – Junior High – High School – Challenging High School – Olympiad levels. Other contests can be interpolated against this.

Problems strictly for beginners, on the easiest elementary school or middle school levels. Examples would be MOEMS, easy Mathcounts questions, #1-20 on AMC 8s, very easy AMC 10/12 questions, and others that involve standard techniques introduced up to the middle school level
For motivated beginners, harder questions from the previous categories (hardest middle-school level questions, #5-20 on AMC 10, #5-10 on AMC 12, easiest AIME questions, etc).
For those not too familiar with standard techniques, #21-25 on AMC 10, #11-20ish on AMC 12, #1-5 on AIMEs, and analogous contests.
Intermediate-leveled problem solvers, the most difficult questions on AMC 12s (#22-25s), more difficult AIME-styled questions #6-10
Difficult AIME problems (#10-13), others, simple proof-based problems (JBMO etc)
High-leveled AIME-styled questions, not requiring proofs (#12-15). Introductory-leveled Olympiad-level questions (#1-4s).
Intermediate-leveled Olympiad-level questions, #1,3s that require more technical knowledge than new students to Olympiad-type questions have, easier #2,4s, etc.
High-level difficult Olympiad-level questions, eg #2,4s on difficult Olympiad contest and easier #3,6s, etc.
Difficult Olympiad-level questions, eg #3,6s on difficult Olympiad contests.
Problems occasionally even unsuitable for normal grade school level competitions due to being exceedingly tedious/long/difficult (eg very few students are capable of solving, even on a worldwide basis), or involving techniques beyond high school level mathematics.

@@ Line 90: / Line 90: @@
 * Round 1, Problem 3 '''x'''
 * Round 1, Problem 4 '''x'''
-* Round 1, Problem 5 '''x'''
+* Round 2, Problem 1 '''x'''
-* Round 1, Problem 6 '''x'''
+* Round 2, Problem 2 '''x'''
-* Round 1, Problem 7 '''x'''
+* Round 2, Problem 3 '''x'''
-* Round 1, Problem 8 '''x'''
+* Round ", Problem 4 '''x'''
 === [[IMO Shortlist]] ===

Page

Toolbox

Search