In the net drawn below, in how many ways can one reach the point $3n+1$ starting from the point $1$ so that the labels of the points on the way increase? [asy] import graph; size(12cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-4.3,xmax=12.32,ymin=-10.66,ymax=6.3; draw((1,2)--(xmax,0*xmax+2)); draw((1,0)--(xmax,0*xmax+0)); draw((0,1)--(1,2)); draw((1,0)--(0,1)); draw((1,2)--(3,0)); draw((1,0)--(3,2)); draw((3,2)--(5,0)); draw((3,0)--(5,2)); draw((5,2)--(7,0)); draw((5,0)--(7,2)); draw((7,2)--(9,0)); draw((7,0)--(9,2)); dot((1,0),linewidth(1pt)+ds); label("2",(0.96,-0.5),NE*lsf); dot((0,1),linewidth(1pt)+ds); label("1",(-0.42,0.9),NE*lsf); dot((1,2),linewidth(1pt)+ds); label("3",(0.98,2.2),NE*lsf); dot((2,1),linewidth(1pt)+ds); label("4",(1.92,1.32),NE*lsf); dot((3,2),linewidth(1pt)+ds); label("6",(2.94,2.2),NE*lsf); dot((4,1),linewidth(1pt)+ds); label("7",(3.94,1.32),NE*lsf); dot((6,1),linewidth(1pt)+ds); label("10",(5.84,1.32),NE*lsf); dot((3,0),linewidth(1pt)+ds); label("5",(2.98,-0.46),NE*lsf); dot((5,2),linewidth(1pt)+ds); label("9",(4.92,2.24),NE*lsf); dot((5,0),linewidth(1pt)+ds); label("8",(4.94,-0.42),NE*lsf); dot((8,1),linewidth(1pt)+ds); label("13",(7.88,1.34),NE*lsf); dot((7,2),linewidth(1pt)+ds); label("12",(6.8,2.26),NE*lsf); dot((7,0),linewidth(1pt)+ds); label("11",(6.88,-0.38),NE*lsf); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy]

Pentagon \(ABCDE\) is inscribed in a circle. Its diagonals \(AC\) and \(BD\) intersect at \(F\). The bisectors of \(\angle BAC\) and \(\angle CDB\) intersect at \(G\). Let \(AG\) intersect \(BD\) at \(H\), let \(DG\) intersect \(AC\) at \(I\), and let \(EG\) intersect \(AD\) at \(J\). If \(FHGI\) is cyclic and \[JA \cdot FC \cdot GH = JD \cdot FB \cdot GI,\] prove that \(G\), \(F\) and \(E\) are collinear.

$ABCD$ is a cyclic quadrilateral and $\omega$ its circumcircle. The perpendicular line to $AC$ at $D$ intersects $AC$ at $E$ and $\omega$ at F. Denote by $\ell$ the perpendicular line to $BC$ at $F$. The perpendicular line to $\ell$ at A intersects $\ell$ at $G$ and $\omega$ at $H$. Line $GE$ intersects $FH$ at $I$ and $CD$ at $J$. Prove that points $C, F, I$ and $J$ are concyclic

Let $ABCD$ be a parallelogram. Half-circles $\omega_1,\omega_2,\omega_3$ and $\omega_4$ with diameters $AB,BC,CD$ and $DA$, respectively, are erected on the exterior of $ABCD$. Line $l_1$ is parallel to $BC$ and cuts $\omega_1$ at $X$, segment $AB$ at $P$, segment $CD$ at $R$ and $\omega_3$ at $Z$. Line $l_2$ is parallel to $AB$ and cuts $\omega_2$ at $Y$, segment $BC$ at $Q$, segment $DA$ at $S$ and $\omega_4$ at $W$. If $XP\cdot RZ=YQ\cdot SW$, prove that $PQRS$ is cyclic. [i]Proposed by José Alejandro Reyes González[/i]

For which values of $ z$ does the series $ \sum_{n\equal{}1}^{\infty}c_1c_2\cdots c_n z^n$ converge, provided that $ c_k>0$ and $ \sum_{k\equal{}1}^{\infty} \frac{c_k}{k}<\infty$ ?

At the beginning of the school year, $ 50\%$ of all students in Mr. Well's math class answered "Yes" to the question "Do you love math", and $ 50\%$ answered "No." At the end of the school year, $ 70\%$ answered "Yes" and $ 30\%$ answered "No." Altogether, $ x\%$ of the students gave a different answer at the beginning and end of the school year. What is the difference between the maximum and the minimum possible values of $ x$? $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 60\qquad\textbf{(E)}\ 80$

Each face and each vertex of a regular tetrahedron is coloured red or blue. How many different ways of colouring are there? (Two tetrahedrons are said to have the same colouring if we can rotate them suitably so that corresponding faces and vertices are of the same colour.

Find the product of all positive real solutions to the equation $x^{-x} + x^{\frac{1}{x}} = \frac{2021}{2020}.$ [i]Proposed by Gabriel Wu[/i]

Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation: \[Q(a+b) = \frac{P(a) - P(b)}{a - b}\] $\forall a, b \in \mathbb{Z}^+$ and $a>b$

Let $n>1$ be a positive integer and $\mathcal S$ be the set of $n^{\text{th}}$ roots of unity. Suppose $P$ is an $n$-variable polynomial with complex coefficients such that for all $a_1,\ldots,a_n\in\mathcal S$, $P(a_1,\ldots,a_n)=0$ if and only if $a_1,\ldots,a_n$ are all different. What is the smallest possible degree of $P$? [i]Adam Ardeishar and Michael Ren[/i]

Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$. [i]Proposed by Ivan Chan Kai Chin[/i]

$20$ points with no three collinear are given. How many obtuse triangles can be formed by these points? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 2{{10}\choose{3}} \qquad \textbf{(D)}\ 3{{10}\choose{3}} \qquad \textbf{(E)}\ {{20}\choose{3}}$

A straight line is colored with two colors. Prove that there are three points $A, B, C$ of the same color such that $AB = BC$. [i](1 point)[/i]

Determine all the sets of six consecutive positive integers such that the product of some two of them . added to the product of some other two of them is equal to the product of the remaining two numbers.

Solve in non-negative integers the equation $ 2^{a}3^{b} \plus{} 9 \equal{} c^{2}$

A basketball player made $ 5$ baskets during a game. Each basket was worth either $ 2$ or $ 3$ points. How many different numbers could represent the total points scored by the player? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

The ten-letter code $\text{BEST OF LUCK}$ represents the ten digits $0-9$, in order. What 4-digit number is represented by the code word $\text{CLUE}$? $\textbf{(A)}\ 8671 \qquad \textbf{(B)}\ 8672 \qquad \textbf{(C)}\ 9781 \qquad \textbf{(D)}\ 9782 \qquad \textbf{(E)}\ 9872$

If $x,y, z$ are arbitrary positive numbers with $xyz = 1$, prove the inequality $$x^2+y^2+z^2 + xy+yz + zx \ge 2(\sqrt{x} +\sqrt{y}+ \sqrt{z})$$.

Emily has two cups $A$ and $B$, each of which can hold $400$ mL, A initially with $200$ mL of water and $B$ initially with $300$ mL of water. During a round, she chooses the cup with more water (randomly picking if they have the same amount), drinks half of the water in the chosen cup, then pours the remaining half into the other cup and refills the chosen cup to back to half full. If Emily goes for $20$ rounds, how much water does she drink, to the nearest integer?

How many positive integers less than $2019$ are divisible by either $18$ or $21$, but not both?

A desert expedition camps at the border of the desert, and has to provide one liter of drinking water for another member of the expedition, residing on the distance of $n$ days of walking from the camp, under the following conditions: $(i)$ Each member of the expedition can pick up at most $3$ liters of water. $(ii)$ Each member must drink one liter of water every day spent in the desert. $(iii)$ All the members must return to the camp. How much water do they need (at least) in order to do that?

Find all polynomials $P(x)$ such that, for all real numbers $x, y, z$ that satisfy $x+ y +z =0$, $$P(x) +P(y) +P(z)=0$$

Prove that for every positive integer $d > 1$ and $m$ the sequence $a_n=2^{2^n}+d$ contains two terms $a_k$ and $a_l$ ($k \neq l$) such that their greatest common divisor is greater than $m$. [i]Proposed by T. Hakobyan[/i]

Let $ n$ be the number of number-pairs $ (x,y)$ which satisfy $ 5y \minus{} 3x \equal{} 15$ and $ x^2 \plus{} y^2 \le 16$. Then $ n$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \text{more than two, but finite} \qquad \textbf{(E)}\ \text{greater than any finite number}$

Find the number of functions defined on positive real numbers such that $ f\left(1\right) \equal{} 1$ and for every $ x,y\in \Re$, $ f\left(x^{2} y^{2} \right) \equal{} f\left(x^{4} \plus{} y^{4} \right)$. $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{Infinitely many}$