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

2013 Harvard-MIT Mathematics Tournament, 7

Find the number of positive divisors $d$ of $15!=15\cdot 14\cdot\cdots\cdot 2\cdot 1$ such that $\gcd(d,60)=5$.

2016 Harvard-MIT Mathematics Tournament, 1

Tags: hmmt
Let $a$ and $b$ be integers (not necessarily positive). Prove that $a^3+5b^3 \neq 2016$.

2020 Harvest Math Invitational Team Round Problems, HMI Team #2

Tags: hmmt , set theory
2. Let $A$ be a set of $2020$ distinct real numbers. Call a number [i]scarily epic[/i] if it can be expressed as the product of two (not necessarily distinct) numbers from $A$. What is the minimum possible number of distinct [i]scarily epic[/i] numbers? [i]Proposed by Monkey_king1[/i]

2016 HMNT, 1-3

Tags: hmmt
1. If five fair coins are flipped simultaneously, what is the probability that at least three of them show heads? 2. How many perfect squares divide $10^{10}$? 3. Evaluate $\frac{2016!^2}{2015!2017!}$ . Here $n!$ denotes $1 \times 2 \times \ldots \times n$.

2018 HMNT, 6

Call a polygon [i]normal[/i] if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?

2014 NIMO Problems, 2

Tags: hmmt , geometry
In the Generic Math Tournament, $99$ people participate. One of the participants, Alfred, scores 16th in Algebra, 30th in Combinatorics, and 23rd in Geometry (and does not tie with anyone). The overall ranking is computed by adding the scores from all three tests. Given this information, let $B$ be the best ranking that Alfred could have achieved, and let $W$ be the worst ranking that he could have achieved. Compute $100B+W$. [i]Proposed by Lewis Chen[/i]

2023 Harvard-MIT Mathematics Tournament, 4

Tags: hmmt
Suppose $P (x)$ is a polynomial with real coefficients such that $P (t) = P (1)t^2 + P (P (1))t + P (P (P (1)))$ for all real numbers $t$. Compute the largest possible value of $P(P(P(P(1))))$.

2012 Harvard-MIT Mathematics Tournament, 1

Tags: hmmt , function
Let $f$ be the function such that \[f(x)=\begin{cases}2x & \text{if }x\leq \frac{1}{2}\\2-2x & \text{if }x>\frac{1}{2}\end{cases}\] What is the total length of the graph of $\underbrace{f(f(\ldots f}_{2012\text{ }f's}(x)\ldots))$ from $x=0$ to $x=1?$

2013 Harvard-MIT Mathematics Tournament, 34

Tags: hmmt
For how many unordered sets $\{a,b,c,d\}$ of positive integers, none of which exceed $168$, do there exist integers $w,x,y,z$ such that $(-1)^wa+(-1)^xb+(-1)^yc+(-1)^zd=168$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor25e^{-3\frac{|C-A|}C}\right\rfloor$.

2019 Harvard-MIT Mathematics Tournament, 10

Fred the Four-Dimensional Fluffy Sheep is walking in 4-dimensional space. He starts at the origin. Each minute, he walks from his current position $(a_1, a_2, a_3, a_4)$ to some position $(x_1, x_2, x_3, x_4)$ with integer coordinates satisfying \[(x_1-a_1)^2 + (x_2-a_2)^2 + (x_3-a_3)^2 + (x_4-a_4)^2 = 4 \quad \text{and} \quad |(x_1 + x_2 + x_3 + x_4) - (a_1 + a_2 + a_3 + a_4)| = 2.\] In how many ways can Fred reach $(10, 10, 10, 10)$ after exactly 40 minutes, if he is allowed to pass through this point during his walk?

2013 Harvard-MIT Mathematics Tournament, 36

Tags: hmmt , euler , 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}\]

2013 Harvard-MIT Mathematics Tournament, 5

Tags: hmmt
Thaddeus is given a $2013 \times 2013$ array of integers each between $1$ and $2013$, inclusive. He is allowed two operations: 1. Choose a row, and subtract $1$ from each entry. 2. Chooses a column, and add $1$ to each entry. He would like to get an array where all integers are divisible by $2013$. On how many arrays is this possible?

2016 Harvard-MIT Mathematics Tournament, 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$.

2013 Harvard-MIT Mathematics Tournament, 3

Find the rightmost non-zero digit of the expansion of $(20)(13!)$.

2012 Harvard-MIT Mathematics Tournament, 8

Hexagon $ABCDEF$ has a circumscribed circle and an inscribed circle. If $AB = 9$, $BC = 6$, $CD = 2$, and $EF = 4$. Find $\{DE, FA\}$.

2023 Harvard-MIT Mathematics Tournament, 5

Tags: hmmt
Let $ABC$ be a triangle with $AB = 13, BC = 14, $and$ CA = 15$. Suppose $PQRS$ is a square such that $P$ and $R$ lie on line $BC, Q$ lies on line $CA$, and $S$ lies on line $AB$. Compute the side length of this square.

2000 Harvard-MIT Mathematics Tournament, 20

What is the minimum possible perimeter of a triangle two of whose sides are along the x- and y-axes and such that the third contains the point $(1,2)$?

2012 AMC 10, 23

A solid tetrahedron is sliced off a solid wooden unit cube by a plane passing through two nonadjacent vertices on one face and one vertex on the opposite face not adjacent to either of the first two vertices. The tetrahedron is discarded and the remaining portion of the cube is placed on a table with the cut surface face down. What is the height of this object? $ \textbf{(A)}\ \dfrac{\sqrt{3}}{3}\qquad\textbf{(B)}\ \dfrac{2\sqrt{2}}{3}\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ \dfrac{2\sqrt{3}}{3}\qquad\textbf{(E)}\ \sqrt{2} $

2020 Harvard-MIT Mathematics Tournament, 10

Tags: hmmt
Let $n$ be a fixed positive integer, and choose $n$ positive integers $a_1, \ldots , a_n$. Given a permutation $\pi$ on the first $n$ positive integers, let $S_{\pi}=\{i\mid \frac{a_i}{\pi(i)} \text{ is an integer}\}$. Let $N$ denote the number of distinct sets $S_{\pi}$ as $\pi$ ranges over all such permutations. Determine, in terms of $n$, the maximum value of $N$ over all possible values of $a_1, \ldots , a_n$. [i]Proposed by James Lin.[/i]

2016 HMNT, 2

Tags: hmmt
I have five different pairs of socks. Every day for five days, I pick two socks at random without replacement to wear for the day. Find the probability that I wear matching socks on both the third day and the fifth day.

2016 Harvard-MIT Mathematics Tournament, 1

Tags: hmmt , probability
DeAndre Jordan shoots free throws that are worth $1$ point each. He makes $40\%$ of his shots. If he takes two shots find the probability that he scores at least $1$ point.

2013 Harvard-MIT Mathematics Tournament, 14

Consider triangle $ABC$ with $\angle A=2\angle B$. The angle bisectors from $A$ and $C$ intersect at $D$, and the angle bisector from $C$ intersects $\overline{AB}$ at $E$. If $\dfrac{DE}{DC}=\dfrac13$, compute $\dfrac{AB}{AC}$.

1999 Harvard-MIT Mathematics Tournament, 7

Carl and Bob can demolish a building in 6 days, Anne and Bob can do it in $3$, Anne and Carl in $5$. How many days does it take all of them working together if Carl gets injured at the end of the first day and can't come back?

2016 Harvard-MIT Mathematics Tournament, 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$?

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.