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

2014 AIME Problems, 5

Real numbers $r$ and $s$ are roots of $p(x)=x^3+ax+b$, and $r+4$ and $s-3$ are roots of $q(x)=x^3+ax+b+240$. Find the sum of all possible values of $|b|$.

2014 NIMO Problems, 1

Define $H_n = 1+\frac{1}{2}+\cdots+\frac{1}{n}$. Let the sum of all $H_n$ that are terminating in base 10 be $S$. If $S = m/n$ where m and n are relatively prime positive integers, find $100m+n$. [i]Proposed by Lewis Chen[/i]

2003 All-Russian Olympiad, 4

A finite set of points $X$ and an equilateral triangle $T$ are given on a plane. Suppose that every subset $X'$ of $X$ with no more than $9$ elements can be covered by two images of $T$ under translations. Prove that the whole set $X$ can be covered by two images of $T$ under translations.

2010 Turkey MO (2nd round), 3

Let $K$ be the set of all sides and diagonals of a convex $2010-gon$ in the plane. For a subset $A$ of $K,$ if every pair of line segments belonging to $A$ intersect, then we call $A$ as an [i]intersecting set.[/i] Find the maximum possible number of elements of union of two [i]intersecting sets.[/i]

2014 USAMTS Problems, 3a:

A group of people is lined up in [i]almost-order[/i] if, whenever person $A$ is to the left of person $B$ in the line, $A$ is not more than $8$ centimeters taller than $B$. For example, five people with heights $160, 165, 170, 175$, and $180$ centimeters could line up in almost-order with heights (from left-to-right) of $160, 170, 165, 180, 175$ centimeters. (a) How many different ways are there to line up $10$ people in [i]almost-order[/i] if their heights are $140, 145, 150, 155,$ $160,$ $165,$ $170,$ $175,$ $180$, and $185$ centimeters?

2005 All-Russian Olympiad Regional Round, 8.8

8.8, 9.8, 11.8 a) 99 boxes contain apples and oranges. Prove that we can choose 50 boxes in such a way that they contain at least half of all apples and half of all oranges. b) 100 boxes contain apples and oranges. Prove that we can choose 34 boxes in such a way that they contain at least a third of all apples and a third of all oranges. c) 100 boxes contain apples, oranges and bananas. Prove that we can choose 51 boxes in such a way that they contain at least half of all apples, and half of all oranges and half of all bananas. ([i]I. Bogdanov, G. Chelnokov, E. Kulikov[/i])

2006 Putnam, A6

Four points are chosen uniformly and independently at random in the interior of a given circle. Find the probability that they are the vertices of a convex quadrilateral.

1988 AMC 12/AHSME, 1

Tags: email
$\sqrt{8}+\sqrt{18}=$ $\textbf{(A)}\ \sqrt{20} \qquad \textbf{(B)}\ 2(\sqrt{2}+\sqrt{3}) \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 5\sqrt{2} \qquad \textbf{(E)}\ 2\sqrt{13}$

2013 Harvard-MIT Mathematics Tournament, 36

Tags: HMMT , Euler , email , MIT , college
(Mathematicians A to Z) Below are the names of 26 mathematicians, one for each letter of the alphabet. Your answer to this question should be a subset of $\{A,B,\cdots,Z\}$, where each letter represents the corresponding mathematician. If two mathematicians in your subset have birthdates that are within $20$ years of each other, then your score is $0$. Otherwise, your score is $\max(3(k-3),0)$ where $k$ is the number of elements in your set. \[\begin{tabular}{cc}Niels Abel & Isaac Newton\\Etienne Bezout & Nicole Oresme \\ Augustin-Louis Cauchy & Blaise Pascal \\ Rene Descartes & Daniel Quillen \\ Leonhard Euler & Bernhard Riemann\\ Pierre Fatou & Jean-Pierre Serre \\ Alexander Grothendieck & Alan Turing \\ David Hilbert & Stanislaw Ulam \\ Kenkichi Iwasawa & John Venn \\ Carl Jacobi & Andrew Wiles \\ Andrey Kolmogorov & Leonardo Ximenes \\ Joseph-Louis Lagrange & Shing-Tung Yau \\ John Milnor & Ernst Zermelo\end{tabular}\]