For any real number $a$, find all real numbers $x$ that satisfy the following equation. $$(2x + 1)^4 + ax(x + 1) - \frac{x}{2}= 0$$

A [i]triangulation[/i] of a polygon is a subdivision of the polygon into triangles meeting edge to edge, with the property that the set of triangle vertices coincides with the set of vertices of the polygon. Adam randomly selects a triangulation of a regular $180$-gon. Then, Bob selects one of the $178$ triangles in this triangulation. The expected number of $1^\circ$ angles in this triangle can be expressed as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

Ryan is messing with Brice’s coin. He weights the coin such that it comes up on one side twice as frequently as the other, and he chooses whether to weight heads or tails more with equal probability. Brice flips his modified coin twice and it lands up heads both times. The probability that the coin lands up heads on the next flip can be expressed in the form $\tfrac{p}{q}$ for positive integers $p, q$ satisfying $\gcd(p, q) = 1$, what is $p + q$?

Let $H$ a regular hexagon and let $P$ a point in the plane of $H$. Let $V(P)$ the sum of the distances from $P$ to the vertices of $H$ and let $L(P)$ the sum of the distances from $P$ to the edges of $H$. a) Find all points $P$ so that $L(P)$ is minimun b) Find all points $P$ so that $V(P)$ is minimun

Consider the part of a lattice given by the corners $(0, 0), (n, 0), (n, 2)$ and $(0, 2)$. From a lattice point $(a, b)$ one can move to $(a + 1, b)$ or to $(a + 1, b + 1)$ or to $(a, b - 1$), provided that the second point is also contained in the part of the lattice. How many ways are there to move from $(0, 0)$ to $(n, 2)$ considering these rules?

Three wooden equilateral triangles of side length $18$ inches are placed on axles as shown in the diagram to the right. Each axle is $30$ inches from the other two axles. A $144$-inch leather band is wrapped around the wooden triangles, and a dot at the top corner is painted as shown. The three triangles are then rotated at the same speed and the band rotates without slipping or stretching. Compute the length of the path that the dot travels before it returns to its initial position at the top corner. [asy] size(150); defaultpen(linewidth(0.8)+fontsize(10)); pair A=origin,B=(48,0),C=rotate(60,A)*B; path equi=(0,0)--(18,0)--(9,9*sqrt(3))--cycle,circ=circle(centroid(A,B,C)*18/48,1/3); picture a; fill(a,equi,grey); fill(a,circ,white); add(a); add(shift(15,15*sqrt(3))*a); add(shift(30,0)*a); draw(A--B--C--cycle,linewidth(1)); path top = circle(C,2/3); unfill(top); draw(top); real r=-5/2; draw((9,r+1)--(9,r-1)^^(9,r)--(39,r)^^(39,r-1)--(39,r+1)); label("$30$",(24,r),S); [/asy]

Let $N_2$ be the answer to problem 2. On a number line, Tanya circles the first $\ell$ positive integers. Then, starting with the greatest number in the most recent circle, she circles the next $\ell$ positive integers, so that the two circles have exactly one number in common; she repeats this until $N_2$ is in a circle. Compute the sum of all possible values of $\ell$ for which $N_2$ is the greatest number in a circle.

Determine the number of $ 8$-tuples of nonnegative integers $ (a_1,a_2,a_3,a_4,b_1,b_2,b_3,b_4)$ satisfying $ 0\le a_k\le k$, for each $ k \equal{} 1,2,3,4$, and $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \plus{} 2b_1 \plus{} 3b_2 \plus{} 4b_3 \plus{} 5b_4 \equal{} 19$.

For function $f:\mathbb Z^+ \to \mathbb R$ and coprime positive integers $p,q$ ; define $f_p,f_q$ as $$f_p(x)=f(px)-f(x), f_q(x)=f(qx)-f(x) \space \space (x\in\mathbb Z^+)$$ $f$ satisfies following conditions. $ $ $ $ $(i)$ $ $ for all $r$ that isn't multiple of $pq$, $f(r)=0$ $ $ $ $ $(ii)$ $ $ $\exists m\in \mathbb Z^+$ $ $ $s.t.$ $ $ $\forall x\in \mathbb Z^+, f_p(x+m)=f_p(x)$ and $f_q(x+m)=f_q(x)$ Prove that if $x\equiv y$ $ $ $(mod m)$, then $f(x)=f(y)$ $ $ ($x, y\in \mathbb Z^+$).

What is the largest integer $n$ such that $n$ is divisible by every integer less than $\sqrt[3]{n}$?

Fix an integer $n \ge 2$, let $Q_n$ be the graph consisting of all vertices and all edges of an $n$-cube, and let $T$ be a spanning tree in $Q_n$. Show that $Q_n$ has an edge whose adjunction to $T$ produces a simple cycle of length at least $2n$.

Let $m,n$ be positive integers greater than $1$. We define the sets $P_m=\left\{\frac{1}{m},\frac{2}{m},\cdots,\frac{m-1}{m}\right\}$ and $P_n=\left\{\frac{1}{n},\frac{2}{n},\cdots,\frac{n-1}{n}\right\}$. Find the distance between $P_m$ and $P_n$, that is defined as \[\min\{|a-b|:a\in P_m,b\in P_n\}\]

Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

Given is a nonzero integer $k$. Prove that equation $k =\frac{x^2 - xy + 2y^2}{x + y}$ has an odd number of ordered integer pairs $(x, y)$ just when $k$ is divisible by seven.

For $t \ge 2$, define $S(t)$ as the number of times $t$ divides into $t!$. We say that a positive integer $t$ is a [i]peak[/i] if $S(t) > S(u)$ for all values of $u < t$. Prove or disprove the following statement: For every prime $p$, there is an integer $k$ for which $p$ divides $k$ and $k$ is a peak.

Symedians of an acute-angled non-isosceles triangle $ABC$ intersect at a point at point $L$, and $AA_1$, $BB_1$ and $CC_1$ are its altitudes. Prove that you can construct equilateral triangles $A_1B_1C'$, $B_1C_1A'$ and $C_1A_1B'$ not lying in the plane $ABC$, so that lines $AA' , BB'$ and $CC'$ and also perpendicular to the plane $ABC$ at point $L$ intersected at one point.

The map below shows an east/west road connecting the towns of Acorn, Centerville, and Midland, and a north/south road from Centerville to Drake. The distances from Acorn to Centerville, from Centerville to Midland, and from Centerville to Drake are each 60 kilometers. At noon Aaron starts at Acorn and bicycles east at 17 kilometers per hour, Michael starts at Midland and bicycles west at 7 kilometers per hour, and David starts at Drake and bicycles at a constant rate in a straight line across an open field. All three bicyclists arrive at exactly the same time at a point along the road from Centerville to Midland. Find the number of kilometers that David bicycles. For the map go to http://www.purplecomet.org/welcome/practice

Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$. [i]Proposed by Evan Chen[/i]

Given a positive integer $n$, determine all functions $f$ from the first $n$ positive integers to the positive integers, satisfying the following two conditions: [b](1)[/b] $\sum_{k=1}^{n}{f(k)}=2n$; and [b](2)[/b] $\sum_{k\in K}{f(k)}=n$ for no subset $K$ of the first $n$ positive integers.

Let $ ABC $ be an acute triangle. Denote by $ D $ the foot of the perpendicular line drawn from the point $ A $ to the side $ BC $, by $M$ the midpoint of $ BC $, and by $ H $ the orthocenter of $ ABC $. Let $ E $ be the point of intersection of the circumcircle $ \Gamma $ of the triangle $ ABC $ and the half line $ MH $, and $ F $ be the point of intersection (other than $E$) of the line $ ED $ and the circle $ \Gamma $. Prove that $ \tfrac{BF}{CF} = \tfrac{AB}{AC} $ must hold. (Here we denote $XY$ the length of the line segment $XY$.)

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

Let $a_0,a_1,\dots,a_n \in \mathbb N$. Prove that there exist positive integers $b_0,b_1,\dots,b_n$ such that for $0 \leq i \leq n : a_i \leq b_i \leq 2a_i$ and polynomial \[P(x) = b_0 + b_1 x + \dots + b_n x^n\] is irreducible over $\mathbb Q[x]$. (10 points)

Let $n>100$ be a positive integer and originally the number $1$ is written on the blackboard. Petya and Vasya play the following game: every minute Petya represents the number of the board as a sum of two distinct positive fractions with coprime nominator and denominator and Vasya chooses which one to delete. Show that Petya can play in such a manner, that after $n$ moves, the denominator of the fraction left on the board is at most $2^n+50$, no matter how Vasya acts.

Republic has $n \geq 2$ cities, between some pairs of cities there are non-directed flight routes. From each city it is possible to get to any other city, and we will call the minimal number of flights required to do that the [i]distance[/i] between the cities. For every city consider the biggest distance to another city. It turned out that for every city this number is equal to $m$. Find all values $m$ can attain for given $n$

Find all continuous real functions $ f,g$ and $ h$ defined on the set of positive real numbers and satisfying the relation \[ f(x\plus{}y)\plus{}g(xy)\equal{}h(x)\plus{}h(y)\] for all $ x>0$ and $ y>0$. [i]Z. Daroczy[/i]