a) Is it possible to arrange numbers $1,2,...,13$ in a circumference such that the sum of any two neighbouring numbers to be a prime number? b) Is the same problem possible for the numbers $1,2,...,16$?

Find the number of arithmetic sequences $a_1,a_2,a_3$ of three nonzero integers such that the sum of the terms in the sequence is equal to the product of the terms in the sequence. [i]Proposed by Sammy Charney[/i]

If a dealer could get his goods for $8\%$ less while keeping his selling price fixed, his profit, based on cost, would be increased to $(x+10)\%$ from his present profit of $x\%$, which is $\textbf{(A) }12\%\qquad\textbf{(B) }15\%\qquad\textbf{(C) }30\%\qquad\textbf{(D) }50\%\qquad \textbf{(E) }75\%$

The Fibonacci sequence is defined by \[ a_{n+1} = a_n + a_{n-1}, n \geq 1, a_0 = 0, a_1 = a_2 = 1. \] Find the greatest common divisor of the 1960-th and 1988-th terms of the Fibonacci sequence.

In the triangle $ABC$, the medians $AA_1$, $BB_1$, and $CC_1$ are concurrent at a point $T$ such that $BA_1=TA_1$. The points $C_2$ and $B_2$ are chosen on the extensions of $CC_1$ and $BB_2$, respectively, such that $$C_1C_2 = \frac{CC_1}{3} \quad \text{and} \quad B_1B_2 = \frac{BB_1}{3}.$$ Show that $TB_2AC_2$ is a rectangle.

Let $A$ be a set of $n$ points in the space. From the family of all segments with endpoints in $A$, $q$ segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of $m$ yellow segments, where $m \geq \frac{2q}{n}$, arranged in order of increasing length.

Consider an acute-angled triangle $ABC$ with $AB=AC$ and $\angle A>60^\circ$. Let $O$ be the circumcenter of $ABC$. Point $P$ lies on circumcircle of $BOC$ such that $BP\parallel AC$ and point $K$ lies on segment $AP$ such that $BK=BC$. Prove that $CK$ bisects the arc $BC$ of circumcircle of $BOC$.

Point $D$ lies on side $AB$ of triangle $ABC$. Let $\omega_1$ and $\Omega_1,\omega_2$ and $\Omega_2$ be the incircles and the excircles (touching segment $AB$) of triangles $ACD$ and $BCD.$ Prove that the common external tangents to $\omega_1$ and $\omega_2,$ $\Omega_1$ and $\Omega_2$ meet on $AB$.

For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[ X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...). \] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.

Circles $\omega_1$ and $\omega_2$ intersect each other at points $A$ and $B$. Point $C$ lies on the tangent line from $A$ to $\omega_1$ such that $\angle ABC = 90^\circ$. Arbitrary line $\ell$ passes through $C$ and cuts $\omega_2$ at points $P$ and $Q$. Lines $AP$ and $AQ$ cut $\omega_1$ for the second time at points $X$ and $Z$ respectively. Let $Y$ be the foot of altitude from $A$ to $\ell$. Prove that points $X, Y$ and $Z$ are collinear. [i]Proposed by Iman Maghsoudi[/i]

There is a board with three rows and $2023$ columns. In the first row the numbers are written from $1$ to $2023$, ordered from least to greatest. The devil writes those same numbers in the boxes in the second row, but ordered to his choice. Then, in each box in the third row he writes the difference between the two numbers already written in his own column (the largest minus the smallest). For example, if the first two boxes of a column are the numbers $21$ and $198$, in the third box it is written $198-21 = 177$. Explain why, no matter how the devil completed the second row of the board, it will never happen that multiplying them $2023$ numbers in the third row the result is odd.

(a) Let $a,x,y$ be positive integers. Prove: if $x\ne y$, the also \[ax+\gcd(a,x)+\text{lcm}(a,x)\ne ay+\gcd(a,y)+\text{lcm}(a,y).\] (b) Show that there are no two positive integers $a$ and $b$ such that \[ab+\gcd(a,b)+\text{lcm}(a,b)=2014.\]

Let $n$ be a positive integer with $n>1$. Prove that \[\frac{1}{2}+\cdots+\frac{1}{n}\] is not an integer.

Equilateral triangle $DEF$ is inscribed in equilateral triangle $ABC$ such that $\overline{DE} \perp \overline{BC}$. The ratio of the area of $\triangle DEF$ to the area of $\triangle ABC$ is [asy] size(180); pathpen = linewidth(0.7); pointpen = black; pointfontpen = fontsize(10); pair B = (0,0), C = (1,0), A = dir(60), D = C*2/3, E = (2*A+C)/3, F = (2*B+A)/3; D(D("A",A,N)--D("B",B,SW)--D("C",C,SE)--cycle); D(D("D",D)--D("E",E,NE)--D("F",F,NW)--cycle); D(rightanglemark(C,D,E,1.5));[/asy] $\textbf{(A)}\ \dfrac{1}{6}\qquad \textbf{(B)}\ \dfrac{1}{4} \qquad \textbf{(C)}\ \dfrac{1}{3} \qquad \textbf{(D)}\ \dfrac{2}{5} \qquad \textbf{(E)}\ \dfrac{1}{2}$

Each cell of a $10 \times 10$ board is painted red, blue or white, with exactly twenty of them red. No two adjacent cells are painted in the same colour. A domino consists of two adjacent cells, and it is said to be good if one cell is blue and the other is white. (a) Prove that it is always possible to cut out $30$ good dominoes from such a board. (b) Give an example of such a board from which it is possible to cut out $40$ good dominoes. (c) Give an example of such a board from which it is not possible to cut out more than $30$ good dominoes.

In $\triangle ABC$, point $M$ is the middle point of $AC$. $MD//AB$ and meet the tangent of $A$ to $\odot(ABC)$ at point $D$. Point $E$ is in $AD$ and point $A$ is the middle point of $DE$. $\{P\}=\odot(ABE)\cap AC,\{Q\}=\odot(ADP)\cap DM$. Prove that $\angle QCB=\angle BAC$. [url=https://imgtu.com/i/4pZ7Zj][img]https://z3.ax1x.com/2021/09/12/4pZ7Zj.jpg[/img][/url]

The Garfield Super Winners play $100$ games of foosball, in which teams score a non-negative integer number of points and the team with more points after ten minutes wins (if both teams have the same number of points, it is a draw). Suppose that the Garfield Super Winners score an average of $7$ points per game but allow an average of $8$ points per game. Given that the Garfield Super Winners never won or lost by more than $10$, what is the largest possible number of games that they could win? [i]2019 CCA Math Bonanza Lightning Round #4.1[/i]

1. In right triangle $ABC$ with $\angle{A}= \textdegree{90}$, point $P$ is chosen. $D \in BC$ such that $PD \perp BC$. Let the intersection of $PD$ with $AB$ and $AC$ be $E$ and $F$ respectively. Denote by $X$ and $Y$ as the intersection of $(APE)$ and $(APF)$ with $BP$ and $CP$ respectively. Prove that $CX,BY,PD$ are concurrent.

Given a scalene triangle $ABC$. Its incircle touches $BC,AC,AB$ at $D,E,F$ respectvely. Let $L,M,N$ be the symmetric points of $D$ with $EF$,of $E$ with $FD$,of $F$ with $DE$,respectively. Line $AL$ intersects $BC$ at $P$,line $BM$ intersects $CA$ at $Q$,line $CN$ intersects $AB$ at $R$. Prove that $P,Q,R$ are collinear.

Let $ABC$ be an acute-angled triangle with circumference $\Omega$. Let the angle bisectors of $\angle B$ and $\angle C$ intersect $\Omega$ again at $M$ and $N$. Let $I$ be the intersection point of these angle bisectors. Let $M'$ and $N'$ be the respective reflections of $M$ and $N$ in $AC$ and $AB$. Prove that the center of the circle passing through $I$, $M'$, $N'$ lies on the altitude of triangle $ABC$ from $A$. [i]Proposed by Victor Domínguez and Ariel García[/i]

Medians $AA_1, BB_1, CC_1$ and altitudes $AA_2, BB_2, CC_2$ are drawn in triangle $ABC$ . Prove that the length of the broken line $A_1B_2C_1A_2B_1C_2A_1$ is equal to the perimeter of triangle $ABC$.

Figure $OPQR$ is a square. Point $O$ is the origin, and point $Q$ has coordinates $(2,2)$. What are the coordinates for $T$ so that the area of triangle $PQT$ equals the area of square $OPQR$? [asy] pair O,P,Q,R,T; O = (0,0); P = (2,0); Q = (2,2); R = (0,2); T = (-4,0); draw((-5,0)--(3,0)); draw((0,-1)--(0,3)); draw(P--Q--R); draw((-0.2,-0.8)--(0,-1)--(0.2,-0.8)); draw((-0.2,2.8)--(0,3)--(0.2,2.8)); draw((-4.8,-0.2)--(-5,0)--(-4.8,0.2)); draw((2.8,-0.2)--(3,0)--(2.8,0.2)); draw(Q--T); label("$O$",O,SW); label("$P$",P,S); label("$Q$",Q,NE); label("$R$",R,W); label("$T$",T,S); [/asy] NOT TO SCALE $\text{(A)}\ (-6,0) \qquad \text{(B)}\ (-4,0) \qquad \text{(C)}\ (-2,0) \qquad \text{(D)}\ (2,0) \qquad \text{(E)}\ (4,0)$

We have four white equilateral triangles of $3$ cm on each side and join them by their sides to obtain a triangular base pyramid. At each edge of the pyramid we mark two red dots that divide it into three equal parts. Number the red dots, so that when you scroll them in the order they were numbered, result a path with the smallest possible perimeter. How much does that path measure?

Let $M, \alpha, \beta \in \mathbb{R} $ with $M > 0$ and $\alpha, \beta \in (0,1)$. If $R>1$ is a real number, we say that a sequence of positive real numbers $\{ C_n \}_{n\geq 0}$ is $R$-[i]inoceronte[/i] if $ \sum_{i=1}^n R^{n-i}C_i \leq R^n \cdot M$ for all $n \geq 1$. Determine the smallest real $R>1$ for which exists a $R$-[i]inoceronte[/i] sequence $ \{ C_n \}_{n\geq 0}$ such that $\sum_{n=1}^{\infty} \beta ^n C_n^{\alpha}$ diverges.

Prove that for any positive integers $a$ and $b$ we have $$a+(-1)^b \sum^a_{m=0} (-1)^{\lfloor{\frac{bm}{a}\rfloor}} \equiv b+(-1)^a \sum^b_{n=0} (-1)^{\lfloor{\frac{an}{b}\rfloor}} \pmod{4}.$$