For a natural number $n \ge 3$ we denote by $M(n)$ the minimum number of unit squares that must be coloured in a $6 \times n$ rectangle so that any possible $2 \times 3$ rectangle (it can be rotated, but it must be contained inside and cannot be cut) contains at least one coloured unit square. Is it true that for every natural $n \ge 3$ the number $M(n)$ can be expressed as $M(n)=p_n+k_n^3$, where $p_n$ is a prime and $k_n$ is a natural number?

Determine the sign of $ \int_{\frac{1}{2}}^2 \frac{\ln t}{1\plus{}t^n}\ dt\ (n\equal{}1, 2, \cdots)$.

Six quadratic mirrors are put together to form a cube $ABCDEFGH$ with a mirrored interior. At each of the eight vertices, there is a tiny hole through which a laser beam can enter and leave the cube. A laser beam enters the cube at vertex $A$ in a direction not parallel to any of the cube's sides. If the beam hits a side, it is reflected; if it hits an edge, the light is absorbed, and if it hits a vertex, it leaves the cube. For each positive integer $n$, determine the set of vertices where the laser beam can leave the cube after exactly $n$ reflections.

What is the smallest non-square positive integer that is the product of four prime numbers (not necessarily distinct)?

In an $n$-element set $S$, several subsets $A_1, A_2, \ldots , A_k$ are distinguished, each consists of at least two, but not all elements of $S$. What is the largest $k$ that it’s possible to write down the elements of $S$ in a row in the order such that we don’t find all of the element of an $A_i$ set in the consecutive elements of the row?

A two-digit number $\overline{ab}$ is [i]self-loving[/i] if $a$ and $b$ are relatively prime positive integers and $\overline{ab}$ is divisible by $a+b$. How many self-loving numbers are there? [i]Proposed by Anthony Yang and Andy Xu[/i]

Let $ABC$ be an acute triangle and let $X, Y , Z$ denote the midpoints of the shorter arcs $BC, CA, AB$ of its circumcircle, respectively. Let $M$ be an arbitrary point on side $BC$. The line through $M$, parallel to the inner angular bisector of $\angle CBA$ meets the outer angular bisector of $\angle BCA$ at point $N$. The line through $M$, parallel to the inner angular bisector of $\angle BCA$ meets the outer angular bisector of $\angle CBA$ at point $P$. Prove that lines $XM, Y N, ZP$ pass through a single point.

Prove that there exists a subset $S$ of positive integers such that we can represent each positive integer as difference of two elements of $S$ in exactly one way.

Let $ABC$ be a triangle with $\angle BAC = 90^o$. Angle bisector of the $\angle CBA$ intersects the segment $(AB)$ at point $E$. If there exists $D \in (CE)$ so that $\angle DAC = \angle BDE =x^o$ , calculate $x$.

Let $n > 2$ be a fixed positive integer. For a set $S$ of $n$ points in the plane, let $P(S)$ be the set of perpendicular bisectors of pairs of distinct points in $S$. Call set $S$ [i]complete[/i] if no two (distinct) pairs of points share the same perpendicular bisector, and every pair of lines in $P(S)$ intersects. Let $f(S)$ be the number of distinct intersection points of pairs of lines in $P(S)$. (a) Find all complete sets $S$ such that $f(S) = 1$. (b) Let $S$ be a complete set with $n$ points. Show that if $f(S)>1$, then $f(S) \geq n$.

The exchange rate in a Funny-Money machine is $s$ McLoonies for a Loonie or $\frac{1}{s}$ Loonies for a McLoonie, where $s$ is a positive real number. The number of coins returned is rounded off to the nearest integer. If it is exactly in between two integers, then it is rounded up to the greater integer. $(a)$ Is it possible to achieve a one-time gain by changing some Loonies into McLoonies and changing all the McLoonies back to Loonies? $(b)$ Assuming that the answer to $(a)$ is "yes", is it possible to achieve multiple gains by repeating this procedure, changing all the coins in hand and back again each time?

Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same chair and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done? $ \textbf{(A) }14\qquad\textbf{(B) }16\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad\textbf{(E) }24 $

Let $P$, $Q$, and $R$ be the points where the incircle of a triangle $ABC$ touches the sides $AB$, $BC$, and $CA$, respectively. Prove the inequality $\frac{BC} {PQ} + \frac{CA} {QR} + \frac{AB} {RP} \geq 6$.

For $ f(x)\equal{}1\minus{}\sin x$, let $ g(x)\equal{}\int_0^x (x\minus{}t)f(t)\ dt.$ Show that $ g(x\plus{}y)\plus{}g(x\minus{}y)\geq 2g(x)$ for any real numbers $ x,\ y.$

Medians divide the triangle onto $6$ smaller ones. $4$ of the circles inscribed in those small ones are equal. Prove that the triangle is equilateral.

Ephram Chun is a senior and math captain at Lexington High School. He is well-loved by the freshmen, who seem to only listen to him. Other than being the father figure that the freshmen never had, Ephramis also part of the Science Bowl and Science Olympiad teams along with being part of the highest orchestra LHS has to offer. His many hobbies include playing soccer, volleyball, and the many forms of chess. We hope that he likes the questions that we’ve dedicated to him! [b]p1.[/b] Ephram is scared of freshmen boys. How many ways can Ephram and $4$ distinguishable freshmen boys sit together in a row of $5$ chairs if Ephram does not want to sit between $2$ freshmen boys? [b]p2.[/b] Ephram, who is a chess enthusiast, is trading chess pieces on the black market. Pawns are worth $\$100$, knights are worth $\$515$, and bishops are worth $\$396$. Thirty-four minutes ago, Ephrammade a fair trade: $5$ knights, $3$ bishops, and $9$ rooks for $8$ pawns, $2$ rooks, and $11$ bishops. Find the value of a rook, in dollars. [b]p3.[/b] Ephramis kicking a volleyball. The height of Ephram’s kick, in feet, is determined by $$h(t) = - \frac{p}{12}t^2 +\frac{p}{3}t ,$$ where $p$ is his kicking power and $t$ is the time in seconds. In order to reach the height of $8$ feet between $1$ and $2$ seconds, Ephram’s kicking power must be between reals $a$ and $b$. Find is $100a +b$. [b]p4.[/b] Disclaimer: No freshmen were harmed in the writing of this problem. Ephram has superhuman hearing: He can hear sounds up to $8$ miles away. Ephramstands in the middle of a $8$ mile by $24$ mile rectangular grass field. A freshman falls from the sky above a point chosen uniformly and randomly on the grass field. The probability Ephram hears the freshman bounce off the ground is $P\%$. Find $P$ rounded to the nearest integer. [img]https://cdn.artofproblemsolving.com/attachments/4/4/29f7a5a709523cd563f48176483536a2ae6562.png[/img] [b]p5.[/b] Ephram and Brandon are playing a version of chess, sitting on opposite sides of a $6\times 6$ board. Ephram has $6$ white pawns on the row closest to himself, and Brandon has $6$ black pawns on the row closest to himself. During each player’s turn, their only legal move is to move one pawn one square forward towards the opposing player. Pawns cannot move onto a space occupied by another pawn. Players alternate turns, and Ephram goes first (of course). Players take turns until there are no more legal moves for the active player, at which point the game ends. Find the number of possible positions the game can end in. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].