Found problems: 85335
Peter marks several cells on a $5\times 5$ board. Basil wins if he can cover all marked cells with three-cell corners. The corners must be inside the board and not overlap. What is the least number of cells Peter should mark to prevent Basil from winning? (Cells of the corners must coincide with the cells of the board).
Given a triangle $ABC$ with circumcircle $\Gamma$. Points $E$ and $F$ are the foot of angle bisectors of $B$ and $C$, $I$ is incenter and $K$ is the intersection of $AI$ and $EF$. Suppose that $T$ be the midpoint of arc $BAC$. Circle $\Gamma$ intersects the $A$-median and circumcircle of $AEF$ for the second time at $X$ and $S$. Let $S'$ be the reflection of $S$ across $AI$ and $J$ be the second intersection of circumcircle of $AS'K$ and $AX$. Prove that quadrilateral $TJIX$ is cyclic.
[i]Proposed by Alireza Dadgarnia and Amir Parsa Hosseini[/i]
Write $S_n$ for the set $\{1, 2,..., n\}$. Determine all positive integers $n$ for which there exist functions $f : S_n \to S_n$ and $g : S_n \to S_n$ such that for every $x$ exactly one of the equalities $f(g(x)) = x$ and $g(f(x)) = x$ holds.
Prove that among any $18$ consecutive three digit numbers there is at least one number which is divisible by the sum of its digits.
Given a pentagon of area $1993$ and $995$ points inside the pentagon, let $S$ be the set containing the vertices of the pentagon and the $995$ points. Show that we can find three points of $S$ which form a triangle of area $\le 1$.
Given is a simple graph $G$ with $2022$ vertices, such that for any subset $S$ of vertices (including the set of all vertices), there is a vertex $v$ with $deg_{S}(v) \leq 100$. Find $\chi(G)$ and the maximal number of edges $G$ can have.
The figure below shows a polygon $ABCDEFGH$, consisting of rectangles and right triangles. When cut out and folded on the dotted lines, the polygon forms a triangular prism. Suppose that $AH = EF = 8$ and $GH = 14$. What is the volume of the prism?
[asy]
// djmathman diagram
unitsize(1cm);
defaultpen(linewidth(0.7)+fontsize(11));
real r = 2, s = 2.5, theta = 14;
pair G = (0,0), F = (r,0), C = (r,s), B = (0,s), M = (C+F)/2, I = M + s/2 * dir(-theta);
pair N = (B+G)/2, J = N + s/2 * dir(180+theta);
pair E = F + r * dir(- 45 - theta/2), D = I+E-F;
pair H = J + r * dir(135 + theta/2), A = B+H-J;
draw(A--B--C--I--D--E--F--G--J--H--cycle^^rightanglemark(F,I,C)^^rightanglemark(G,J,B));
draw(J--B--G^^C--F--I,linetype ("4 4"));
dot("$A$",A,N);
dot("$B$",B,1.2*N);
dot("$C$",C,N);
dot("$D$",D,dir(0));
dot("$E$",E,S);
dot("$F$",F,1.5*S);
dot("$G$",G,S);
dot("$H$",H,W);
dot("$I$",I,NE);
dot("$J$",J,1.5*S);
[/asy]
$\textbf{(A)} ~112\qquad\textbf{(B)} ~128\qquad\textbf{(C)} ~192\qquad\textbf{(D)} ~240\qquad\textbf{(E)} ~288\qquad$
Let $(F_n)_{n\in\mathbb{N}}$ be the Fibonacci sequence difined as $F_0=F_1=1, F_{n+2}=F_{n+1}+F_n, \forall n\in\mathbb{N}$. Show that for every nonnegative integer $r$ there is a term in the Fibonacci sequence that is divided by $r$.
Find all pairs of prime numbers $p, q$ for which there exist positive integers $(m, n)$ such that $$(p+q)^m=(p-q)^n$$.
The altitudes $AD$ and $BE$ of an acute triangle $ABC$ intersect at point $H$. Let $F$ be the intersection of the line $AB$ and the line that is parallel to the side BC and goes through the circumcenter of $ABC$. Let $M$ be the midpoint of the segment $AH$. Prove that $\angle CMF = 90^o$
The base of a pyramid is a regular triangle having side of size $1$. Two of three angles at the vertex of the pyramid are right. Find the maximum value of the volume of the pyramid.
For positive integer $n\geq 3$ and real numbers $a_1,...,a_n,b_1,...,b_n$, prove the following.
$$\sum_{i=1}^n a_i(b_i-b_{i+3})\leq\frac{3n}{8}\sum_{i=1}^n((a_i-a_{i+1})^2+(b_i-b_{i+1})^2)$$
($a_{n+1}=a_1$, and for $i=1,2,3$ $b_{n+i}=b_i$.)
Six points are connected in pairs by lines, each of which is either red or blue. Every pair of points is joined. Determine whether there must be a closed path having four sides all of the same colour. (A path is closed if it begins and ends at the same point.)
Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers.
Prove that
\[
\left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2.
\]
Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.
Two players play alternately on a $ 5 \times 5$ board. The first player always enters a $ 1$ into an empty square and the second player always enters a $ 0$ into an empty square. When the board is full, the sum of the numbers in each of the nine $ 3 \times 3$ squares is calculated and the first player's score is the largest such sum. What is the largest score the first player can make, regardless of the responses of the second player?
The equation $(x+a) (x+b) = 9$ has a root $a+b$. Prove that $ab\le 1$.
A pentagon $ABCDE$ is inscribed in a circle $O$, and satis fies $\angle A = 90^o, AB = CD$. Let $F$ be a point on segment $AE$. Let $BF$ hit $O$ again at $J(\ne B)$, $CE \cap DJ = K$, $BD\cap FK = L$. Prove that $B,L,E,F$ are cyclic.
A segment $AB$ is given. Let $C$ be an arbitrary point of the perpendicular bisector to $AB$; $O$ be the point on the circumcircle of $ABC$ opposite to $C$; and an ellipse centred at $O$ touch $AB, BC, CA$. Find the locus of touching points of the ellipse with the line $BC$.
Let $p_1, p_2, ..., p_k$ be $k$ different primes. We consider all positive integers that use only these primes (not necessarily all) in their prime factorization, and arrange those numbers in increasing order, forming an infinite sequence: $a_1 < a_2 < ... < a_n < ...$
Prove that, for every number $c$, there exists $n$ such that $a_{n+1} -a_n > c$.
In $\triangle ABC$, $AB = AC$. Its circumcircle, $\Gamma$, has a radius of 2. Circle $\Omega$ has a radius of 1 and is tangent to $\Gamma$, $\overline{AB}$, and $\overline{AC}$. The area of $\triangle ABC$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a, b, c$, where $b$ is squarefree and $\gcd (a, c) = 1$. Compute $a + b + c$.
[i]Proposed by Aaron Lin[/i]
For integers $n>1$, define $f(n)$ to be the sum of all postive divisors of $n$ that are less than $n$. Prove that for any positive integer $k$, there exists a positive integer $n>1$ such that $n<f(n)<f^2(n)<\cdots<f^k(n)$, where $f^i(n)=f(f^{i-1}(n))$ for $i>1$ and $f^1(n)=f(n)$.
Determine all three-digit numbers $N$ having the property that $N$ is divisible by $11,$ and $\frac{N}{11}$ is equal to the sum of the squares of the digits of $N.$
Let $d(n)$ be the number of positive divisors of a positive integer $n$. Let $\mathbb{N}$ be the set of all positive integers. Say that a function $F$ from $\mathbb{N}$ to $\mathbb{N}$ is [i]divisor-respecting[/i] if $d(F(mn)) = d(F(m)) d(F(n))$ for all positive integers $m$ and $n$, and $d(F(n)) \le d(n)$ for all positive integers $n$. Find all divisor-respecting functions. Justify your answer.
1. Leah has 13 coins, all of which are pennies and nickels. If she had one more nickel than she has now, then she would have the same number of pennies and nickels. In cents, how much are Leah's coins worth?
${ \textbf{(A)}\ \ 33\qquad\textbf{(B)}\ 35\qquad\textbf{(C)}\ 37\qquad\textbf{(D)}}\ 39\qquad\textbf{(E)}\ 41 $
Let $a_1,a_2,\cdots,a_{22}\in [1,2],$ find the maximum value of
$$\dfrac{\sum\limits_{i=1}^{22}a_ia_{i+1}}{\left( \sum\limits_{i=1}^{22}a_i\right) ^2}$$where $a_{23}=a_1.$