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

2011 Harvard-MIT Mathematics Tournament, 1

Let $ABC$ be a triangle such that $AB = 7$, and let the angle bisector of $\angle BAC$ intersect line $BC$ at $D$. If there exist points $E$ and $F$ on sides $AC$ and $BC$, respectively, such that lines $AD$ and $EF$ are parallel and divide triangle $ABC$ into three parts of equal area, determine the number of possible integral values for $BC$.

2016 HMNT, 10

Tags: hmmt
We have $10$ points on a line $A_1,A_2\ldots A_{10}$ in that order. Initially there are $n$ chips on point $A_1$. Now we are allowed to perform two types of moves. Take two chips on $A_i$, remove them and place one chip on $A_{i+1}$, or take two chips on $A_{i+1}$, remove them, and place a chip on $A_{i+2}$ and $A_i$ . Find the minimum possible value of $n$ such that it is possible to get a chip on $A_{10}$ through a sequence of moves.

2013 Harvard-MIT Mathematics Tournament, 7

Tags: hmmt
Compute \[\sum_{a_1=0}^\infty\sum_{a_2=0}^\infty\cdots\sum_{a_7=0}^\infty\dfrac{a_1+a_2+\cdots+a_7}{3^{a_1+a_2+\cdots+a_7}}.\]

2016 HMNT, 9

Tags: hmmt
Let the sequence $a_i$ be defined as $a_{i+1} = 2^{a_i}$. Find the number of integers $1 \le n \le 1000$ such that if $a_0 = n$, then $100$ divides $a_{1000} - a_1$.

2019 Harvard-MIT Mathematics Tournament, 3

For any angle $0 < \theta < \pi/2$, show that \[0 < \sin \theta + \cos \theta + \tan \theta + \cot \theta - \sec \theta - \csc \theta < 1.\]

2014 Harvard-MIT Mathematics Tournament, 3

Tags: hmmt , logarithm
Let \[ A = \frac{1}{6}((\log_2(3))^3-(\log_2(6))^3-(\log_2(12))^3+(\log_2(24))^3) \]. Compute $2^A$.

2013 Harvard-MIT Mathematics Tournament, 2

Let $\{a_n\}_{n\geq 1}$ be an arithmetic sequence and $\{g_n\}_{n\geq 1}$ be a geometric sequence such that the first four terms of $\{a_n+g_n\}$ are $0$, $0$, $1$, and $0$, in that order. What is the $10$th term of $\{a_n+g_n\}$?

2019 Harvard-MIT Mathematics Tournament, 9

How many ways can you fill a $3 \times 3$ square grid with nonnegative integers such that no [i]nonzero[/i] integer appears more than once in the same row or column and the sum of the numbers in every row and column equals 7?

2012 Harvard-MIT Mathematics Tournament, 9

How many real triples $(a,b,c)$ are there such that the polynomial $p(x)=x^4+ax^3+bx^2+ax+c$ has exactly three distinct roots, which are equal to $\tan y$, $\tan 2y$, and $\tan 3y$ for some real number $y$?

2016 HMNT, 13-15

Tags: hmmt
13. How many functions $f : \{0, 1\}^3 \to \{0, 1\}$ satisfy the property that, for all ordered triples $(a_1, a_2, a_3)$ and $(b_1, b_2, b_3)$ such that $a_i \ge b_i$ for all $i$, $f(a_1, a_2, a_3) \ge f(b_1, b_2, b_3)$? 14. The very hungry caterpillar lives on the number line. For each non-zero integer $i$, a fruit sits on the point with coordinate $i$. The caterpillar moves back and forth; whenever he reaches a point with food, he eats the food, increasing his weight by one pound, and turns around. The caterpillar moves at a speed of $2^{-w}$ units per day, where $w$ is his weight. If the caterpillar starts off at the origin, weighing zero pounds, and initially moves in the positive $x$ direction, after how many days will he weigh $10$ pounds? 15. Let $ABCD$ be an isosceles trapezoid with parallel bases $AB = 1$ and $CD = 2$ and height $1$. Find the area of the region containing all points inside $ABCD$ whose projections onto the four sides of the trapezoid lie on the segments formed by $AB,BC,CD$ and $DA$.

2016 HMNT, 7

Tags: hmmt
Seven lattice points form a convex heptagon with all sides having distinct lengths. Find the minimum possible value of the sum of the squares of the sides of the heptagon.

2014 NIMO Problems, 2

Tags: hmmt , probability
In the game of Guess the Card, two players each have a $\frac{1}{2}$ chance of winning and there is exactly one winner. Sixteen competitors stand in a circle, numbered $1,2,\dots,16$ clockwise. They participate in an $4$-round single-elimination tournament of Guess the Card. Each round, the referee randomly chooses one of the remaining players, and the players pair off going clockwise, starting from the chosen one; each pair then plays Guess the Card and the losers leave the circle. If the probability that players $1$ and $9$ face each other in the last round is $\frac{m}{n}$ where $m,n$ are positive integers, find $100m+n$. [i]Proposed by Evan Chen[/i]

2016 HMNT, 10-12

Tags: hmmt
10. Michael is playing basketball. He makes $10\%$ of his shots, and gets the ball back after $90\%$ of his missed shots. If he does not get the ball back he stops playing. What is the probability that Michael eventually makes a shot? 11. How many subsets $S$ of the set $\{1, 2, \ldots , 10\}$ satisfy the property that, for all $i \in [1, 9]$, either $i$ or $i + 1$ (or both) is in S? 12. A positive integer $\overline{ABC}$, where $A, B, C$ are digits, satisfies $$\overline{ABC} = B^C - A$$ Find $\overline{ABC}$.

2013 Harvard-MIT Mathematics Tournament, 31

Let $ABCD$ be a quadrilateral inscribed in a unit circle with center $O$. Suppose that $\angle AOB = \angle COD = 135^\circ$, $BC=1$. Let $B^\prime$ and $C^\prime$ be the reflections of $A$ across $BO$ and $CO$ respectively. Let $H_1$ and $H_2$ be the orthocenters of $AB^\prime C^\prime$ and $BCD$, respectively. If $M$ is the midpoint of $OH_1$, and $O^\prime$ is the reflection of $O$ about the midpoint of $MH_2$, compute $OO^\prime$.

2019 HMNT, 2

Tags: hmmt
$2019$ students are voting on the distribution of $N$ items. For each item, each student submits a vote on who should receive that item, and the person with the most votes receives the item (in case of a tie, no one gets the item). Suppose that no student votes for the same person twice. Compute the maximum possible number of items one student can receive, over all possible values of $N$ and all possible ways of voting.

2014 Harvard-MIT Mathematics Tournament, 4

Let $b$ and $c$ be real numbers and define the polynomial $P(x)=x^2+bx+c$. Suppose that $P(P(1))=P(P(2))=0$, and that $P(1) \neq P(2)$. Find $P(0)$.

1999 Harvard-MIT Mathematics Tournament, 11

Tags: hmmt , geometry , circles , angle
Circles $C_1$, $C_2$, $C_3$ have radius $ 1$ and centers $O, P, Q$ respectively. $C_1$ and $C_2$ intersect at $A$, $C_2$ and $C_3$ intersect at $B$, $C_3$ and $C_1$ intersect at $C$, in such a way that $\angle APB = 60^o$ , $\angle BQC = 36^o$ , and $\angle COA = 72^o$ . Find angle $\angle ABC$ (degrees).

2013 Harvard-MIT Mathematics Tournament, 4

Determine all real values of $A$ for which there exist distinct complex numbers $x_1$, $x_2$ such that the following three equations hold: \begin{align*}x_1(x_1+1)&=A\\x_2(x_2+1)&=A\\x_1^4+3x_1^3+5x_1&=x_2^4+3x_2^3+5x_2.\end{align*}

2016 HMNT, 3

Let $V$ be a rectangular prism with integer side lengths. The largest face has area $240$ and the smallest face has area $48$. A third face has area $x$, where $x$ is not equal to $48$ or $240$. What is the sum of all possible values of $x$?

2014 HMNT, 6

Tags: hmmt , induction
Find the number of strictly increasing sequences of nonnegative integers with the following properties: • The first term is $0$ and the last term is $12$. In particular, the sequence has at least two terms. • Among any two consecutive terms, exactly one of them is even.

2011 Harvard-MIT Mathematics Tournament, 3

Tags: hmmt , geometry
Let $ABCDEF$ be a regular hexagon of area $1$. Let $M$ be the midpoint of $DE$. Let $X$ be the intersection of $AC$ and $BM$, let $Y$ be the intersection of $BF$ and $AM$, and let $Z$ be the intersection of $AC$ and $BF$. If $[P]$ denotes the area of a polygon $P$ for any polygon $P$ in the plane, evaluate $[BXC] + [AYF] + [ABZ] - [MXZY]$.

2013 Harvard-MIT Mathematics Tournament, 16

The walls of a room are in the shape of a triangle $ABC$ with $\angle ABC = 90^\circ$, $\angle BAC = 60^\circ$, and $AB=6$. Chong stands at the midpoint of $BC$ and rolls a ball toward $AB$. Suppose that the ball bounces off $AB$, then $AC$, then returns exactly to Chong. Find the length of the path of the ball.

2013 Harvard-MIT Mathematics Tournament, 2

The real numbers $x$, $y$, $z$, satisfy $0\leq x \leq y \leq z \leq 4$. If their squares form an arithmetic progression with common difference $2$, determine the minimum possible value of $|x-y|+|y-z|$.

2016 Harvard-MIT Mathematics Tournament, 8

Tags: hmmt
Let $S = \{1, 2, \ldots, 2016\}$, and let $f$ be a randomly chosen bijection from $S$ to itself. Let $n$ be the smallest positive integer such that $f^{(n)}(1) = 1$, where $f^{(i)}(x) = f(f^{(i-1)}(x))$. What is the expected value of $n$?

2013 Harvard-MIT Mathematics Tournament, 10

Tags: hmmt , geometry
Wesyu is a farmer, and she's building a cao (a relative of the cow) pasture. Shw starts with a triangle $A_0A_1A_2$ where angle $A_0$ is $90^\circ$, angle $A_1$ is $60^\circ$, and $A_0A_1$ is $1$. She then extends the pasture. FIrst, she extends $A_2A_0$ to $A_3$ such that $A_3A_0=\dfrac12A_2A_0$ and the new pasture is triangle $A_1A_2A_3$. Next, she extends $A_3A_1$ to $A_4$ such that $A_4A_1=\dfrac16A_3A_1$. She continues, each time extending $A_nA_{n-2}$ to $A_{n+1}$ such that $A_{n+1}A_{n-2}=\dfrac1{2^n-2}A_nA_{n-2}$. What is the smallest $K$ such that her pasture never exceeds an area of $K$?