Find all pairs $(m, n)$ of natural numbers for which the numbers $m^2 - 4n$ and $n^2 - 4m$ are both perfect squares.

If the price of an article is increased by percent $ p$, then the decrease in percent of sales must not exceed $ d$ in order to yield the same income. The value of $ d$ is: $ \textbf{(A)}\ \frac{1}{1\plus{}p} \qquad\textbf{(B)}\ \frac{1}{1\minus{}p} \qquad\textbf{(C)}\ \frac{p}{1\plus{}p} \qquad\textbf{(D)}\ \frac{p}{p\minus{}1} \qquad\textbf{(E)}\ \frac{1\minus{}p}{1\plus{}p}$

Given the parallelogram $ABCD$ such that the feet $K, L$ of the perpendiculars from point $D$ on the sides $AB, BC$ respectively are internal points. Prove that $KL \parallel AC$ when $|\angle BCA| + |\angle ABD| = |\angle BDA| + |\angle ACD|$.

A cube consists of $4^3$ unit cubes each containing an integer. At each move, you choose a unit cube and increase by $1$ all the integers in the neighbouring cubes having a face in common with the chosen cube. Is it possible to reach a position where all the $4^3$ integers are divisible by $3,$ no matter what the starting position is?

An algal cell population is found to have $a_k$ cells on day $k$. Each day, the number of cells at least doubles. If $a_0 \ge 1$ and $a_3 \le 60$, how many quadruples of integers $(a_0, a_1, a_2, a_3)$ could represent the algal cell population size on the first $4$ days?

Consider a plane $\epsilon$ and three non-collinear points $A,B,C$ on the same side of $\epsilon$; suppose the plane determined by these three points is not parallel to $\epsilon$. In plane $\epsilon$ take three arbitrary points $A',B',C'$. Let $L,M,N$ be the midpoints of segments $AA', BB', CC'$; Let $G$ be the centroid of the triangle $LMN$. (We will not consider positions of the points $A', B', C'$ such that the points $L,M,N$ do not form a triangle.) What is the locus of point $G$ as $A', B', C'$ range independently over the plane $\epsilon$?

There are $n$ husbands and wives at a party in the palace. The husbands sit at a round table, and the wives sit at another round tables. The king and queen (not included in the $n$ couples) are going to shake hands with them one by one. Assume that the king starts from a man, and the queen starts from his wife. Consider the following two ways of shaking hands: (i) The king shakes hands with the men one by one clockwise. Each time when the king shakes hands with a man, the queen moves clockwise to his wife and shakes hands with her. Assume that at last when the king gets back to the man he begins with, the queen goes around the table $a$ times. (ii) The queen shakes hands with the women one by one clockwise. Each time when the queen shakes hands with a woman, the king moves clockwise to her husband and shakes hands with him. Assume that at last when the queen gets back to the woman she begins with, the king goes around the table $b$ times. Determine the maximum possible value of $|a-b|$.

a) Prove that for each positive integer $n$ there is a unique positive integer $a_n$ such that $$(1 + \sqrt5)^n =\sqrt{a_n} + \sqrt{a_n+4^n} . $$ b) Prove that $a_{2010}$ is divisible by $5\cdot 4^{2009}$ and find the quotient

Let $ABCD$ be a cyclic quadrilateral inscribed in circle $O$, where $AC\perp BD$. $M,N$ are the midpoint of arc $ADC,ABC$. $DO$ and $AN$ intersect each other at $G$, the line passes through $G$ and parellel to $NC$ intersect $CD$ at $K$. Prove that $AK\perp BM$.

Let $ABC$ be an acute-angled triangle with $AB < AC$. Tangent to its circumcircle $\Omega$ at $A$ intersects the line $BC$ at $D$. Let $G$ be the centroid of $\triangle ABC$ and let $AG$ meet $\Omega$ again at $H \neq A$. Suppose the line $DG$ intersects the lines $AB$ and $AC$ at $E$ and $F$, respectively. Prove that $\angle EHG = \angle GHF$.(Slovakia)

Show that there are coprime positive integers $m$ and $n$ such that $2549 | (25 \cdot 49)^m + 25^n - 2 \cdot 49^n$

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.