How many ways are there to arrange the numbers $1$ through $8$ into a $2$ by $4$ grid such that the sum of the numbers in each of the two rows are all multiples of $6,$ and the sum of the numbers in each of the four columns are all multiples of $3$?

Prove that for all positive integers $n\geq 1$ the number $\prod^n_{k=1} k^{2k-n-1}$ is also an integer number. [i]Laurentiu Panaitopol[/i].

[b]p1. [/b] If $f(x) = 3x - 1$, what is $f^6(2) = (f \circ f \circ f \circ f \circ f \circ f)(2)$? [b]p2.[/b] A frog starts at the origin of the $(x, y)$ plane and wants to go to $(6, 6)$. It can either jump to the right one unit or jump up one unit. How many ways are there for the frog to jump from the origin to $(6, 6)$ without passing through point $(2, 3)$? [b]p3.[/b] Alfred, Bob, and Carl plan to meet at a café between noon and $2$ pm. Alfred and Bob will arrive at a random time between noon and $2$ pm. They will wait for $20$ minutes or until $2$ pm for all $3$ people to show up after which they will leave. Carl will arrive at the café at noon and leave at $1:30$ pm. What is the probability that all three will meet together? [b]p4.[/b] Let triangle $ABC$ be isosceles with $AB = AC$. Let $BD$ be the altitude from $ B$ to $AC$, $E$ be the midpoint of $AB$, and $AF$ be the altitude from $ A$ to $BC$. If $AF = 8$ and the area of triangle $ACE$ is $ 8$, find the length of $CD$. [b]p5.[/b] Find the sum of the unique prime factors of $(2018^2 - 121) \cdot (2018^2 - 9)$. [b]p6.[/b] Compute the remainder when $3^{102} + 3^{101} + ... + 3^0$ is divided by $101$. [b]p7.[/b] Take regular heptagon $DUKMATH$ with side length $ 3$. Find the value of $$\frac{1}{DK}+\frac{1}{DM}.$$ [b]p8.[/b] RJ’s favorite number is a positive integer less than $1000$. It has final digit of $3$ when written in base $5$ and final digit $4$ when written in base $6$. How many guesses do you need to be certain that you can guess RJ’s favorite number? [b]p9.[/b] Let $f(a, b) = \frac{a^2+b^2}{ab-1}$ , where $a$ and $b$ are positive integers, $ab \ne 1$. Let $x$ be the maximum positive integer value of $f$, and let $y$ be the minimum positive integer value of f. What is $x - y$ ? [b]p10.[/b] Haoyang has a circular cylinder container with height $50$ and radius $5$ that contains $5$ tennis balls, each with outer-radius $5$ and thickness $1$. Since Haoyang is very smart, he figures out that he can fit in more balls if he cuts each of the balls in half, then puts them in the container, so he is ”stacking” the halves. How many balls would he have to cut up to fill up the container? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be a triangle with orthocenter $H$, incenter $I$ and centroid $S$, and let $d$ be the diameter of the circumcircle of triangle $ABC$. Prove the inequality \[9\cdot HS^2+4\left(AH\cdot AI+BH\cdot BI+CH\cdot CI\right)\geq 3d^2,\] and determine when equality holds.

Find all triples $ (a,b,c)$ of integers with $ abc\equal{}1989$ and $ a\plus{}b\minus{}c\equal{}89$.

The pages of a book are numbered 1 through $n$. When the page numbers of the book were added, one of the page numbers was mistakenly added twice, resulting in an incorrect sum of 1986. What was the number of the page that was added twice?

Find the minimum of $f(x,y,z)=x^3+12\frac{yz}{x}+16(\frac{1}{yz})^{\frac{3}{2}}$ where $x,y$, and $z$ are all positive. Note: The problem as given in the tiebreaker did not specify that each of $x,y$, and $z$ had to be positive. Without this constraint, the answer is $-\infty$, as $x^3$ can be an arbitrarily large negative value and dominate the expression.

Prove that there exists a real constant $c$ such that for any pair $(x,y)$ of real numbers, there exist relatively prime integers $m$ and $n$ satisfying the relation \[ \sqrt{(x-m)^2 + (y-n)^2} < c\log (x^2 + y^2 + 2). \]

Find the greatest prime factor of $20!+20!+21!$.

Prove that among any $43$ positive integers there exist two $a$ and $b$ such that $a^2 - b^2$ is divisible by $100$.

Consider all possible pairs of positive integers $(a,b)$ such that $a \geq b$ and both $\dfrac{a^2 + b}{a - 1}$ and $\dfrac{b^2 + a}{b - 1}$ are integers. Find the sum of all possible values of the product $ab$. Proposed by Akshar Yeccherla (TopNotchMath)

Prove that if $ a,b,$ and $ c$ are positive real numbers, then \[ a^ab^bc^c \ge (abc)^{(a\plus{}b\plus{}c)/3}.\]

Let $a_0,a_1,a_2...$ be a sequence of natural numbers with the following property: $a_n^2$ divides $a_{n-1} a_{n+1}$ for $\forall$ $n\in \mathbb{N}$. Prove that, if for some natural $k\geq 2$ the numbers $a_1$ and $a_k$ are coprime, then $a_1$ divides $a_0$.

A charged particle with charge $q$ and mass $m$ is given an initial kinetic energy $K_0$ at the middle of a uniformly charged spherical region of total charge $Q$ and radius $R$. $q$ and $Q$ have opposite signs. The spherically charged region is not free to move. Throughout this problem consider electrostatic forces only. [asy] pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); size(100); filldraw(circle((0,0),1),gray(.8)); draw((0,0)--(0.5,sqrt(3)/2),EndArrow); label("$R$",(0.25,sqrt(3)/4),SE); [/asy] (a) Find the value of $K_0$ such that the particle will just reach the boundary of the spherically charged region. (b) How much time does it take for the particle to reach the boundary of the region if it starts with the kinetic energy $K_0$ found in part (a)?

Determine all positive integers $n$ for which there exist positive integers $a_1,a_2, ..., a_n$ with $a_1 + 2a_2 + 3a_3 +... + na_n = 6n$ and $\frac{1}{a_1}+\frac{2}{a_2}+\frac{3}{a_3}+ ... +\frac{n}{a_n}= 2 + \frac1n$

Let $ABCD$ be any convex quadrilateral and let $P, Q, R, S$ be points on the segments $AB, BC, CD$, and $DA$, respectively. It is given that the segments $PR$ and $QS$ dissect $ABCD$ into four quadrilaterals, each of which has perpendicular diagonals. Show that the points $P, Q, R, S$ are concyclic.

Let $ABC$ be triangle with $A$-excenter $J$. The reflection of $J$ in $BC$ is $K$. The points $E$ and $F$ are on $BJ, CJ$ such that $\angle EAB=\angle CAF=90^{\circ}$. Prove that $\angle FKE+\angle FJE=180^{\circ}$.

A needle (a segment) lies on a plane. One can rotate it $45^{\circ}$ round any of its endpoints. Is it possible that after several rotations the needle returns to initial position with the endpoints interchanged?

Denote by $F_0(x)$, $F_1(x)$, $\ldots$ the sequence of Fibonacci polynomials, which satisfy the recurrence $F_0(x)=1$, $F_1(x)=x$, and $F_n(x)=xF_{n-1}(x)+F_{n-2}(x)$ for all $n\geq 2$. It is given that there exist unique integers $\lambda_0$, $\lambda_1$, $\ldots$, $\lambda_{1000}$ such that \[x^{1000}=\sum_{i=0}^{1000}\lambda_iF_i(x)\] for all real $x$. For which integer $k$ is $|\lambda_k|$ maximized?

Metadieu, Tercieu and Quartieu are three bodybuilder warriors who fight against an $n$-headed monster. Each of them can attack the monster according to the following rules: (1) Metadieu's attack consists of cutting off half of the monster's heads, then cutting off one more head. If the monster's number of heads is odd, Metadieu cannot attack; (2) Tercieu's attack consists of cutting off a third of the monster's heads, then cutting off two more heads. If the monster's number of heads is not a multiple of 3, Tercieu cannot attack; (3) Quartieu's attack consists of cutting off a quarter of the monster's heads, then cutting off three more heads. If the monster's number of heads is not a multiple of 4, Quartieu cannot attack; If none of the three warriors can attack the monster at some point, then it will devour our three heroes. The objective of the three warriors is to defeat the monster, and for that they need to cut off all its heads, one warrior attacking at a time. For what positive integer values of $n$ is it possible for the three warriors to combine a sequence of attacks in order to defeat the monster?

Decide if the vertices of a regular $30$-gon can be numbered by numbers $1, 2,.., 30$ in such a way that the sum of the numbers of every two neighboring to be a square of a certain natural number.

Let $\varphi(n)$ denotes the number of positive integers less than or equal to $n$ which are relatively prime to $n$. Determine the number of positive integers $2\leq n\leq 50$ such that all coefficients of the polynomial \[ \left(x^{\varphi(n)} - 1\right) - \prod_{\substack{1\leq k\leq n\\\gcd(k,n) = 1}}(x-k) \] are divisible by $n$.

Starting from a positive integer $n$, we can replace the current number with a multiple of the current number or by deleting one or more zeroes from the decimal representation of the current number. Prove that for all values of $n$, it is possible to obtain a single-digit number by applying the above algorithm a finite number of times. There is a nice solution to this...

Two positive whole numbers differ by $3$. The sum of their squares is $117$. Find the larger of the two numbers.

Let $ABC$ be a triangle contained in one of the halfplanes determined by a line $r$. Points $A',B',C'$ are the reflections of $A,B,C$ in $r,$ respectively. Consider the line through $A'$ parallel to $BC$, the line through $B'$ parallel to $AC$ and the line through $C'$ parallel to $AB$. Show that these three lines have a common point.