Can we put positive integers $1,2,3, \cdots 64$ into $8 \times 8$ grids such that the sum of the numbers in any $4$ grids that have the form like $T$ ( $3$ on top and $1$ under the middle one on the top, this can be rotate to any direction) can be divided by $5$?

Let $n$ be a positive integer. Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$. Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\ b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$ Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.

Let $ABCD$ be a parallelogram. Points $X$ and $Y$ lie on segments $AB$ and $AD$ respectively, and $AC$ intersects $XY$ at point $Z$. Prove that \[\frac{AB}{AX} + \frac{AD}{AY} = \frac{AC}{AZ}.\]

If $ 1 \le r \le n$ are integers, prove the identity: $ \displaystyle\sum_{d\equal{}1}^{\infty}\binom {n\minus{}r\plus{}1}{d} \binom {r\minus{}1} {d\minus{}1}\equal{}\binom {n}{r}.$

Prove the following inequality. \[ \ln \frac {\sqrt {2009} \plus{} \sqrt {2010}}{\sqrt {2008} \plus{} \sqrt {2009}} < \int_{\sqrt {2008}}^{\sqrt {2009}} \frac {\sqrt {1 \minus{} e^{ \minus{} x^2}}}{x}\ dx < \sqrt {2009} \minus{} \sqrt {2008}\]

Let $x,y$ be positive real numbers such that $x+y=1$. Prove that$\frac{x}{x^2+y^3}+\frac{y}{x^3+y^2}\leq2(\frac{x}{x+y^2}+\frac{y}{x^2+y})$.

Let $f_1(x)=x^2-1$, and for each positive integer $n \geq 2$ define $f_n(x) = f_{n-1}(f_1(x))$. How many distinct real roots does the polynomial $f_{2004}$ have?

A convex polygon is dissected into a finite number of triangles with disjoint interiors, whose sides have odd integer lengths. The triangles may have multiple vertices on the boundary of the polygon and their sides may overlap partially. [list=a] [*]Prove that the polygon's perimeter is an integer which has the same parity as the number of triangles in the dissection. [*]Determine whether part a) holds if the polygon is not convex. [/list] [i]Proposed by Marius Cavachi[/i] [i]Note: the junior version only included part a), with an arbitrary triangle instead of a polygon.[/i]

How many different positive integers divide $10!$ ?

A certain country wishes to interconnect $2021$ cities with flight routes, which are always two-way, in the following manner: • There is a way to travel between any two cities either via a direct flight or via a sequence of connecting flights. • For every pair $(A, B)$ of cities that are connected by a direct flight, there is another city $C$ such that $(A, C)$ and $(B, C)$ are connected by direct flights. Show that at least $3030$ flight routes are needed to satisfy the two requirements.

A $30$-gon $A_1A_2\cdots A_{30}$ is inscribed in a circle of radius $2$. Prove that one can choose a point $B_k$ on the arc $A_kA_{k+1}$ for $1 \leq k \leq 29$ and a point $B_{30}$ on the arc $A_{30}A_1$, such that the numerical value of the area of the $60$-gon $A_1B_1A_2B_2 \dots A_{30}B_{30}$ is equal to the numerical value of the perimeter of the original $30$-gon.

In triangle $\triangle ABC$ we have $BC=a,CA=b,AB=c$ and $\angle B=4\angle A$ Show that \[ab^2c^3=(b^2-a^2-ac)((a^2-b^2)^2-a^2c^2)\]

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer with distinct nonzero digits, $\overline{AB}$, such that $A$ and $B$ are both factors of $\overline{AB}$." Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool, and my favorite number is among those four numbers! Also, the square of my number is the product of two of the other numbers among the four you mentioned!" Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu[/i]

The integers from $1$ to $9$ can be arranged into a $3\times3$ array (as shown on the right) so that the sum of the numbers in every row, column, and diago­nal is a multiple of $9$. (a.) Prove that the number in the center of the array must be a multiple of $3$. (b.) Give an example of such an array with $6$ in the center. [asy] defaultpen(linewidth(0.7)+fontsize(10));size(100); int i,j; for(i=0; i<4; i=i+1) { draw((0,2i)--(6,2i)); draw((2i,0)--(2i,6)); } string[] letters={"G", "H", "I", "D", "E", "F", "A", "B", "C"}; for(i=0; i<3; i=i+1) { for(j=0; j<3; j=j+1) { label(letters[3i+j], (2j+1, 2i+1)); }}[/asy]

Determine all positive integers $n$ such that it is possible to fill the $n \times n$ table with numbers $1, 2$ and $-3$ so that the sum of the numbers in each row and each column is $0$.

Let $w_{1}$ and $w_{2}$ denote the circles $x^{2}+y^{2}+10x-24y-87=0$ and $x^{2}+y^{2}-10x-24y+153=0$, respectively. Let $m$ be the smallest positive value of $a$ for which the line $y=ax$ contains the center of a circle that is externally tangent to $w_{2}$ and internally tangent to $w_{1}$. Given that $m^{2}=p/q$, where $p$ and $q$ are relatively prime integers, find $p+q$.

Let $ a,b,c $ be three positive numbers. Show that the equation $$ a^x+b^x=c^x $$ has, at most, one real solution.

Let ABCD be a parallelogram, E the midpoint of AD and F the projection of B on CE. Prove that the triangle ABF is isosceles.

Let $ABC$ be a triangle with $\angle ABC=120^o$ and triangle bisectors $(AA_1),(BB_1),(CC_1)$, respectively. $B_1F \perp A_1C_1$, where $F\in (A_1C_1)$. Let $R,I$ and $S$ be the centers of the circles which are inscribed in triangles $C_1B_1F,C_1B_1A_1, A_1B_1F$, and $B_1S\cap A_1C_1=\{Q\}$. Show that $R,I,S,Q$ are on the same circle.

Let $k,n\ge 1$ be relatively prime integers. All positive integers not greater than $k+n$ are written in some order on the blackboard. We can swap two numbers that differ by $k$ or $n$ as many times as we want. Prove that it is possible to obtain the order $1,2,\dots,k+n-1, k+n$.

An [i]$ n\minus{}m$ society[/i] is a group of $ n$ girls and $ m$ boys. Prove that there exists numbers $ n_0$ and $ m_0$ such that every [i]$ n_0\minus{}m_0$ society[/i] contains a subgroup of five boys and five girls with the following property: either all of the boys know all of the girls or none of the boys knows none of the girls.

Write a list of the first $10$ positive integers in increasing order. Erase any number adjacent to a prime; if two primes are adjacent, do not erase either prime. Apply this process twice. How many positive integers remain in the list? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6$

Let $ x$, $ y$ and $ z$ be non negative numbers. Prove that \[ \frac{x^2\plus{}y^2\plus{}z^2\plus{}xy\plus{}yz\plus{}zx}{6}\le \frac{x\plus{}y\plus{}z}{3}\cdot\sqrt{\frac{x^2\plus{}y^2\plus{}z^2}{3}}\]

If \[ \sum_{k=1}^{1000}\left( \frac{k+1}{k}+\frac{k}{k+1}\right)=\frac{m}{n} \] for relatively prime positive integers $m,n$, compute $m+n$. [i]2020 CCA Math Bonanza Lightning Round #2.4[/i]

Determine all natural numbers $n$ and $k > 1$ such that $k$ divides each of the numbers$\binom{n}{1}$,$\binom{n}{2}$,..........,$\binom{n}{n-1}$