Found problems: 85335
We call a triple of natural numbers $(a, b, c)$ [i]square [/i] if they form an arithmetic progression (in exactly this order), the number $b$ is coprime to each of the numbers $a$ and $c$, and the number $abc$ is a perfect square. Prove that for any given a square triple, there is another square triple that has at least one common number with it.
Suppose four coplanar points $A, B, C$, and $D$ satisfy $AB = 3$, $BC = 4$, $CA = 5$, and $BD = 6$. Determine the maximal possible area of $\vartriangle ACD$.
Let $ABCD$ be a parallelogram whose diagonals meet at $P$. Denote by $M$ the midpoint of $AB$. Let $Q$ be a point such that $QA$ is tangent to the circumcircle of $MAD$ and $QB$ is tangent to the circumcircle of $MBC$. Prove that points $Q,M,P$ are collinear.
(Patrik Bak, Slovakia)
Given a triangle $ ABC $, $ AD $ is its angle bisector. Let $ E, F $ be the centers of the circles inscribed in the triangles $ ADC $ and $ ADB $, respectively. Denote by $ \omega $, the circle circumscribed around the triangle $ DEF $, and by $ Q $, the intersection point of $ BE $ and $ CF $, and $ H, J, K, M $ , respectively the second intersection point of the lines $ CE, CF, BE, BF $ with circle $ \omega $. Let $\omega_1, \omega_2 $ the circles be circumscribed around the triangles $ HQJ $ and $ KQM $ Prove that the intersection point of the circles $\omega_1, \omega_2 $ different from $ Q $ lies on the line $ AD $.
(Kivva Bogdan)
Given a convex figure in the Cartesian plane that is symmetric with respect of both axis, we construct a rectangle $A$ inside it with maximum area (over all posible rectangles). Then we enlarge it with center in the center of the rectangle and ratio lamda such that is covers the convex figure. Find the smallest lamda such that it works for all convex figures.
Alex the Kat and Kelvin the Frog play a game on a complete graph with $n$ vertices. Kelvin goes first, and the players take turns selecting either a single edge to remove from the graph, or a single vertex to remove from the graph. Removing a vertex also removes all edges incident to that vertex. The player who removes the final vertex wins the game. Assuming both players play perfectly, for which positive integers $n$ does Kelvin have a winning strategy?
We call a set of $6$ points in the plane [i]splittable[/i] if we if can denote its elements by $A,B,C,D,E$ and $F$ in such a way that $\triangle ABC$ and $\triangle DEF$ have the same centroid.
[list=a]
[*]Construct a splittable set.
[*]Show that any set of $7$ points has a subset of $6$ points which is [i]not[/i] splittable.
[/list]
Quadrilateral $ABCD (\overline{AD} < \overline{BC})$ is inscribed in a circle, and $H(\neq A, B)$ is a point on segment $AB.$ The circumcircle of triangle $BCH$ meets $BD$ at $E(\neq B)$ and line $HE$ meets $AD$ at $F$. The circle passes through $C$ and tangent to line $BD$ at $E$ meets $EF$ at $G(\neq E).$ Prove that $\angle DFG = \angle FCG.$
Find the largest integer $n$ such that $2007^{1024}-1$ is divisible by $2^n$.
$\textbf{(A) }1\hspace{14em}\textbf{(B) }2\hspace{14em}\textbf{(C) }3$
$\textbf{(D) }4\hspace{14em}\textbf{(E) }5\hspace{14em}\textbf{(F) }6$
$\textbf{(G) }7\hspace{14em}\textbf{(H) }8\hspace{14em}\textbf{(I) }9$
$\textbf{(J) }10\hspace{13.7em}\textbf{(K) }11\hspace{13.5em}\textbf{(L) }12$
$\textbf{(M) }13\hspace{13.3em}\textbf{(N) }14\hspace{13.4em}\textbf{(O) }15$
$\textbf{(P) }16\hspace{13.6em}\textbf{(Q) }55\hspace{13.4em}\textbf{(R) }63$
$\textbf{(S) }64\hspace{13.7em}\textbf{(T) }2007$
[color=darkred]Let $ m,n\in \mathbb{N}$, $ n\ge 2$ and numbers $ a_i > 0$, $ i \equal{} \overline{1,n}$, such that $ \sum a_i \equal{} 1$. Prove that
$ \small{\dfrac{a_1^{2 \minus{} m} \plus{} a_2 \plus{} ... \plus{} a_{n \minus{} 1}}{1 \minus{} a_1} \plus{} \dfrac{a_2^{2 \minus{} m} \plus{} a_3 \plus{} ... \plus{} a_n}{1 \minus{} a_1} \plus{} ... \plus{} \dfrac{a_n^{2 \minus{} m} \plus{} a_1 \plus{} ... \plus{} a_{n \minus{} 2}}{1 \minus{} a_1}\ge n \plus{} \dfrac{n^m \minus{} n}{n \minus{} 1}}$[/color]
Let $x, y \in \mathbb{R}^+$. Prove that:
\[
\left( 1 + \frac{1}{x} \right) \left( 1 + \frac{1}{y} \right) \geq \left( 1 + \frac{2}{x + y} \right)^2.
\]
Given are two parallel lines $ g$ and $ h$ and a point $ P$, that lies outside of the corridor bounded by $ g$ and $ h$. Construct three lines $ g_1$, $ g_2$ and $ g_3$ through the point $ P$. These lines intersect $ g$ in $ A_1,A_2, A_3$ and $ h$ in $ B_1, B_2, B_3$ respectively. Let $ C_1$ be the intersection of the lines $ A_1B_2$ and $ A_2B_1$, $ C_2$ be the intersection of the lines $ A_1B_3$ and $ A_3B_1$ and let $ C_3$ be the intersection of the lines $ A_2B_3$ and $ A_3B_2$. Show that there exists exactly one line $ n$, that contains the points $ C_1,C_2,C_3$ and that $ n$ is parallel to $ g$ and $ h$.
Let $\mathbb{R}^{+}$ be the set of all positive real numbers. Find all the functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that for all $x, y \in \mathbb{R}^{+}$,
\[ f(x)f(y) = f(y)f(xf(y)) + \frac{1}{xy}. \]
Let $f:\mathbb{R}^+\to \mathbb{R}^+$ be a function such that for all $x,y \in \mathbb{R}+,\, f(x)f(y)=f(xy)+f\left(\frac{x}{y}\right)$, where $\mathbb{R}^+$ represents the positive real numbers. Given that $f(2)=3$, compute the last two digits of $f\left(2^{2^{2020}}\right)$.
Is it possible to place a positive integer in every cell of a $10 \times 10$ array in such a way that both the following conditions are satisfied?
$\bullet$ Each number (not in the top row) is a proper divisor of the number immediately above.
$\bullet$ Each row consists of 1$0$ consecutive positive integers (but not necessarily in order).
In the triangle $ABC$ it is known that $\angle ACB> 90 {} ^ \circ$, $\angle CBA> 45 {} ^ \circ$. On the sides $AC$ and $AB$, respectively, there are points $P$ and $T$ such that $ABC$ and $PT = BC$. The points ${{P} _ {1}}$ and ${{T} _ {1}}$ on the sides $AC$ and $AB$ are such that $AP = C {{P} _ {1}}$ and $AT = B {{T} _ {1}}$. Prove that $\angle CBA- \angle {{P} _ {1}} {{T} _ {1}} A = 45 {} ^ \circ$.
(Anton Trygub)
Integers $x_0,x_1,...,x_{n-1}, x_n = x_0, x_{n+1} = x_1$ satisfy the inequality $(-1)^{x_k} x_{k-1}x_{k+1} >0$ for $k = 1,2,...,n$. Prove that the difference $\sum_{k=0}^{n-1}x_k -\sum_{k=0}^{n-1}|x_k|$ is divisible by $4$.
Let $a,b,c>0.$ Prove that $\frac{1}{a+b}+\frac{1}{b+c}+\frac{1}{c+a} \ge \frac{1}{\sqrt{2a^2+2bc}}+\frac{1}{\sqrt{2b^2+2ca}}+\frac{1}{\sqrt{2c^2+2ab}}$
Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$?
[asy]
size(250);defaultpen(linewidth(0.8));
pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=tangent(X, P, 4, 2);
pair top=X+15*dir(X--A), bottom=X+15*dir(X--B);
draw(Circle(O, 2)^^Circle(P, 4));
draw(bottom--X--top);
draw(A--O--B^^O--P^^D--P--C);
pair point=X;
label("$2$", midpoint(O--A), dir(point--midpoint(O--A)));
label("$4$", midpoint(P--D), dir(point--midpoint(P--D)));
label("$O$", O, SE);
label("$P$", P, dir(point--P));
pair point=O;
label("$A$", A, dir(point--A));
label("$B$", B, dir(point--B));
pair point=P;
label("$C$", C, dir(point--C));
label("$D$", D, dir(point--D));
fill((-3,7)--(-3,-7)--(-7,-7)--(-7,7)--cycle, white);[/asy]
$ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$
Let $p=ab+bc+ac$ be a prime number where $a,b,c$ are different two by two, show that $a^3,b^3,c^3$ gives different residues modulo $p$
A field has a shape of checkboard $\text{41x41}$ square. A tank concealed in one of the cells of the field. By one shot, a fighter airplane fires one of the cells. If a shot hits the tank, then the tank moves to a neighboring cell of the field, otherwise it stays in its cell (the cells are neighbours if they share a side). A pilot has no information about the tank , one needs to hit it twice. Find the least number of shots sufficient to destroy the tank for sure. [i](S.Berlov,A.Magazinov)[/i]
Let $x,y,z$ represent the side lengths of any triangle, and $s=\dfrac{x+y+z}{2}$ and the area of this triangle be $\sqrt{s}$ square units. Prove that $$s\Big(\frac{1}{x(s-x)^2}+\frac{1}{y(s-y)^2}+\frac{1}{z(s-z)^ 2} \Big)\ge \frac{1}{2} \Big(\frac{1}{s-x}+\frac{1}{s-y}+\frac{1}{s-z}\Big)$$
[i](Zhuge Liang)[/i]
Let $n$ be a positive integer greater than $1$. Evaluate the following summation:
\[ \sum_{k=0}^{n-1} \frac{1}{1 + 8 \sin^2 \left( \frac{k \pi}{n} \right)}. \]
In triangle $ABC$, $\angle BAC=60^o$/ Let $\omega$ be a circle tangent to segment $AB$ at point $D$ and segment $AC$ at point $E$. Suppose $\omega$ intersects segment $BC$ at points $F$ and $G$ such that$ F$ lies in between $B$ and $G$. Given that $AD = FG = 4$ and $BF = \frac12$ , find the length of $CG$.
[u]Round 5[/u]
[b]p13.[/b] Find the number of six-digit positive integers that satisfy all of the following conditions:
(i) Each digit does not exceed $3$.
(ii) The number $1$ cannot appear in two consecutive digits.
(iii) The number $2$ cannot appear in two consecutive digits.
[b]p14.[/b] Find the sum of all distinct prime factors of $103040301$.
[b]p15.[/b] Let $ABCA'B'C'$ be a triangular prism with height $3$ where bases $ABC$ and $A'B'C'$ are equilateral triangles with side length $\sqrt6$. Points $P$ and $Q$ lie inside the prism so that $ABCP$ and $A'B'C'Q$ are regular tetrahedra. The volume of the intersection of these two tetrahedra can be expressed in the form $\frac{\sqrt{m}}{n}$ , where $m$ and $n$ are positive integers and $m$ is not divisible by the square of any prime. Find $m + n$.
[u]Round 6[/u]
[b]p16.[/b] Let $a_0, a_1, ...$ be an infinite sequence such that $a^2_n -a_{n-1}a_{n+1} = a_n -a_{n-1}$ for all positive integers $n$. Given that $a_0 = 1$ and $a_1 = 4$, compute the smallest positive integer $k$ such that $a_k$ is an integer multiple of $220$.
[b]p17.[/b] Vincent the Bug is on an infinitely long number line. Every minute, he jumps either $2$ units to the right with probability $\frac23$ or $3$ units to the right with probability $\frac13$ . The probability that Vincent never lands exactly $15$ units from where he started can be expressed as $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. What is $p + q$?
[b]p18.[/b] Battler and Beatrice are playing the “Octopus Game.” There are $2022$ boxes lined up in a row, and inside one of the boxes is an octopus. Beatrice knows the location of the octopus, but Battler does not. Each turn, Battler guesses one of the boxes, and Beatrice reveals whether or not the octopus is contained in that box at that time. Between turns, the octopus teleports to an adjacent box and secretly communicates to Beatrice where it teleported to. Find the least positive integer $B$ such that Battler has a strategy to guarantee that he chooses the box containing the octopus in at most $B$ guesses.
[u]Round 7[/u]
[b]p19.[/b] Given that $f(x) = x^2-2$ the number $f(f(f(f(f(f(f(2.5)))))))$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$ and $b$. Find the greatest positive integer $n$ such that $2^n$ divides $ab+a+b-1$.
[b]p20.[/b] In triangle $ABC$, the shortest distance between a point on the $A$-excircle $\omega$ and a point on the $B$-excircle $\Omega$ is $2$. Given that $AB = 5$, the sum of the circumferences of $\omega$ and $\Omega$ can be written in the form $\frac{m}{n}\pi$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? (Note: The $A$-excircle is defined to be the circle outside triangle $ABC$ that is tangent to the rays $\overrightarrow{AB}$ and $\overrightarrow{AC}$ and to the side $ BC$. The $B$-excircle is defined similarly for vertex $B$.)
[b]p21.[/b] Let $a_0, a_1, ...$ be an infinite sequence such that $a_0 = 1$, $a_1 = 1$, and there exists two fixed integer constants $x$ and $y$ for which $a_{n+2}$ is the remainder when $xa_{n+1}+ya_n$ is divided by $15$ for all nonnegative integers $n$. Let $t$ be the least positive integer such that $a_t = 1$ and $a_{t+1} = 1$ if such an integer exists, and let $t = 0$ if such an integer does not exist. Find the maximal value of t over all possible ordered pairs $(x, y)$.
[u]Round 8[/u]
[b]p22.[/b] A mystic square is a $3$ by $3$ grid of distinct positive integers such that the least common multiples of the numbers in each row and column are the same. Let M be the least possible maximal element in a mystic square and let $N$ be the number of mystic squares with $M$ as their maximal element. Find $M + N$.
[b]p23.[/b] In triangle $ABC$, $AB = 27$, $BC = 23$, and $CA = 34$. Let $X$ and $Y$ be points on sides $ AB$ and $AC$, respectively, such that $BX = 16$ and $CY = 7$. Given that $O$ is the circumcenter of $BXY$ , the value of $CO^2$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[b]p24.[/b] Alan rolls ten standard fair six-sided dice, and multiplies together the ten numbers he obtains. Given that the probability that Alan’s result is a perfect square is $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers, compute $a$.
PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949416p26408251]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].