Found problems: 15
2006 Harvard-MIT Mathematics Tournament, 1
Larry can swim from Harvard to MIT (with the current of the Charles River) in $40$ minutes, or back (against the current) in $45$ minutes. How long does it take him to row from Harvard to MIT, if he rows the return trip in $15$ minutes? (Assume that the speed of the current and Larry’s swimming and rowing speeds relative to the current are all constant.) Express your answer in the format mm:ss.
2008 Harvard-MIT Mathematics Tournament, 7
Let $ C_1$ and $ C_2$ be externally tangent circles with radius 2 and 3, respectively. Let $ C_3$ be a circle internally tangent to both $ C_1$ and $ C_2$ at points $ A$ and $ B$, respectively. The tangents to $ C_3$ at $ A$ and $ B$ meet at $ T$, and $ TA \equal{} 4$. Determine the radius of $ C_3$.
2018 HMIC, 2
Consider a finite set of points $T\in\mathbb{R}^n$ contained in the $n$-dimensional unit ball centered at the origin, and let $X$ be the convex hull of $T$. Prove that for all positive integers $k$ and all points $x\in X$, there exist points $t_1, t_2, \dots, t_k\in T$, not necessarily distinct, such that their centroid
\[\frac{t_1+t_2+\dots+t_k}{k}\]has Euclidean distance at most $\frac{1}{\sqrt{k}}$ from $x$.
(The $n$-dimensional unit ball centered at the origin is the set of points in $\mathbb{R}^n$ with Euclidean distance at most $1$ from the origin. The convex hull of a set of points $T\in\mathbb{R}^n$ is the smallest set of points $X$ containing $T$ such that each line segment between two points in $X$ lies completely inside $X$.)
2018 HMIC, 1
Let $m>1$ be a fixed positive integer. For a nonempty string of base-ten digits $S$, let $c(S)$ be the number of ways to split $S$ into contiguous nonempty strings of digits such that the base-ten number represented by each string is divisible by $m$. These strings are allowed to have leading zeroes.
In terms of $m$, what are the possible values that $c(S)$ can take?
For example, if $m=2$, then $c(1234)=2$ as the splits $1234$ and $12|34$ are valid, while the other six splits are invalid.
2014 NIMO Problems, 8
Three of the below entries, with labels $a$, $b$, $c$, are blatantly incorrect (in the United States).
What is $a^2+b^2+c^2$?
041. The Gentleman's Alliance Cross
042. Glutamine (an amino acid)
051. Grant Nelson and Norris Windross
052. A compact region at the center of a galaxy
061. The value of \verb+'wat'-1+. (See \url{https://www.destroyallsoftware.com/talks/wat}.)
062. Threonine (an amino acid)
071. Nintendo Gamecube
072. Methane and other gases are compressed
081. A prank or trick
082. Three carbons
091. Australia's second largest local government area
092. Angoon Seaplane Base
101. A compressed archive file format
102. Momordica cochinchinensis
111. Gentaro Takahashi
112. Nat Geo
121. Ante Christum Natum
122. The supreme Siberian god of death
131. Gnu C Compiler
132. My TeX Shortcut for $\angle$.
2008 Harvard-MIT Mathematics Tournament, 1
Four students from Harvard, one of them named Jack, and five students from MIT, one of them named Jill, are going to see a Boston Celtics game. However, they found out that only $ 5$ tickets remain, so $ 4$ of them must go back. Suppose that at least one student from each school must go see the game, and at least one of Jack and Jill must go see the game, how many ways are there of choosing which $ 5$ people can see the game?
2023 CCA Math Bonanza, L4.1
A pack of MIT students are holding an escape room, where students may compete in teams of 4, 5, or 6. There is \$60 dollars worth of prize money in Amazon gift cards for the winning team. If each gift card can contain any whole number of dollars, what is the minimum number of gift cards required so that the prize money can be distributed evenly among any team?
[i]Lightning 4.1[/i]
2018 HMIC, 5
Let $G$ be an undirected simple graph. Let $f(G)$ be the number of ways to orient all of the edges of $G$ in one of the two possible directions so that the resulting directed graph has no directed cycles. Show that $f(G)$ is a multiple of $3$ if and only if $G$ has a cycle of odd length.
2005 Brazil Undergrad MO, 6
Prove that for any natural numbers $0 \leq i_1 < i_2 < \cdots < i_k$ and $0 \leq j_1 < j_2 < \cdots < j_k$, the matrix $A = (a_{rs})_{1\leq r,s\leq k}$, $a_{rs} = {i_r + j_s\choose i_r} = {(i_r + j_s)!\over i_r!\, j_s!}$ ($1\leq r,s\leq k$) is nonsingular.
2018 HMIC, 3
A polygon in the plane (with no self-intersections) is called $\emph{equitable}$ if every line passing through the origin divides the polygon into two (possibly disconnected) regions of equal area.
Does there exist an equitable polygon which is not centrally symmetric about the origin?
(A polygon is centrally symmetric about the origin if a $180$-degree rotation about the origin sends the polygon to itself.)
2014 PUMaC Team, 0
Your team receives up to $100$ points total for the team round. To play this minigame for up to $10$ bonus points, you must decide how to construct an optimal army with number of soldiers equal to the points you receive.
Construct an army of $100$ soldiers with $5$ flanks; thus your army is the union of battalions $B_1$, $B_2$, $B_3$, $B_4$, and $B_5$. You choose the size of each battalion such that $|B_1|+|B_2|+|B_3|+|B_4|+|B_5|=100$. The size of each batallion must be integral and non-negative. Then, suppose you receive $n$ points for the Team Round. We will then "supply" your army as follows: if $n>B_1$, we fill in battalion $1$ so that it has $|B_1|$ soldiers; then repeat for the next battalion with $n-|B_1|$ soldiers. If at some point there are not enough soldiers to fill the battalion, the remainder will be put in that battalion and subsequent battalions will be empty. (Ex: suppose you tell us to form battalions of size $\{20,30,20,20,10\}$, and your team scores $73$ points. Then your battalions will actually be $\{20,30,20,3,0\}$.)
Your team's army will then "fight" another's. The $B_i$ of both teams will be compared with the other $B_i$, and the winner of the overall war is the army who wins the majority of the battalion fights. The winner receives $1$ victory point, and in case of ties, both teams receive $\tfrac12$ victory points.
Every team's army will fight everyone else's and the team war score will be the sum of the victory points won from wars. The teams with ranking $x$ where $7k\leq x\leq 7(k+1)$ will earn $10-k$ bonus points.
For example: Team Princeton decides to allocate its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $20$, $20$, $20$, $20$, $20$. Team MIT allocates its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $10$, $10$, $10$, $10$, $60$. Now suppose Princeton scores $80$ points on the Team Round, and MIT scores $90$ points. Then after supplying, the armies will actually look like $\{20, 20, 20, 20, 0\}$ for Princeton and $\{10, 10, 10, 10, 50\}$ for MIT. Then note that in a war, Princeton beats MIT in the first four battalion battles while MIT only wins the last battalion battle; therefore Princeton wins the war, and Princeton would win $1$ victory point.
2012 Iran MO (3rd Round), 4
The incircle of triangle $ABC$ for which $AB\neq AC$, is tangent to sides $BC,CA$ and $AB$ in points $D,E$ and $F$ respectively. Perpendicular from $D$ to $EF$ intersects side $AB$ at $X$, and the second intersection point of circumcircles of triangles $AEF$ and $ABC$ is $T$. Prove that $TX\perp TF$.
[i]Proposed By Pedram Safaei[/i]
2018 HMIC, 4
Find all functions $f: \mathbb{R}^+\to\mathbb{R}^+$ such that
\[f(x+f(y+xy))=(y+1)f(x+1)-1\]for all $x,y\in\mathbb{R}^+$.
($\mathbb{R}^+$ denotes the set of positive real numbers.)
2014 Putnam, 5
Let $P_n(x)=1+2x+3x^2+\cdots+nx^{n-1}.$ Prove that the polynomials $P_j(x)$ and $P_k(x)$ are relatively prime for all positive integers $j$ and $k$ with $j\ne k.$
2013 Harvard-MIT Mathematics Tournament, 36
(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}\]