Let $n\geq 1$ be an integer. Show that there exists an integer between $\sqrt{2n}$ and $\sqrt{5n}$, exclusive.

Let $x_1, x_2, \ldots , x_n \ (n \geq 1)$ be real numbers such that $0 \leq x_j \leq \pi, \ j = 1, 2,\ldots, n.$ Prove that if $\sum_{j=1}^n (\cos x_j +1) $ is an odd integer, then $\sum_{j=1}^n \sin x_j \geq 1.$

Write $102$ as the sum of the largest number of distinct primes.

Find the fundamental group of the topology of $ \text{SL}_2\left(\mathbb{R}\right) $ on $ \mathbb{R}^4. $

Let $a$ be a positive integer. Find all prime numbers $ p $ with the following property: there exist exactly $ p $ ordered pairs of integers $ (x, y)$, with $ 0 \leq  x, y \leq p - 1 $, such that $ p $ divides $ y^2 - x^3 - a^2x $.

For any pair of coprime positive integers $a$ and $b$, define $f(a, b)$ to be the smallest nonnegative integer $k$ such that $b \mid ak+1$. Prove that if a and b are coprime positive integers satisfying $$f(a, b) - f(b, a) = 2,$$ then there exists a prime number $p$ such that $p^2\mid a + b$. [i]Proposed by usjl[/i]

We call a triple of positive integers $(a, b, c)$ [i]harmonic [/i] if $\frac{1}{a}=\frac{1}{b}+\frac{1}{c}$. Prove that, for any given positive integer $c$, the number of harmonic triples $(a, b, c)$ is equal to the number of positive divisors of $c^2$.

A grid of cells is tiled with dominoes such that every cell is covered by exactly one domino. A subset $S$ of dominoes is chosen. Is it true that at least one of the following 2 statements is false? (1) There are $2022$ more horizontal dominoes than vertical dominoes in $S$. (2) The cells covered by the dominoes in $S$ can be tiled completely and exactly by $L$-shaped tetrominoes.

Let $a, b, c$ be positive real numbers satisfying \[a+b+c = a^2 + b^2 + c^2.\] Let \[M = \max\left(\frac{2a^2}{b} + c, \frac{2b^2}{a} + c \right) \quad \text{ and } \quad N = \min(a^2 + b^2, c^2).\] Find the minimum possible value of $M/N$.

Let $\bigoplus$ and $\bigotimes$ be two binary boolean operators, i.e. functions that send $\{\text{True}, \text{False}\}\times \{\text{True}, \text{False}\}$ to $\{\text{True}, \text{False}\}$. Find the number of such pairs $(\bigoplus, \bigotimes)$ such that $\bigoplus$ and $\bigotimes$ distribute over each other, that is, for any three boolean values $a, b, c$, the following four equations hold: 1) $c \bigotimes (a \bigoplus b) = (c \bigotimes a) \bigoplus (c \bigotimes b);$ 2) $(a \bigoplus b) \bigotimes c = (a \bigotimes c) \bigoplus (b \bigotimes c);$ 3) $c \bigoplus (a \bigotimes b) = (c \bigoplus a) \bigotimes (c \bigoplus b);$ 4) $(a \bigotimes b) \bigoplus c = (a \bigoplus c) \bigotimes (b \bigoplus c).$ [i]Proposed by Yannick Yao

Let $S$ be a set of 6 integers taken from $\{1,2,\dots,12\}$ with the property that if $a$ and $b$ are elements of $S$ with $a<b$, then $b$ is not a multiple of $a$. What is the least possible value of an element in $S$? $\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 7$

Let $x_n$ be the $n$-th non-square positive integer. Thus $x_1=2, x_2=3, x_3=5, x_4=6,$ etc. For a positive real number $x$, denotes the integer closest to it by $\langle x\rangle$. If $x=m+0.5$, where $m$ is an integer, then define $\langle x\rangle=m$. For example, $\langle 1.2\rangle =1, \langle 2.8 \rangle =3, \langle 3.5\rangle =3$. Show that $x_n=n+\langle \sqrt{n}\rangle$

Let $n>d>0$ integers. Batman, Joker, Clark play the following game in an infinite checkered board. Initially, Batman and Joker are in cells with distance $n$ and a candy is in a cell with distance $d$ to Batman. Batman is blindfold, and can only see his cell. Clark and Joker can see the whole board. The following two moves go alternately. 1 - Batman goes to an adjacent cell. If he touches Joker, Batman loses. If he touches the candy, Batman wins. If the cell is empty, Clark chooses to say loudly one of the following two words [b]hot[/b] or [b]cold[/b]. 2 - Joker goes to an adjacent cell. If he touches Batman or candy, Joker wins. Otherwise, the game continues. Determine for each $d$, the least $n$, such that Batman, and Clark can plan an strategy to ensure the Batman's win, regardless of initial positions of the Joker and of the candy. Note: Two cells are adjacent if its have a common side. The distance between two cells $X$ and $Y$ is the least $p$ such that there exist cells $X=X_0,X_1,X_2,\dots, X_p=Y$ with $X_i$ adjacent to $X_{i-1}$ for all $i=1,2,\dots,p$.

Some students on the faculty speak several languages and some - Russian only. $50$ of them know English, $50$ -- French and $50$ -- Spanish. Prove that it is possible to divide them onto $5$ groups, not necessary equal, to get $10$ of them knowing English, $10$ -- French and $10$ -- Spanish in each group.

Find the minimum value of $\int_1^e \left|\ln x-\frac{a}{x}\right|dx\ (0\leq a\leq e)$

For $n\in\mathbb{N}$, $n\geq 2$, $a_{i}, b_{i}\in\mathbb{R}$, $1\leq i\leq n$, such that \[\sum_{i=1}^{n}a_{i}^{2}=\sum_{i=1}^{n}b_{i}^{2}=1, \sum_{i=1}^{n}a_{i}b_{i}=0. \] Prove that \[\left(\sum_{i=1}^{n}a_{i}\right)^{2}+\left(\sum_{i=1}^{n}b_{i}\right)^{2}\leq n. \] [i]Cezar Lupu & Tudorel Lupu[/i]

We have $n$ positive integers greater than $1$ and less than $10000$ such that neither of them is prime but any two of them are relative prime. Find the maximum value of $n $.

$M$ is a postive real and $f:[0,\infty)\to[0,M]$ is a continuous function such that $$\int_0^\infty (1+x)f(x) dx<\infty$$ Then, prove the following inequality. $$\left(\int_0^\infty f(x) dx \right)^2 \leq 4M \int_0^\infty x f(x) dx$$ (@below, Thank you. I fixed.)

At the Rice Mathematics Tournament, 80% of contestants wear blue jeans, 70% wear tennis shoes, and 80% of those who wear blue jeans also wear tennis shoes. What fraction of people wearing tennis shoes are wearing blue jeans?

[b]p1.[/b] Let $f$ be a function such that $f(x + y) = f(x) + f(y)$ for all $x$ and $y$. Assume $f(5) = 9$. Compute $f(2015)$. [b]p2.[/b] There are six cards, with the numbers $2, 2, 4, 4, 6, 6$ on them. If you pick three cards at random, what is the probability that you can make a triangles whose side lengths are the chosen numbers? [b]p3. [/b]A train travels from Berkeley to San Francisco under a tunnel of length $10$ kilometers, and then returns to Berkeley using a bridge of length $7$ kilometers. If the train travels at $30$ km/hr underwater and 60 km/hr above water, what is the train’s average speed in km/hr on the round trip? [b]p4.[/b] Given a string consisting of the characters A, C, G, U, its reverse complement is the string obtained by first reversing the string and then replacing A’s with U’s, C’s with G’s, G’s with C’s, and U’s with A’s. For example, the reverse complement of UAGCAC is GUGCUA. A string is a palindrome if it’s the same as its reverse. A string is called self-conjugate if it’s the same as its reverse complement. For example, UAGGAU is a palindrome and UAGCUA is self-conjugate. How many six letter strings with just the characters A, C, G (no U’s) are either palindromes or self-conjugate? [b]p5.[/b] A scooter has $2$ wheels, a chair has $6$ wheels, and a spaceship has $11$ wheels. If there are $10$ of these objects, with a total of $50$ wheels, how many chairs are there? [b]p6.[/b] How many proper subsets of $\{1, 2, 3, 4, 5, 6\}$ are there such that the sum of the elements in the subset equal twice a number in the subset? [b]p7.[/b] A circle and square share the same center and area. The circle has radius $1$ and intersects the square on one side at points $A$ and $B$. What is the length of $\overline{AB}$ ? [b]p8. [/b]Inside a circle, chords $AB$ and $CD$ intersect at $P$ in right angles. Given that $AP = 6$, $BP = 12$ and $CD = 15$, find the radius of the circle. [b]p9.[/b] Steven makes nonstandard checkerboards that have $29$ squares on each side. The checkerboards have a black square in every corner and alternate red and black squares along every row and column. How many black squares are there on such a checkerboard? [b]p10.[/b] John is organizing a race around a circular track and wants to put $3$ water stations at $9$ possible spots around the track. He doesn’t want any $2$ water stations to be next to each other because that would be inefficient. How many ways are possible? [b]p11.[/b] In square $ABCD$, point $E$ is chosen such that $CDE$ is an equilateral triangle. Extend $CE$ and $DE$ to $F$ and $G$ on $AB$. Find the ratio of the area of $\vartriangle EFG$ to the area of $\vartriangle CDE$. [b]p12.[/b] Let $S$ be the number of integers from $2$ to $8462$ (inclusive) which does not contain the digit $1,3,5,7,9$. What is $S$? [b]p13.[/b] Let x, y be non zero solutions to $x^2 + xy + y^2 = 0$. Find $\frac{x^{2016} + (xy)^{1008} + y^{2016}}{(x + y)^{2016}}$ . [b]p14.[/b] A chess contest is held among $10$ players in a single round (each of two players will have a match). The winner of each game earns $2$ points while loser earns none, and each of the two players will get $1$ point for a draw. After the contest, none of the $10$ players gets the same score, and the player of the second place gets a score that equals to $4/5$ of the sum of the last $5$ players. What is the score of the second-place player? [b]p15.[/b] Consider the sequence of positive integers generated by the following formula $a_1 = 3$, $a_{n+1} = a_n + a^2_n$ for $n = 2, 3, ...$ What is the tens digit of $a_{1007}$? [b]p16.[/b] Let $(x, y, z)$ be integer solutions to the following system of equations $x^2z + y^2z + 4xy = 48$ $x^2 + y^2 + xyz = 24$ Find $\sum x + y + z$ where the sum runs over all possible $(x, y, z)$. [b]p17.[/b] Given that $x + y = a$ and $xy = b$ and $1 \le a, b \le 50$, what is the sum of all a such that $x^4 + y^4 - 2x^2y^2$ is a prime squared? [b]p18.[/b] In $\vartriangle ABC$, $M$ is the midpoint of $\overline{AB}$, point $N$ is on side $\overline{BC}$. Line segments $\overline{AN}$ and $\overline{CM}$ intersect at $O$. If $AO = 12$, $CO = 6$, and $ON = 4$, what is the length of $OM$? [b]p19.[/b] Consider the following linear system of equations. $1 + a + b + c + d = 1$ $16 + 8a + 4b + 2c + d = 2$ $81 + 27a + 9b + 3c + d = 3$ $256 + 64a + 16b + 4c + d = 4$ Find $a - b + c - d$. [b]p20.[/b] Consider flipping a fair coin $ 8$ times. How many sequences of coin flips are there such that the string HHH never occurs? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A circle is inscribed in a triangle with side lengths $8$, $13$, and $17$. Let the segments of the side of length $8$, made by a point of tangency, be $r$ and $s$, with $r<s$. What is the ratio $r:s$? ${{ \textbf{(A)}\ 1:3 \qquad\textbf{(B)}\ 2:5 \qquad\textbf{(C)}\ 1:2 \qquad\textbf{(D)}\ 2:3 }\qquad\textbf{(E)}\ 3:4 } $

Each day for four days, Linda traveled for one hour at a speed that resulted in her traveling one mile in an integer number of minutes. Each day after the first, her speed decreased so that the number of minutes to travel one mile increased by 5 minutes over the preceding day. Each of the four days, her distance traveled was also an integer number of miles. What was the total number of miles for the four trips? $\textbf{(A) }10\qquad\textbf{(B) }15\qquad\textbf{(C) }25\qquad\textbf{(D) }50\qquad\textbf{(E) }82$

$n$ cars are racing. At first they have a particular order. At each moment a car may overtake another car. No two overtaking actions occur at the same time, and except moments a car is passing another, the cars always have an order. A set of overtaking actions is called "small" if any car overtakes at most once. A set of overtaking actions is called "complete" if any car overtakes exactly once. If $F$ is the set of all possible orders of the cars after a small set of overtaking actions and $G$ is the set of all possible orders of the cars after a complete set of overtaking actions, prove that \[\mid F\mid=2\mid G\mid\] (20 points) [i]Proposed by Morteza Saghafian[/i]

Seven cubes, whose volumes are $1$, $8$, $27$, $64$, $125$, $216$, and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units? $\textbf{(A) } 644 \qquad \textbf{(B) } 658 \qquad \textbf{(C) } 664 \qquad \textbf{(D) } 720 \qquad \textbf{(E) } 749$

For some positive integer $n,$ Elmo writes down the equation \[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\] Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation \[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\] Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$? [i]Srinivas Arun[/i]