The Lucas numbers $L_n$ are defined recursively as follows: $L_0=2,L_1=1,L_n=L_{n-1}+L_{n-2}$ for $n\geq2$. Let $r=0.21347\dots$, whose digits form the pattern of the Lucas numbers. When the numbers have multiple digits, they will "overlap," so $r=0.2134830\dots$, [b]not[/b] $0.213471118\dots$. Express $r$ as a rational number $\frac{p}{q}$, where $p$ and $q$ are relatively prime.

Solve the given equation in primes \begin{align*} xyz=1 +2^{y^2+1} \end{align*}

$(YUG 1)$ Suppose that positive real numbers $x_1, x_2, x_3$ satisfy $x_1x_2x_3 > 1, x_1 + x_2 + x_3 <\frac{1}{x_1}+\frac{1}{x_2}+\frac{1}{x_3}$ Prove that: $(a)$ None of $x_1, x_2, x_3$ equals $1$. $(b)$ Exactly one of these numbers is less than $1.$

Find all triplets of positive real numbers $(x,y,z)$ that satisfy the following system of equations: $$ \begin{cases} x+y^2+z^3=3\\ y+z^2+x^3=3\\ z+x^2+y^3=3. \end{cases}$$

The number of teeth in three meshed gears $A$, $B$, and $C$ are $x$, $y$, and $z$, respectively. (The teeth on all gears are the same size and regularly spaced.) The angular speeds, in revolutions per minutes of $A$, $B$, and $C$ are in the proportion $\text{(A)} \ x: y: z ~~\text{(B)} \ z: y: x ~~ \text{(C)} \ y: z: x~~ \text{(D)} \ yz: xz: xy ~~ \text{(E)} \ xz: yx: zy$

The Knights of the Round Table are gathering. Around the table are $34 $ chairs, numbered from 1 to $34$. When everyone has sat down, it turns out that between every two knights there is a maximum of $r$ places, which can be either empty or occupied by another knight. (a) For each $r \le 15$, determine the maximum number of knights present. (b) Determine for each $r \le 15$ how many sets of occupied seats there are that match meet the given and where the maximum number of knights is present.

There are $17$ students in Marek's class, and all of them took a test. Marek's score was $17$ points higher than the arithmetic mean of the scores of the other students. By how many points is Marek's score higher than the arithmetic mean of the scores of the entire class? Justify your answer.

Find all non-empty sets $S$ of nonzero real numbers such that a) $S$ has at most $5$ elements b) If $x$ is in $S$, then so are $1- x$ and $\frac{1}{x}$.

Find the minimum value of $ \int_0^{\pi} \left(x \minus{} \pi a \minus{} \frac {b}{\pi}\cos x\right)^2dx$.

Let $ABC$ be an acute triangle inscribed in a circle $(O)$ that is fixed, and two of the vertices $B$, $C$ are fixed while vertex $A$ varies on the circumference of the circle. Let $I$ be the center of the incircle, and $AD$ the angle bisector. Let $K$, $L$ be the circumcenters of $CAD$, $ABD$. A line through $O$ parallel to $DL$, $DK$ intersects the line that is through $I$ perpendicular to $IB$, $IC$ at $M$, $N$ respectively. Prove that $MN$ is tangent to a fixed circle when $A$ varies on the circle $(O)$. Tran Quang Hung, Natural Science High School, National University, Hanoi

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Let $AD$ be the base of trapezoid $ABCD$. It is known that the circumcenter of triangle $ABC$ lies on $BD$. Prove that the circumcenter of triangle $ABD$ lies on $AC$. [i]Proposed by Ye.Bakayev[/i]

For nonnegative real numbers $x,y,z$ and $t$ we know that $|x-y|+|y-z|+|z-t|+|t-x|=4$. Find the minimum of $x^2+y^2+z^2+t^2$. [i]proposed by Mohammadmahdi Yazdi, Mohammad Ahmadi[/i]

In $\triangle ABC$, $AB=AC=28$ and $BC=20$. Points $D,E,$ and $F$ are on sides $\overline{AB}$, $\overline{BC}$, and $\overline{AC}$, respectively, such that $\overline{DE}$ and $\overline{EF}$ are parallel to $\overline{AC}$ and $\overline{AB}$, respectively. What is the perimeter of parallelogram $ADEF$? [asy] size(180); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); real r=5/7; pair A=(10,sqrt(28^2-100)),B=origin,C=(20,0),D=(A.x*r,A.y*r); pair bottom=(C.x+(D.x-A.x),C.y+(D.y-A.y)); pair E=extension(D,bottom,B,C); pair top=(E.x+D.x,E.y+D.y); pair F=extension(E,top,A,C); draw(A--B--C--cycle^^D--E--F); dot(A^^B^^C^^D^^E^^F); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,SE); label("$D$",D,W); label("$E$",E,S); label("$F$",F,dir(0)); [/asy] $\textbf{(A) }48\qquad \textbf{(B) }52\qquad \textbf{(C) }56\qquad \textbf{(D) }60\qquad \textbf{(E) }72\qquad$

Inside the triangle $A_1A_2A_3$ with sides $a_1$, $a_2$, $a_3$, three points are given, which we label $P_1$, $P_2$, $P_3$ so that the product of their distances from the corresponding sides $a_1$, $a_2$, $a_3$ is as large as possible. Prove that the triangles $P_1A_2A_3$, $A_1P_2A_3$, $A_1A_2P_3$ cover the triangle. [hide=original wording]V trojúhelníku A1A2A3 se stranami a1, a2, a3 jsou dány tři body, které označíme Pi, P2, P3 tak, aby součin jejich vzdáleností od odpovídajících stran a1, a2, a3 byl co největší. Dokažte, že trojúhelníky P1A2A3, A1P2A3, A1A2P3 pokrývají trojúhelník.[/quote]

Given complex numbers $x,y,z$, with $|x|^2+|y|^2+|z|^2=1$. Prove that: $$|x^3+y^3+z^3-3xyz| \le 1$$

A point $D$ is chosen on the side $AC$ of a triangle $ABC$ with $\angle C < \angle A < 90^\circ$ in such a way that $BD=BA$. The incircle of $ABC$ is tangent to $AB$ and $AC$ at points $K$ and $L$, respectively. Let $J$ be the incenter of triangle $BCD$. Prove that the line $KL$ intersects the line segment $AJ$ at its midpoint.

We consider a point $P$ in a plane $p$ and a point $Q \not\in p$. Determine all the points $R$ from $p$ for which \[ \frac{QP+PR}{QR} \] is maximum.

Find all real numbers $p$ for which the equation $x^3+3px^2+(4p-1)x+p=0$ has two real roots with difference $1$.

Estimate the range of the submissions for this problem. Your answer must be between $[0, 1000]$. An estimate $E$ earns $\frac{2}{1+0.05|A-E|}$ points, where $A$ is the actual answer. [i]2022 CCA Math Bonanza Lightning Round 5.2[/i]

Points $K$ and $M$ are taken on the sides $AB$ and $CD$ of square $ABCD$, respectively, and on the diagonal $AC$ - point $L$ such that $ML = KL$. Let $P$ be the intersection point of the segments $MK$ and $BD$. Find the angle $\angle KPL$.

Find the largest natural number $n$ that divides $a^{25} -a$ for all integers $a$.

When the speed of a rear-drive car is increasing on a horizontal road, the direction of the frictional force on the tires is: $ \textbf {(A) } \text {backward on the front tires and forward on the rear tires.} $ $ \textbf {(B) } \text {forward on the front tires and backward on the rear tires.} $ $ \textbf {(C) } \text {forward on all tires.} $ $ \textbf {(D) } \text {backward on all tires.} $ $ \textbf {(E) } \text {zero.} $

The rectangle in the figure has dimensions $16$ x $20$ and is divided into $10$ smaller equal rectangles. What is the perimeter of each of the $10$ smaller rectangles?

Let $ A \equal{} (a_{ik})$ be an $ n\times n$ matrix with nonnegative elements such that $ \sum_{k \equal{} 1}^n a_{ik} \equal{} 1$ for $ i \equal{} 1,...,n$. Show that, for every eigenvalue $ \lambda$ of $ A$, either $ |\lambda| < 1$ or there exists a positive integer $ k$ such that $ \lambda^k \equal{} 1$