Found problems: 60
Find the last two digits of $\tbinom{200}{100}$. Express the answer as an integer between $0$ and $99$. (e.g. if the last two digits are $05$, just write $5$.)
Sam's cup has a $400$ mL mixture of coffee and milk tea. He pours $200$ mL into Ben's empty cup. Ben then adds 100mL of co ee to his cup and stirs well. Finally, Ben pours $200$ mL out of his cup back into Sam's cup. If the mixture in Sam's cup is now $50\%$ milk tea, then how many milliliters of milk tea were in it originally?
A positive integer $n$ has the property that, for any $2$ integers $a$ and $b$, if $ab + 1$ is divisible by $n$, then $a + b$ is also divisible by $n$. What is the largest possible value of $n$?
Consider all right triangles with integer side lengths that form an arithmetic sequence. Compute the $2014$th smallest perimeter of all such right triangles.
A frog is hopping from $(0,0)$ to $(8,8)$. The frog can hop from $(x,y)$ to either $(x+1,y)$ or $(x,y+1)$. The frog is only allowed to hop to point $(x,y)$ if $|y-x|\leq1$. Compute the number of distinct valid paths the frog can take.
Equilateral triangle $DEF$ is inscribed inside equilateral triangle $ABC$ such that $DE$ is perpendicular to $BC$. Let $x$ be the area of triangle $ABC$ and $y$ be the area of triangle $DEF$. Compute $\tfrac{x}{y}$.
Eddy and Moor play a game with the following rules:
[list=a]
[*] The game begins with a pile of $N$ stones, where $N$ is a positive integer. [/*]
[*] The $2$ players alternate taking turns (e.g. Eddy moves, then Moor moves, then Eddy moves, and so on). [/*]
[*] During a player's turn, given $a$ stones remaining in the pile, the player may remove $b$ stones from the pile, where $\gcd(a,b)=1$ and $b\leq a$. [/*]
[*] If a player cannot make a move, they lose. [/*]
[/list]
For example, if Eddy goes first and $N=4$, then Eddy can remove $3$ stones from the pile (since $3\leq4$ and $\gcd(3,4)=1$), leaving $1$ stone in the pile. Moor can then remove $1$ stone from the pile (since $1\leq1$ and $\gcd(1,1)=1$), leaving $0$ stones in the pile. Since Eddy cannot remove stones from an empty pile, he cannot make a move, and therefore loses.
Both Eddy and Moor want to win, so they will both always make the best possible move. If Eddy moves first, for how many values of $N<2016$ can Eddy win no matter what moves Moor chooses?
The incircle of triangle $\triangle ABC$ is the unique inscribed circle that is internally tangent to the sides $\overline{AB}$, $\overline{BC}$, and $\overline{CA}$. How many non-congruent right triangles with integer side lengths have incircles of radius $2015$?
Laurie loves multiplying numbers in her head. One day she decides to multiply two $2$-digit numbers $x$ and $y$ such that $x\leq y$ and the two numbers collectively have at least three distinct digits. Unfortunately, she accidentally remembers the digits of each number in the opposite order (for example, instead of remembering $51$ she remembers $15$). Surprisingly, the product of the two numbers after flipping the digits is the same as the product of the two original numbers. How many possible pairs of numbers could Laurie have tried to multiply?
Let $r = 1-\sqrt[5]{2}+ \sqrt[5]{4}-\sqrt[5]{8}+ \sqrt[5]{16}$. There exists a unique fifth-degree polynomial $P$ such that its leading coefficient is positive, all of its coefficients are integers whose greatest common factor (among all of them) is $1$, and $P(r) = 0$. Evaluate $P(10)$.
Circles $\omega_1$ and $\omega_2$ have radii $r_1<r_2$ respectively and intersect at distinct points $X$ and $Y$. The common external tangents intersect at point $Z$. The common tangent closer to $X$ touches $\omega_1$ and $\omega_2$ at $P$ and $Q$ respectively. Line $ZX$ intersects $\omega_1$ and $\omega_2$ again at points $R$ and $S$ and lines $RP$ and $SQ$ intersect again at point $T$. If $XT=8$, $XZ=15$, and $XY=12$, then what is $\tfrac{r_1}{r_2}$?
Let $ABC$ be a triangle with $AB=24$, $BC=30$, and $AC=36$. Point $M$ lies on $BC$ such that $BM=12$, and point $N$ lies on $AC$ such that $CN=20$. Let $X$ be the intersection of $AM$ and $BN$ and let line $CX$ intersect $AB$ at point $L$. Compute
$$\frac{AX}{XM}+\frac{BX}{XN}+\frac{CX}{XL}.$$
Given that $x$ and $y$ are real numbers, compute the minimum value of
$$x^4+4x^3+8x^2+4xy+6x+4y^2+10.$$
An ant is walking on the edges of an icosahedron of side length $1$. Compute the length of the longest path that the ant can take if it never travels over the same edge twice, but is allowed to revisit vertices.
[center]<see attached>[/center]
For a given positive integer $m$, the series
$$\sum_{k=1,k\neq m}^{\infty}\frac{1}{(k+m)(k-m)}$$
evaluates to $\frac{a}{bm^2}$, where $a$ and $b$ are positive integers. Compute $a+b$.
A point is "bouncing" inside a unit equilateral triangle with vertices $(0,0)$, $(1,0)$, and $(1/2,\sqrt{3}/2)$. The point moves in straight lines inside the triangle and bounces elastically off an edge at an angle equal to the angle of incidence. Suppose that the point starts at the origin and begins motion in the direction of $(1,1)$. After the ball has traveled a cumulative distance of $30\sqrt{2}$, compute its distance from the origin.
Simplify $\sqrt{7+\sqrt{33}}-\sqrt{7-\sqrt{33}}$.
Three roots of the quartic polynomial $f(x)=x^4+ax^3+bx+c$ are $-1$, $3$, and $5$. What is $a+b-c$?
A cake in the shape of a rectangular prism has dimensions $6\text{ cm}\times14\text{ cm}\times21\text{ cm}$. It is cut into $1764$ equally sized cubes such that each cube is $1\text{ cm}^3$. Andy the ant starts at one corner of the cake and eats through the cake in a straight line to the opposite corner of the cake. How many of the $1\text{ cm}^3$ cubes does Andy bite through?
Let $ABCD$ be a convex quadrilateral such that $\vartriangle ABC$ is an equilateral triangle. Let $P$ be a point inside the quadrilateral such that $\vartriangle APD$ is an equilateral triangle and $\angle PCD = 30^o$. Suppose $CP = 6$ and $CD = 8$. The area of the triangle formed by $P$, the midpoint of $\overline{BC}$, and the midpoint of $\overline{AB}$ can be expressed in simplest radical form as $\frac{a+b\sqrt{c}}{d}$ , where $a$, $b$, $c$, and $d$ are positive integers with $gcd(a, b, d) = 1$ and with $c$ not divisible by the square of any prime. Compute $a + b + c + d$.
Compute the largest integer $N$ such that one can select $N$ different positive integers, none of which is larger than $17$, and no two of which share a common divisor greater than $1$.
Consider a round table on which $2014$ people are seated. Suppose that the person at the head of the table receives a giant plate containing all the food for supper. He then serves himself and passes the plate either right or left with equal probability. Each person, upon receiving the plate, will serve himself if necessary and similarly pass the plate either left or right with equal probability. Compute the probability that you are served last if you are seated $2$ seats away from the person at the head of the table.
Find the sum of all real numbers $x$ such that $x^4-2x^3+3x^2-2x-2014=0$.
Two quadratic polynomials $A(x)$ and $B(x)$ have a leading term of $x^2$. For some real numbers $a$ and $b$, the roots of $A(x)$ are $1$ and $a$, and the roots of $B(x)$ are $6$ and $b$. If the roots of $A(x) + B(x)$ are $a + 3$ and $b + \frac1 2$ , then compute $a^2 + b^2$.
A segment of length $1$ is drawn such that its endpoints lie on a unit circle, dividing the circle into two parts. Compute the area of the larger region.