Found problems: 85335
Given $a$, $b$, and $c$ are complex numbers satisfying
\[ a^2+ab+b^2=1+i \]
\[ b^2+bc+c^2=-2 \]
\[ c^2+ca+a^2=1, \]
compute $(ab+bc+ca)^2$. (Here, $i=\sqrt{-1}$)
The natural numbers $m$ and $k$ satisfy the equality $$1001 \cdot 1002 \cdot ... \cdot 2010 \cdot 2011 = 2^m (2k + 1)$$. Find the number $m$.
Heesu plays a game where he starts with $1$ piece of candy. Every turn, he flips a fair coin. On heads, he gains another piece of candy, unless he already has $5$ pieces of candy, in which case he loses $4$ pieces of candy and goes back to having $1$ piece of candy. On tails, the game ends. What is the expected number of pieces of candy that Heesu will have when the game ends?
Let $p$ and $q$ be distinct positive integers. Prove that at least one of the equations $x^2+px+q=0$ and $x^2+qx+p=0$ has a real root.
Let $n$ be a positive integer. If $4^n + 2^n + 1$ is a prime, prove that $n$ is a power of three.
Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$.
(For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)
Define the sequence $(a_n)_{n\geq 1}$ by $a_1=1$, $a_2=p$ and \[a_{n+1}=pa_n-a_{n-1} \textrm { for all } n>1.\]
Prove that for $n>1$ the polynomial $x^n-a_nx+a_{n-1}$ is divisible by $x^2-px+1$.
Using this result, solve the equation \[x^4-56x+15=0.\]
Let $(a_{i,j})^n_{i,j=1}$ be a real matrix such that $a_{i,i}=0$ for $i=1,2,\ldots,n$. Prove that there exists a set $\mathcal J\subset\{1,2,\ldots,n\}$ of indices such that
$$\sum_{\begin{smallmatrix}i\in\mathcal J\\j\notin\mathcal J\end{smallmatrix}}a_{i,j}+\sum_{\begin{smallmatrix}i\notin\mathcal J\\j\in\mathcal J\end{smallmatrix}}a_{i,j}\ge\frac12\sum_{i,j=1}^na_{i,j}.$$
Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$
Oleksii wrote some \( 2n \) (\( n > 1 \)) consecutive positive integers on the board. After that, he grouped these numbers into pairs in some way, and within each pair, he multiplied the two numbers together. He then wrote the resulting \( n \) products on the board instead of the original numbers.
Afterward, Anton wrote down the difference between the largest and the smallest of the numbers Oleksii wrote. Oleksii wants Anton to write the smallest possible number. What is the smallest number that can be written?
[i]Proposed by Oleksii Masalitin, Anton Trygub[/i]
A table with three rows and 100 columns is given. Initially, in the left cell of each row there are $400\cdot 3^{100}$ chips. At one move, Petya marks some (but at least one) chips on the table, and then Vasya chooses one of the three rows. After that, all marked chips in the selected row are shifted to the right by a cell, and all marked chips in the other rows are removed from the table. Petya wins if one of the chips goes beyond the right edge of the table; Vasya wins if all the chips are removed. Who has a winning strategy?
[i]Proposed by P. Svyatokum, A. Khuzieva and D. Shabanov[/i]
Let $H$ be the orthocenter of $\triangle ABC$. The points $A_{1} \not= A$, $B_{1} \not= B$ and $C_{1} \not= C$ lie, respectively, on the circumcircles of $\triangle BCH$, $\triangle CAH$ and $\triangle ABH$ and satisfy $A_{1}H=B_{1}H=C_{1}H$. Denote by $H_{1}$, $H_{2}$ and $H_{3}$ the orthocenters of $\triangle A_{1}BC$, $\triangle B_{1}CA$ and $\triangle C_{1}AB$, respectively. Prove that $\triangle A_{1}B_{1}C_{1}$ and $\triangle H_{1}H_{2}H_{3}$ have the same orthocenter.
Given four colours and enough square plates $1\times 1$. We have to paint four edges of every plate with four different colours and combine plates, putting them with the edges of the same colour together. Describe all the pairs $m,n$, such that we can combine those plates in a $n\times m$ rectangle, that has every edge of one colour, and its four edges have different colours.
Determine all positive integers $n$ such that $$n\cdot 2^{n-1}+1$$ is a perfect square.
In a party of $2020$ people, some pairs of people are friends. We say that a given person's [i]popularity[/i] is the size of the largest group of people in the party containing them with the property that every pair of people in that group is friends. A person has popularity number $1$ if they have no friends. What is the largest possible number of distinct popularities in the party?
[i]2021 CCA Math Bonanza Tiebreaker Round #3[/i]
Squares $ABCD$ and $EFGH$ are congruent, $AB=10$, and $G$ is the center of square $ABCD$. The area of the region in the plane covered by these squares is
[asy]
draw((0,0)--(10,0)--(10,10)--(0,10)--cycle);
draw((5,5)--(12,-2)--(5,-9)--(-2,-2)--cycle);
label("A", (0,0), W);
label("B", (10,0), E);
label("C", (10,10), NE);
label("D", (0,10), NW);
label("G", (5,5), N);
label("F", (12,-2), E);
label("E", (5,-9), S);
label("H", (-2,-2), W);
dot((-2,-2));
dot((5,-9));
dot((12,-2));
dot((0,0));
dot((10,0));
dot((10,10));
dot((0,10));
dot((5,5));
[/asy]
$ \textbf{(A)}\ 75 \qquad\textbf{(B)}\ 100 \qquad\textbf{(C)}\ 125 \qquad\textbf{(D)}\ 150 \qquad\textbf{(E)}\ 175 $
Given a natural number $n{}$ find the smallest $\lambda$ such that\[\gcd(x(x + 1)\cdots(x + n - 1), y(y + 1)\cdots(y + n - 1)) \leqslant (x-y)^\lambda,\] for any positive integers $y{}$ and $x \geqslant y + n$.
Find all 3-digit positive integers $\overline{abc}$ such that \[ \overline{abc} = abc(a+b+c) , \] where $\overline{abc}$ is the decimal representation of the number.
Consider $ABCD$ a square of side $1$. Points $P,Q,R,S$ are chosen on sides $AB$, $BC$, $CD$ and $DA$ respectively such that $|AP| = |BQ| =|CR| =|DS| = a$, with $a < 1$. The segments $AQ$, $BR$, $CS$ and $DP$ are drawn. Calculate the area of the quadrilateral that is formed in the center of the figure.
[asy]
unitsize(1 cm);
pair A, B, C, D, P, Q, R, S;
A = (0,3);
B = (0,0);
C = (3,0);
D = (3,3);
P = (0,2);
Q = (1,0);
R = (3,1);
S = (2,3);
draw(A--B--C--D--cycle);
draw(A--Q);
draw(B--R);
draw(C--S);
draw(D--P);
label("$A$", A, NW);
label("$B$", B, SW);
label("$C$", C, SE);
label("$D$", D, NE);
label("$P$", P, W);
label("$Q$", Q, dir(270));
label("$R$", R, E);
label("$S$", S, N);
label("$a$", (A + P)/2, W);
label("$a$", (B + Q)/2, dir(270));
label("$a$", (C + R)/2, E);
label("$a$", (D + S)/2, N);
[/asy]
Find the set of all ordered pairs $(s,t)$ of positive integers such that \[t^{2}+1=s(s+1).\]
Let $p{}$ be an odd prime number. Determine whether there exists a permutation $a_1,\ldots,a_p$ of $1,\ldots,p$ satisfying \[(i-j)a_k+(j-k)a_i+(k-i)a_j\neq 0,\] for all pairwise distinct $i,j,k.$
Determine all triples $(a, b, c)$ of positive integers such that
$$a! + b! = 2^{c!}.$$
[i](Walther Janous)[/i]
Let $ABC$ be a triangle with $AB=17$ and $AC=23$. Let $G$ be the centroid of $ABC$, and let $B_1$ and $C_1$ be on the circumcircle of $ABC$ with $BB_1\parallel AC$ and $CC_1\parallel AB$. Given that $G$ lies on $B_1C_1$, the value of $BC^2$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Determine $100m+n$.
[i]Proposed by Michael Ren[/i]
If $\theta$ is an acute angle, and $\sin 2\theta=a$, then $\sin\theta+\cos\theta$ equals
$\textbf{(A) }\sqrt{a+1}\qquad\textbf{(B) }(\sqrt{2}-1)a+1\qquad\textbf{(C) }\sqrt{a+1}-\sqrt{a^2-a}\qquad$
$\textbf{(D) }\sqrt{a+1}+\sqrt{a^2-a}\qquad \textbf{(E) }\sqrt{a+1}+a^2-a$
Determine all pairs $(x, y)$ of positive integers such that for $d = gcd(x, y)$ the equation $$xyd = x + y + d^2$$
holds.
[i](Walther Janous)[/i]