Let $n\in \mathbb{N}$. Prove that $lcm [1,2,..,n]=lcm [\binom{n}{1},\binom{n}{2},...,\binom{n}{n}]$ if and only if $n+1$ is a prime number.

The circumcircle of $\triangle ABC$ has radius $1$ and centre $O$ and $P$ is a point inside the triangle such that $OP=x$. Prove that \[AP\cdot BP\cdot CP\le(1+x)^2(1-x),\] with equality if and only if $P=O$.

Suppose that $F$ is a field with exactly $5^{14}$ elements. We say that a function $f:F \rightarrow F$ is [i]happy[/i], if, for all $x,y \in F$, $$\left(f(x+y)+f(x)\right)\left(f(x-y)+f(x)\right)=f(y^2)-f(x^2).$$ Compute the number of elements $z$ of $F$ such that there exist distinct happy functions $h_1$ and $h_2$ such that $h_1(z)=h_2(z).$ [i]Proposed by Luke Robitaille[/i]

Compute \[\int_1^{\sqrt{3}} x^{2x^2+1}+\ln\left(x^{2x^{2x^2+1}}\right)dx.\]

Let $f(u)$ be a continuous function and, for any real number $u$, let $[u]$ denote the greatest integer less than or equal to $u$. Show that for any $x>1$, \[\int_{1}^{x} [u]([u]+1)f(u)du = 2\sum_{i=1}^{[x]} i \int_{i}^{x} f(u)du\]

Define a sequence recursively by $x_0=5$ and \[x_{n+1}=\frac{x_n^2+5x_n+4}{x_n+6}\] for all nonnegative integers $n.$ Let $m$ be the least positive integer such that \[x_m\leq 4+\frac{1}{2^{20}}.\] In which of the following intervals does $m$ lie? $\textbf{(A) } [9,26] \qquad\textbf{(B) } [27,80] \qquad\textbf{(C) } [81,242]\qquad\textbf{(D) } [243,728] \qquad\textbf{(E) } [729,\infty]$

Determine the values of the real parameter $a$, such that the equation \[\sin 2x\sin 4x-\sin x\sin 3x=a\] has a unique solution in the interval $[0,\pi)$.

Two players in turn play a game. First Player has cards with numbers $2, 4, \ldots, 2000$ while Second Player has cards with numbers $1, 3, \ldots, 2001$. In each his turn, a player chooses one of his cards and puts it on a table; the opponent sees it and puts his card next to the first one. Player, who put the card with a larger number, scores 1 point. Then both cards are discarded. First Player starts. After $1000$ turns the game is over; First Player has used all his cards and Second Player used all but one. What are the maximal scores, that players could guarantee for themselves, no matter how the opponent would play?

Let $F_1=F_2=1$ and $F_n=F_{n-1}+F_{n-2}$ for any integer $n\geq3$. For some integer $k>1$, Johnny converts $F_k$ kilometers to miles, then rounds to the nearest integer. Assume that $1$ mile is exactly $1.609344$ kilometers. Estimate the smallest value of $k$ such that Johnny [i]does not[/i] get that this is $F_{k-1}$ miles. An estimate of $E$ earns $2^{1-\left|A-E\right|}$ points, where $A$ is the actual answer. [i]2019 CCA Math Bonanza Lightning Round #5.1[/i]

A natural number $n$ is called "good" if there exists natural numbers $a$ and $b$ such that $a+b=n$ and $ab \mid n^2+n+1$. Show that there are infinitely many "good" numbers

Let $ABC$ be an acute scalene triangle with circumcenter $O$, and let $T$ be on line $BC$ such that $\angle TAO = 90^{\circ}$. The circle with diameter $\overline{AT}$ intersects the circumcircle of $\triangle BOC$ at two points $A_1$ and $A_2$, where $OA_1 < OA_2$. Points $B_1$, $B_2$, $C_1$, $C_2$ are defined analogously. [list=a][*] Prove that $\overline{AA_1}$, $\overline{BB_1}$, $\overline{CC_1}$ are concurrent. [*] Prove that $\overline{AA_2}$, $\overline{BB_2}$, $\overline{CC_2}$ are concurrent on the Euler line of triangle $ABC$. [/list][i]Evan Chen[/i]

A point $B$ lies on a chord $AC$ of circle $\omega.$ Segments $AB$ and $BC$ are diameters of circles $\omega_1$ and $\omega_2$ centered at $O_1$ and $O_2$ respectively. These circles intersect $\omega$ for the second time in points $D$ and $E$ respectively. The rays $O_1D$ and $O_2E$ meet in a point $F,$ and the rays $AD$ and $CE$ do in a point $G.$ Prove that the line $FG$ passes through the midpoint of the segment $AC.$

Prove that if $h_1,h_2,h_3,h_4$ are the altitudes of a tetrahedron and $d_1,d_2,d_3$ the distances between the pairs of opposite edges of the tetrahedron, then $$\frac{1}{h_1^2} +\frac{1}{h_2^2} +\frac{1}{h_3^2} +\frac{1}{h_4^2} =\frac{1}{d_1^2} +\frac{1}{d_2^2} +\frac{1}{d_3^2}.$$

We call the sum of any $k$ of $n$ given numbers (with distinct indices) a $k$-sum. Given $n$, find all $k$ such that, whenever more than half of $k$-sums of numbers $a_{1},a_{2},...,a_{n}$ are positive, the sum $a_{1}+a_{2}+...+a_{n}$ is positive as well.

Determine all polynomials $P(x)$ with real coeffcients such that $(x^3+3x^2+3x+2)P(x-1)=(x^3-3x^2+3x-2)P(x)$.

Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions: $i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them. $ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them. Find maximum of $\mid S\mid$. [i]Proposed by Erfan Salavati[/i]

What is the minimum value of \[(x^2+2x+8-4\sqrt{3})\cdot(x^2-6x+16-4\sqrt{3})\] where $x$ is a real number? $ \textbf{(A)}\ 112-64\sqrt{3} \qquad\textbf{(B)}\ 3-\sqrt{3} \qquad\textbf{(C)}\ 8-4\sqrt{3} \\ \textbf{(D)}\ 3\sqrt{3}-4 \qquad\textbf{(E)}\ \text{None of the preceding} $

$M = (a_{i,j} ), \ i, j = 1, 2, 3, 4$, is a square matrix of order four. Given that: [list] [*] [b](i)[/b] for each $i = 1, 2, 3,4$ and for each $k = 5, 6, 7$, \[a_{i,k} = a_{i,k-4};\]\[P_i = a_{1,}i + a_{2,i+1} + a_{3,i+2} + a_{4,i+3};\]\[S_i = a_{4,i }+ a_{3,i+1} + a_{2,i+2} + a_{1,i+3};\]\[L_i = a_{i,1} + a_{i,2} + a_{i,3} + a_{i,4};\]\[C_i = a_{1,i} + a_{2,i} + a_{3,i} + a_{4,i},\] [*][b](ii)[/b] for each $i, j = 1, 2, 3, 4$, $P_i = P_j , S_i = S_j , L_i = L_j , C_i = C_j$, and [*][b](iii)[/b] $a_{1,1} = 0, a_{1,2} = 7, a_{2,1} = 11, a_{2,3} = 2$, and $a_{3,3} = 15$.[/list] find the matrix M.

What is the tens digit of the sum \[\left(1!\right)^2+\left(2!\right)^2+\left(3!\right)^2+\ldots+\left(2018!\right)^2?\] [i]2018 CCA Math Bonanza Individual Round #1[/i]

Define the sequence $(a_n)$ as $a_1 = 1$, $a_{2n} = a_n$ and $a_{2n+1} = a_n + 1$ for all $n\geq 1$. a) Find all positive integers $n$ such that $a_{kn} = a_n$ for all integers $1 \leq k \leq n$. b) Prove that there exist infinitely many positive integers $m$ such that $a_{km} \geq a_m$ for all positive integers $k$.

A parallelogram is inscribed in a quadrilateral, two opposite vertices of which are the midpoints of the opposite sides of the quadrilateral. Determine the area of ​​such a parallelogram if the area of ​​the quadrilateral is equal to $S_o$.

Determine all positive integers that cannot be written as $\frac{a}{b} + \frac{a+1}{b+1}$ where $a$ and $b$ are positive integers.

Ankit, Box, and Clark are taking the tiebreakers for the geometry round, consisting of three problems. Problem $k$ takes each $k$ minutes to solve. If for any given problem there is a $\frac13$ chance for each contestant to solve that problem first, what is the probability that Ankit solves a problem first?

[b]Q[/b]. $ABC$ is an acute - angled triangle with $\odot(ABC)$ and $\Omega$ as the circumcircle and incircle respectively. Let $D, E, F$ to be the respective intouch points on $\overline{BC}, \overline{CA}$ and $\overline{AB}$. Circle $\gamma_A$ is drawn internally tangent to sides $\overline{AC}, \overline{AB}$ and $\odot(ABC)$ at $X, Y$ and $Z$ respectively. Another circle $(\omega)$ is constructed tangent to $\overline{BC}$ at $\mathcal{T}_1$ and internally tangent to $\odot(ABC)$ at $\mathcal{T}_2$. A tangent is drawn from $A$ such that it touches $\omega$ at $W$ and meets $BC$ at $V$, with $V$ lying inside $\odot(ABC)$. Now if $\overline{EF}$ meets $\odot(BC)$ at $\mathcal{X}_1$ and $\mathcal{X}_2$, opposite to vertex $B$ and $C$ respectively, where $\odot(BC)$ denotes the circle with $BC$ as diameter, prove that the set of lines $\{\overline{B\mathcal{X}_1}, \overline{ZS}, \overline{C\mathcal{X}_2}, \overline{DU}, \overline{YX}, \overline{\mathcal{T}_1W} \}$ are concurrent where $S$ is the mid-point of $\widehat{BC}$ containing $A$ and $U$ is the anti-pode of $D$ with respect to $\Omega$. If the line joining that concurrency point and $A$ meets $\odot(ABC)$ at $N\not = A$ prove that $\overline{AD}, \overline{ZN}$ and $\gamma_A$ pass through a common point. [i] Proposed by srijonrick[/i]

Inside the inscribed quadrilateral $ABCD$ there is a point $K$, the distances from which to the sides $ABCD$ are proportional to these sides. Prove that $K$ is the intersection point of the diagonals of $ABCD$.