Alex, Bob, and Chris are driving cars down a road at distinct constant rates. All people are driving a positive integer number of miles per hour. All of their cars are $15$ feet long. It takes Alex $1$ second longer to completely pass Chris than it takes Bob to completely pass Chris. The passing time is defined as the time where their cars overlap. Find the smallest possible sum of their speeds, in miles per hour. [i]Proposed by Sammy Charney[/i]

Let $M=\bigoplus_{i \in \mathbb{Z}} \mathbb{C}e_i$ be an infinite dimensional $\mathbb{C}$-vector space, and let $\text{End}(M)$ denote the $\mathbb{C}$-algebra of $\mathbb{C}$-linear endomorphisms of $M$. Let $A$ and $B$ be two commuting elements in $\text{End}(M)$ satisfying the following condition: there exist integers $m \le n<0<p \le q$ satisfying $\text{gd}(-m,p)=\text{gcd}(-n,q)=1$, and such that for every $j \in \mathbb{Z}$, one has \[Ae_j=\sum_{i=j+m}^{j+n} a_{i,j}e_i, \quad \text{with } a_{i,j} \in \mathbb{C}, a_{j+m,j}a_{j+n,j} \ne 0,\] \[Be_j=\sum_{i=j+p}^{j+q} b_{i,j}e_i, \quad \text{with } b_{i,j} \in \mathbb{C}, b_{j+p,j}b_{j+q,j} \ne 0.\] Let $R \subset \text{End}(M)$ be the $\mathbb{C}$-subalgebra generated by $A$ and $B$. Note that $R$ is commutative and $M$ can be regarded as an $R$-module. (a) Show that $R$ is an integral domain and is isomorphic to $R \cong \mathbb{C}[x,y]/f(x,y)$, where $f(x,y)$ is a non-zero polynomial such that $f(A,B)=0$. (b) Let $K$ be the fractional field of $R$. Show that $M \otimes_R K$ is a $1$-dimensional vector space over $K$.

Let $x, y$, and $z$ be integers with $z>1$. Show that \[(x+1)^{2}+(x+2)^{2}+\cdots+(x+99)^{2}\neq y^{z}.\]

Juan rolls a fair regular octahedral die marked with the numbers $ 1$ through $ 8$. Then Amal rolls a fair six-sided die. What is the probability that the product of the two rolls is a multiple of $ 3$? $ \textbf{(A)}\ \frac{1}{12} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{1}{2} \qquad \textbf{(D)}\ \frac{7}{12} \qquad \textbf{(E)}\ \frac{2}{3}$

There are $n$ distinct points on a circumference. Choose one of the points. Connect this point and the $m$th point from the chosen point counterclockwise with a segment. Connect this $m$th point and the $m$th point from this $m$th point counterclockwise with a segment. Repeat such steps until no new segment is constructed. From the intersections of the segments, let the number of the intersections - which are in the circle - be $I$. Answer the following questions ($m$ and $n$ are positive integers that are relatively prime and they satisfy $6 \leq 2m < n$). 1) When the $n$ points take different positions, express the maximum value of $I$ in terms of $m$ and $n$. 2) Prove that $I \geq n$. Prove that there is a case, which is $I=n$, when $m=3$ and $n$ is arbitrary even number that satisfies the condition.

In year $2525$ the QED has $3n + 1$ members, of which $n$ are identical robots and $2n + 1$ (uncloned and therefore distinguishable) people. For the $263^{th}$ board election in Wurzburg there will be exactly $n$ members. Find out how many distinguishable compositions are conceivable for this.

Find $\sum_{k=1}^{3n} \frac{1}{\int_0^1 x(1-x)^k\ dx}$. [i]2011 Hosei University entrance exam/Design and Enginerring[/i]

Let $ ABCD$ be a convex quadrilateral. We have that $ \angle BAC\equal{}3\angle CAD$, $ AB\equal{}CD$, $ \angle ACD\equal{}\angle CBD$. Find angle $ \angle ACD$

Let $n \ge 2$ be a fixed positive integer. An integer will be called "$n$-free" if it is not a multiple of an $n$-th power of a prime. Let $M$ be an infinite set of rational numbers, such that the product of every $n$ elements of $M$ is an $n$-free integer. Prove that $M$ contains only integers.

$a, b, c, d$ are integers such that $ad + bc$ divides each of $a, b, c$ and $d$. Prove that $ad + bc =\pm 1$

At a circular track, $2n$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $n^2$ meetings.

Which process is exothermic? $ \textbf{(A)}\hspace{.05in}\text{condensation} \qquad\textbf{(B)}\hspace{.05in}\text{fusion} \qquad\textbf{(C)}\hspace{.05in}\text{sublimation} \qquad\textbf{(D)}\hspace{.05in}\text{vaporization} \qquad $

The letters $R, M$, and $O$ represent whole numbers. If $R \times M \times O = 240$, $R \times O + M =46$ and $R + M \times O = 64$, what is the value of $R + M + O$?

Let $P(x)$ be a nonzero polynomial such that $(x-1)P(x+1)=(x+2)P(x)$ for every real $x$, and $\left(P(2)\right)^2 = P(3)$. Then $P(\tfrac72)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let's call the "Soros product" of two different numbers, $a$ and $b$, the number $a + b + ab$. Is it possible, based on numbers $1$ and $4$, after repeated application of this operation to the already obtained products, to obtain: a) the number $1999$? b) the number $2000$?

Let $a$, $b$, $c$ be positive real numbers such that $abc=1$. Prove that \[\frac a{a^{2}+2}+\frac b{b^{2}+2}+\frac c{c^{2}+2}\leq 1 \]

Let $n$ denote the product of the first $2013$ primes. Find the sum of all primes $p$ with $20 \le p \le 150$ such that (i) $\frac{p+1}{2}$ is even but is not a power of $2$, and (ii) there exist pairwise distinct positive integers $a,b,c$ for which \[ a^n(a-b)(a-c) + b^n(b-c)(b-a) + c^n(c-a)(c-b) \] is divisible by $p$ but not $p^2$. [i]Proposed by Evan Chen[/i]

For all integers $x,y,z$, let \[S(x,y,z) = (xy - xz, yz-yx, zx - zy).\] Prove that for all integers $a$, $b$ and $c$ with $abc>1$, and for every integer $n\geq n_0$, there exists integers $n_0$ and $k$ with $0<k\leq abc$ such that \[S^{n+k}(a,b,c) \equiv S^n(a,b,c) \pmod {abc}.\] ($S^1 = S$ and for every integer $m\geq 1$, $S^{m+1} = S \circ S^m.$ $(u_1, u_2, u_3) \equiv (v_1, v_2, v_3) \pmod M \Longleftrightarrow u_i \equiv v_i \pmod M (i=1,2,3).$)

Two players play a game on a pile of $n$ beans. On each player's turn, they may take exactly $1$, $4$, or $7$ beans from the pile. One player goes first, and then the players alternate until somebody wins. A player wins when they take the last bean from the pile. For how many $n$ between $2014$ and $2050$ (inclusive) does the second player win?

Let $ABCD$ be a convex quadrilateral with $\angle DAB=\angle BCD=90^{\circ}$ and $\angle ABC> \angle CDA$. Let $Q$ and $R$ be points on segments $BC$ and $CD$, respectively, such that line $QR$ intersects lines $AB$ and $AD$ at points $P$ and $S$, respectively. It is given that $PQ=RS$.Let the midpoint of $BD$ be $M$ and the midpoint of $QR$ be $N$.Prove that the points $M,N,A$ and $C$ lie on a circle.

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

In the plane of traingle $ABC$ we consider a variable point $M$ which moves on line $MA$ towards $A$. Halfway there, it stops and starts moving in a straight line line towards $B$. Halfway there, it stops and starts moving in a straight line towards $C$, and halfway there it stops and starts moving in a straight line towards $A$, and so on. Show that $M$ will get as close as we want to the vertices of a fixed triangle with area $\text{area}(ABC)/7$.

(a) Determine all pairs $(x, y)$ of (real) numbers with $0 < x < 1$ and $0 <y < 1$ for which $x + 3y$ and $3x + y$ are both integer. An example is $(x,y) =( \frac{8}{3}, \frac{7}{8}) $, because $ x+3y =\frac38 +\frac{21}{8} =\frac{24}{8} = 3$ and $ 3x+y = \frac98 + \frac78 =\frac{16}{8} = 2$. (b) Determine the integer $m > 2$ for which there are exactly $119$ pairs $(x,y)$ with $0 < x < 1$ and $0 < y < 1$ such that $x + my$ and $mx + y$ are integers. Remark: if $u \ne v,$ the pairs $(u, v)$ and $(v, u)$ are different.

Let $\mathbb N$ denote the set of all positive integers. Find all real numbers $c$ for which there exists a function $f:\mathbb N\to \mathbb N$ satisfying: [list] [*] for any $x,a\in\mathbb N$, the quantity $\frac{f(x+a)-f(x)}{a}$ is an integer if and only if $a=1$; [*] for all $x\in \mathbb N$, we have $|f(x)-cx|<2023$. [/list] [i]Proposed by Sutanay Bhattacharya[/i]

Do either $(1)$ or $(2)$: $(1)$ Let $C_a$ be the curve $(y - a^2)^2 = x^2(a^2 - x^2).$ Find the curve which touches all $C_a$ for $a > 0.$ Sketch the solution and at least two of the $C_a.$ $(2)$ Given that $(1 - hx)^{-1}(1 - kx)^{-1} = \sum_{i\geq0}a_i x^i,$ prove that $(1 + hkx)(1 - hkx)^{-1}(1 - h^2x)^{-1}(1 - k^2x)^{-1} = \sum_{i\geq0} a_i^2 x^i.$