Let $(a_n), (b_n)$, $n = 1,2,...$ be two sequences of integers defined by $a_1 = 1, b_1 = 0$ and for $n \geq 1$ $a_{n+1} = 7a_n + 12b_n + 6$ $b_{n+1} = 4a_n + 7b_n + 3$ Prove that $a_n^2$ is the difference of two consecutive cubes.

Given a convex polygon with 20 vertexes, there are many ways of traingulation it (as 18 triangles). We call the diagram of triangulation, meaning the 20 vertexes, with 37 edges(17 triangluation edges and the original 20 edges), a T-diagram. And the subset of this T-diagram with 10 edges which covers all 20 vertexes(meaning any two edges in the subset doesn't cover the same vertex) calls a "perfect matching" of this T-diagram. Among all the T-diagrams, find the maximum number of "perfect matching" of a T-diagram.

Is there a power of $2$ such that it is possible to rearrange the digits giving another power of $2$?

Partition $\{1,2,3, ... ,2024\}$ into $506$ sets $\{a_i, b_i, c_i, d_i\}$ such that $a_i<b_i<c_i<d_i$. Find the maximum of \[\sum_{i=1}^{506} (a_i-b_i-c_i+d_i)\] over all partitions. [i]Tiebreaker #2[/i]

Suppose that $\omega$ is a primitive $2007^{\text{th}}$ root of unity. Find $\left(2^{2007}-1\right)\displaystyle\sum_{j=1}^{2006}\dfrac{1}{2-\omega^j}$.

We call a table of size $n \times n$ self-describing if each cell of the table contains the total number of even numbers in its row and column other than itself. How many self-describing tables of size a) $3 \times 3$ exist? b) $4 \times 4$ exist? c) $5 \times 5$ exist? Two tables are different if they differ in at least one cell.

Let $0 < x_i < \pi$ for $i=1,2,\ldots, n$ and set $$x= \frac{ x_1 +x_2 + \ldots+ x_n }{n}.$$ Prove that $$ \prod_{i=1}^{n} \frac{ \sin x_i }{x_i } \leq \left( \frac{ \sin x}{x}\right)^{n}.$$

Larry always orders pizza with exactly two of his three favorite toppings: pepperoni, bacon, and sausage. If he has ordered a total of $600$ pizzas and has had each topping equally often, how many pizzas has he ordered with pepperoni? $\text{(A) }200\qquad\text{(B) }300\qquad\text{(C) }400\qquad\text{(D) }500\qquad\text{(E) }600$

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.

Suppose that $x$, $y$, and $z$ are real numbers such that $x + y + z = 3$ and $x^2 + y^2 + z^2 = 6$. What is the largest possible value of $z$?

What is the largest $n$ such that $n! + 1$ is a square?

Let $n$, $k$ be fixed integers. On a $n \times n$ board, label each square $0$ or $1$ such that in each $2k \times 2k$ sub-square of the board, the number of $0$'s and $1$'s written are the same. What is the largest possible sum of numbers written on the $n\times n$ board?

In triangle $ABC$ we have $\angle C = 90^o$ and $AC = BC$. Furthermore $M$ is an interior pont in the triangle so that $MC = 1 , MA = 2$ and $MB =\sqrt2$. Determine $AB$

What is the value of $$2^{\left(0^{\left(1^9\right)}\right)}+\left(\left(2^0\right)^1\right)^9\,?$$ $\textbf{(A) } 0 \qquad\textbf{(B) } 1 \qquad\textbf{(C) } 2 \qquad\textbf{(D) } 3 \qquad\textbf{(E) } 4$

Players $A$ and $B$ play a game on a blackboard that initially contains 2020 copies of the number 1 . In every round, player $A$ erases two numbers $x$ and $y$ from the blackboard, and then player $B$ writes one of the numbers $x+y$ and $|x-y|$ on the blackboard. The game terminates as soon as, at the end of some round, one of the following holds: $(1)$ one of the numbers on the blackboard is larger than the sum of all other numbers; $(2)$ there are only zeros on the blackboard. Player $B$ has to pay to player $A$ an amount in reais equivalent to the quantity of numbers left on the blackboard after the game ends. Show that player $A$ can earn at least 8 reais regardless of the moves taken by $B$ Ps.: Easier version of [url = https://artofproblemsolving.com/community/c6h2625868p22698110]ISL 2020 C8[/url]

Given two primes $p$ and $q$, is $v_p(q^n+n^q)$ unbounded as $n$ varies? [i](Proposed by Ivan Chan Kai Chin)[/i]

The points $X, Y,Z$ are marked on the sides $AB, BC,AC$ of the triangle $ABC$, respectively. Points $A',B', C'$ are on the $XZ, XY, YZ$ sides of the triangle $XYZ$, respectively, so that $\frac{AB}{A'B'} = \frac{AB}{A'B'} =\frac{BC}{B'C'}= 2$ and $ABB'A',BCC'B',ACC'A'$ are trapezoids in which the sides of the triangle $ABC$ are bases. a) Determine the ratio between the area of the trapezium $ABB'A'$ and the area of the triangle $A'B'X$. b) Determine the ratio between the area of the triangle $XYZ$ and the area of the triangle $ABC$.

The sum of the following seven numbers is exactly 19: \[a_1=2.56,\qquad a_2=2.61,\qquad a_3=2.65,\qquad a_4=2.71,\] \[a_5=2.79,\qquad a_6=2.82,\qquad a_7=2.86.\] It is desired to replace each $a_i$ by an integer approximation $A_i$, $1 \le i \le 7$, so that the sum of the $A_i$'s is also 19 and so that $M$, the maximum of the "errors" $|A_i - a_i|$, is as small as possible. For this minimum $M$, what is $100M$?

Let $D$ be a point inside acute triangle $ABC$ satisfying the condition \[DA\cdot DB\cdot AB+DB\cdot DC\cdot BC+DC\cdot DA\cdot CA=AB\cdot BC\cdot CA.\] Determine (with proof) the geometric position of point $D$.

In triangle $\triangle ABC$, $AB<AC$, $M,D,E$ are the midpoints of $BC$, the arcs $BAC$ and $BC$ of the circumcircle of $\triangle ABC$ respectively. The incircle of $\triangle ABC$ touches $AB$ at $F$, $AE$ meets $BC$ at $G$, and the perpendicular to $AB$ at $B$ meets segment $EF$ at $N$. If $BN=EM$, prove that $DF$ is perpendicular to $FG$.

Solve the equation $$(x+1)^2-5(x+1) \sqrt{x}+4x=0$$

In triangle $ABC$, $AB = 100$, $BC = 120$, and $CA = 140$. Points $D$ and $F$ lie on $\overline{BC}$ and $\overline{AB}$, respectively, such that $BD = 90$ and $AF = 60$. Point $E$ is an arbitrary point on $\overline{AC}$. Denote the intersection of $\overline{BE}$ and $\overline{CF}$ as $K$, the intersection of $\overline{AD}$ and $\overline{CF}$ as $L$, and the intersection of $\overline{AD}$ and $\overline{BE}$ as $M$. If $[KLM] = [AME] + [BKF] + [CLD]$, where $[X]$ denotes the area of region $X$, compute $CE$. [i]Proposed by Lewis Chen [/i]

Let $n$ be a positive integer, and let $F$ be a family of subsets of $\{1, 2, ... , 2^n\}$ such that for any non-empty $ A\in F$ there exists $B \in F$ so that $|A| = |B| + 1$ and $B \subset A$. Suppose that F contains all $(2^n - 1)$-element subsets of $\{1, 2, ... , 2^n\}$ Determine the minimal possible value of $|F|$.

For a pair of integers $a$ and $b$, with $0 < a < b < 1000$, set $S\subseteq \{ 1, 2, \dots , 2003\}$ is called a [i]skipping set[/i] for $(a, b)$ if for any pair of elements $s_1, s_2 \in S$, $|s_1 - s_2|\not\in \{ a, b\}$. Let $f(a, b)$ be the maximum size of a skipping set for $(a, b)$. Determine the maximum and minimum values of $f$.

Let $a$ and $b$ be positive integers satisfying $\frac{ab+1}{a+b}<\frac{3}{2}$. The maximum possible value of $\frac{a^3b^3+1}{a^3+b^3}$ is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.