For any real numbers $x,y$ that satisfies the equation $$x+y-xy=155$$ and $$x^2+y^2=325$$, Find $|x^3-y^3|$

Let $ABC$ be a triangle with $\angle B \le \angle C$, $I$ its incenter and $D$ the intersection point of line $AI$ with side $BC$. Let $M$ and $N$ be points on sides $BA$ and $CA$, respectively, such that $BM = BD$ and $CN = CD$. The circumcircle of triangle $CMN$ intersects again line $BC$ at $P$. Prove that quadrilateral $DIMP$ is cyclic.

Let $ P[X,Y] $ be a polynomial of degree at most $ 2 .$ If $ A,B,C,A',B',C' $ are distinct roots of $ P $ such that $ A,B,C $ are not collinear and $ A',B',C' $ lie on the lines $ BC,CA, $ respectively, $ AB, $ in the planar representation of these points, show that $ P=0. $

If the graphs of $2y+x+3=0$ and $3y+ax+2=0$ are to meet at right angles, the value of $a$ is: ${{ \textbf{(A)}\ \pm \frac{2}{3} \qquad\textbf{(B)}\ -\frac{2}{3}\qquad\textbf{(C)}\ -\frac{3}{2} \qquad\textbf{(D)}\ 6}\qquad\textbf{(E)}\ -6} $

Five teams participated in the commercial football tournament. Each had to play exactly one match with each other. Due to financial difficulties, the organizers canceled some games. In the end It turned out that all teams scored a different number of points and not a single team in the points column had a zero. What is the smallest number of games could be played in a tournament if three points were awarded for a win, for a draw - one, for a defeat - zero?

Ana and Banana are playing a game. First Ana picks a word, which is defined to be a nonempty sequence of capital English letters. (The word does not need to be a valid English word.) Then Banana picks a nonnegative integer $k$ and challenges Ana to supply a word with exactly $k$ subsequences which are equal to Ana's word. Ana wins if she is able to supply such a word, otherwise she loses. For example, if Ana picks the word "TST", and Banana chooses $k=4$, then Ana can supply the word "TSTST" which has 4 subsequences which are equal to Ana's word. Which words can Ana pick so that she wins no matter what value of $k$ Banana chooses? (The subsequences of a string of length $n$ are the $2^n$ strings which are formed by deleting some of its characters, possibly all or none, while preserving the order of the remaining characters.) [i]Proposed by Kevin Sun

Let $p$ be a prime number and $k$ be a positive integer. Let \[t=\sum_{i=0}^\infty\bigg\lfloor\frac{k}{p^i}\bigg\rfloor.\]a) Let $f(x)$ be a polynomial of degree $k$ with integer coefficients such that its leading coefficient is $1$ and its constant is divisible by $p.$ prove that there exists $n\in\mathbb{N}$ for which $p\mid f(n),$ but $p^{t+1}\nmid f(n).$ b) Prove that the statement above is sharp, i.e. there exists a polynomial $g(x)$ of degree $k,$ integer coefficients, leading coefficient $1$ and constant divisible by $p$ such that if $p\mid g(n)$ is true for a certain $n\in\mathbb{N},$ then $p^t\mid g(n)$ also holds. [i]Proposed by Kristóf Szabó, Budapest[/i]

For positive integers $a$ and $b$ holds $a^3+4a=b^2$. Prove that $a=2t^2$ for some positive integer $t$

Let $P(x)\in \mathbb{Z}[x]$ be a monic polynomial with even degree. Prove that, if for infinitely many integers $x$, the number $P(x)$ is a square of a positive integer, then there exists a polynomial $Q(x)\in\mathbb{Z}[x]$ such that $P(x)=Q(x)^2$.

Estimate the number of primes among the first thousand primes divide some term of the sequence \[2^0+1,2^1+1,2^2+1,2^3+1,\ldots.\] An estimate of $E$ earns $2^{1-0.02|A-E|}$ points, where $A$ is the actual answer. [i]2021 CCA Math Bonanza Lightning Round #5.4[/i]

Definition: A natural number is [i]abundant [/i] if the sum of its positive divisors is greater than its double. Find an odd abundant number and prove that there are infinitely many odd abundant numbers.

3. Let $ABC$ be a triangle with $AB=30$, $BC=14$, and $CA=26$. Let $N$ be the center of the equilateral triangle constructed externally on side $AB$. Let $M$ be the center of the square constructed externally on side $BC$. Given that the area of quadrilateral $ACMN$ can be expressed as $a+b\sqrt{c}$ for positive integers $a$, $b$ and $c$ such that $c$ is not divisible by the square of any prime, compute $a+b+c$. [i]Proposed by winnertakeover[/i]

Sequence of real numbers $a_1, a_2, . . . , a_{2000}$ is such that for any natural number $n$, $1\le n \le 2000$, the equality $$a^3_1+ a^3_2+... + a^3_n = (a_1 + a_2 +...+ a_n)^2.$$ Prove that all terms of this sequence are integers.

Find all $f : \mathbb{N} \to \mathbb{N} $ such that $f(a) + f(b)$ divides $2(a + b - 1)$ for all $a, b \in \mathbb{N}$. Remark: $\mathbb{N} = \{ 1, 2, 3, \ldots \} $ denotes the set of the positive integers.

Denote in the triangle $ABC$ by $h$ the length of the height drawn from vertex $A$, and by $\alpha = \angle BAC$. Prove that the inequality $AB + AC \ge BC \cdot \cos \alpha + 2h \cdot \sin \alpha$ . Are there triangles for which this inequality turns into equality?

Let $ABC$ be an acute triangle with circumcircle $\omega$. Let $D$ and $E$ be the feet of the altitudes from $B$ and $C$ onto sides $AC$ and $AB$, respectively. Lines $BD$ and $CE$ intersect $\omega$ again at points $P \neq B$ and $Q \neq C$. Suppose that $PD=3$, $QE=2$, and $AP \parallel BC$. Compute $DE$. [i]Proposed by Kyle Lee[/i]

A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible?

Let $\Gamma_A$, $\Gamma_B$, $\Gamma_C$ be circles such that $\Gamma_A$ is tangent to $\Gamma_B$ and $\Gamma_B$ is tangent to $\Gamma_C$. All three circles are tangent to lines $L$ and $M$, with $A$, $B$, $C$ being the tangency points of $M$ with $\Gamma_A$, $\Gamma_B$, $\Gamma_C$, respectively. Given that $12=r_A<r_B<r_C=75$, calculate: a) the length of $r_B$. b) the distance between point $A$ and the point of intersection of lines $L$ and $M$.

Let $P(x) = 1-x+x^2-x^3+\dots+x^{18}-x^{19}$ and $Q(x)=P(x-1)$. What is the coefficient of $x^2$ in polynomial $Q$? $ \textbf{(A)}\ 840 \qquad\textbf{(B)}\ 816 \qquad\textbf{(C)}\ 969 \qquad\textbf{(D)}\ 1020 \qquad\textbf{(E)}\ 1140 $

Determine all triples $(a, b, c)$ of nonnegative integers that satisfy: $$(c-1) (ab- b -a) = a + b-2$$

Determine all four-digit numbers $\overline{abcd} $ such that $(a + b)(a + c)(a + d)(b + c)(b + d)(c + d) =\overline{abcd} $:

Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years. (a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end. (b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor + \left\lfloor \frac{4r}{r+b} \right\rfloor + ... + \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor . \] [i]Proposed by Sammy Luo[/i]

Let $ABC$ be a triangle and $A'$ be the reflection of $A$ about $BC$. Let $P$ and $Q$ be points on $AB$ and $AC$, respectively, such that $PA'=PC$ and $QA'=QB$. Prove that the perpendicular from $A'$ to $PQ$ passes through the circumcenter of $\triangle ABC$. [i]Fedir Yudin[/i]

Two convex polytopes $A$ and $B$ do not intersect. The polytope $A$ has exactly $2012$ planes of symmetry. What is the maximal number of symmetry planes of the union of $A$ and $B$, if $B$ has a) $2012$, b) $2013$ symmetry planes? c) What is the answer to the question of p.b), if the symmetry planes are replaced by the symmetry axes?

Let be three real numbers $ a,b,c, $ all in the interval $ (0,\infty ) $ or all in the interval $ (0,1). $ Prove the following inequality: $$ \sum_{\text{cyc}}\log_a bc\ge 4\cdot\sum_{\text{cyc}} \log_{ab} c . $$