Found problems: 85335
Let $P$ be a polynomial, with real coefficients, in three variables and $F$ be a function of two variables such that
\[
P(ux, uy, uz) = u^2 F(y-x,z-x) \quad \mbox{for all real $x,y,z,u$},
\]
and such that $P(1,0,0)=4$, $P(0,1,0)=5$, and $P(0,0,1)=6$. Also let $A,B,C$ be complex numbers with $P(A,B,C)=0$ and $|B-A|=10$. Find $|C-A|$.
Let all the edges of tetrahedron \(A_1A_2A_3A_4\) be tangent to sphere \(S\). Let \(\displaystyle a_i\) denote the length of the tangent from \(A_i\) to \(S\). Prove that
\[\bigg(\sum_{i=1}^4 \frac 1{a_i}\bigg)^{\!\!2}> 2\bigg(\sum_{i=1}^4 \frac1{a_i^2}\bigg). \]
[i]Submitted by Viktor Vígh, Szeged[/i]
Let $n$ be a positive integer. A regular hexagon $ABCDEF$ with side length $n$ is partitioned into $6n^2$ equilateral triangles with side length $1$. The hexagon is covered by $3n^2$ rhombuses with internal angles $60^{\circ}$ and $120^{\circ}$ such that each rhombus covers exactly two triangles and every triangle is covered by exactly one rhombus. Show that the diagonal $AD$ divides in half exactly $n$ rhombuses.
Let $ABCD$ be an orthodiagonal trapezoid such that $\measuredangle A = 90^{\circ}$ and $AB$ is the larger base. The diagonals intersect at $O$, $\left( OE \right.$ is the bisector of $\measuredangle AOD$, $E \in \left( AD \right)$ and $EF \| AB$, $F \in \left( BC \right)$. Let $P,Q$ the intersections of the segment $EF$ with $AC,BD$. Prove that:
(a) $EP=QF$;
(b) $EF=AD$.
[i]Claudiu-Stefan Popa[/i]
The numbers from $1$ to $2n$ are arranged in a certain order in the cell of the strip $1 \times 2n$. Let's call a [i]flip[/i] an operation that takes one cell from the left half of the strip and one cell from the right half of the strip, after which it swaps the numbers written in them, but only if the larger of these numbers is located to the left of the smaller one. Prove that if all $n^2$ possible flips are performed in any order, then all numbers from $1$ to $n$ will be written in the left, and all numbers from $n + 1$ up to $2n$ — in the right half of the strip.
Two players play a game on an $8$ by $8$ chessboard according to the following rules. The first player places a knight on the board. Then each player in turn moves the knight , but cannot place it on a square where it has been before. The player who has no move loses. Who wins in an errorless game , the first player or the second one? (The knight moves are the normal ones. )
(V . Zudilin , year 12 student , Beltsy (Moldova))
Let $f(x) = x^2 + bx + 1$ for some real number $b$. Across all possible values of $b$, find all
possible values for the number of integers $x$ that satisfy $f(f(x) + x) < 0$.
We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ .
[i]Proposed by Abbas Mehrabian, Iran[/i]
Let $Y$ be the family of all subsets of $X = \{1,2,...,n\}$ ($n > 1$) and let $f : Y \to X$ be an arbitrary mapping. Prove that there exist distinct subsets $A,B$ of $X$ such that $f(A) = f(B) = max A\triangle B$, where $A\triangle B = (A-B)\cup(B-A)$.
Each detail of the “Young Solderer” instructor is a bracket in the shape of the letter $\Pi$, consisting of three single segments. Is it possible from the parts of this constructor are soldered together, a complete wire frame of the cube $2 \times 2 \times 2$, divided into $1 \times 1 \times 1$ cubes? (The frame consists of 27 points, connected by single segments; any two adjacent points must be connected by exactly one piece of wire.)
[hide]=original wording]Каждая деталько нструктора ''Юный паяльщик'' — это скобка в виде буквы П, остоящая из трех единичных отрезков. Можно ли издеталей этого конструктора спаятьполный роволочный каркас куба 2 × × 2 × 2, разбитого на кубики 1 × 1 × 1? (Каркас состоит из 27 точек,соединенных единичными отрезками; любые две соседние точки должны бытьсоединены ровно одним проволочным отрезком.)[/hide]
A projectile moves in a resisting medium. The resisting force is a function of the velocity and is directed along the velocity vector. The equation $x=f(t)$ (where $f(t)$ is not constant) gives the horizontal distance in terms of the time $t$. Show that the vertical distance $y$ is given by
$$y=-gf(t) \int \frac{dt}{f'(t)} + g \int \frac{f(t)}{f'(t)} \, dt +Af(t)+B$$
where $A$ and $B$ are constants and $g$ is the acceleration due to gravity.
What is the largest possible length of an arithmetic progression of positive integers $ a_{1}, a_{2},\cdots , a_{n}$ with difference $ 2$, such that $ {a_{k}}^{2}\plus{}1$ is prime for $ k \equal{} 1, 2, . . . , n$?
Let $S$ be the number of bijective functions $f:\{0,1,\dots,288\}\rightarrow\{0,1,\dots,288\}$ such that $f((m+n)\pmod{17})$ is divisible by $17$ if and only if $f(m)+f(n)$ is divisible by $17$. Compute the largest positive integer $n$ such that $2^n$ divides $S$.
Amy is traveling on the $xy$-plane in a spaceship where her motion is described by the following equation $xe^y = ye^x$. Given that her $x$-component of velocity is a constant $3$ mph , the magnitude of her velocity as she approaches $(1,-1)$ can be expressed as $\sqrt{\frac{a + be^4}{ c + de^2}}$ . Find $\frac{ac}{bd}$ .
(You may assume that the initial conditions do allow her to approach $(1,-1)$)
$6$ people each have a hat. If they shuffle their hats and redistribute them, what is the probability that exactly one person gets their own hat back?
Larry and Rob are two robots travelling in one car from Argovia to Zillis. Both robots have control over the steering and steer according to the following algorithm: Larry makes a 90 degrees left turn after every $ \ell$ kilometer driving from start, Rob makes a 90 degrees right turn after every $ r$ kilometer driving from start, where $ \ell$ and $ r$ are relatively prime positive integers.
In the event of both turns occurring simultaneously, the car will keep going without changing direction. Assume that the ground is flat and the car can move in any direction. Let the car start from Argovia facing towards Zillis. For which choices of the pair ($ \ell$, $ r$) is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?
Let $A_0A_1A_2A_3A_4A_5$ be a convex hexagon inscribed in a circle. Define the points $A_0'$, $A_2'$, $A_4'$ on the circle, such that
\[ A_0A_0' \parallel A_2A_4, \quad A_2A_2' \parallel A_4A_0, \quad A_4A_4' \parallel A_2A_0 . \]
Let the lines $A_0'A_3$ and $A_2A_4$ intersect in $A_3'$, the lines $A_2'A_5$ and $A_0A_4$ intersect in $A_5'$ and the lines $A_4'A_1$ and $A_0A_2$ intersect in $A_1'$.
Prove that if the lines $A_0A_3$, $A_1A_4$ and $A_2A_5$ are concurrent then the lines $A_0A_3'$, $A_4A_1'$ and $A_2A_5'$ are also concurrent.
Evaluate $1 + 2 - 3 - 4 + 5 + 6 - 7 - 8 + ... + 2018 - 2019$.
[b]p16[/b] Madelyn is being paid $\$50$/hour to find useful [i]Non-Functional Trios[/i], where a Non-Functional Trio is defined as an ordered triple of distinct real numbers $(a, b, c)$, and a Non- Functional Trio is [i]useful [/i] if $(a, b)$, $(b, c)$, and $(c, a)$ are collinear in the Cartesian plane. Currently, she’s working on the case $a+b+c = 2022$. Find the number of useful Non-Functional Trios $(a, b, c)$ such that $a + b + c = 2022$.
[b]p17[/b] Let $p(x) = x^2 - k$, where $k$ is an integer strictly less than $250$. Find the largest possible value of k such that there exist distinct integers $a, b$ with $p(a) = b$ and $p(b) = a$.
[b]p18[/b] Let $ABC$ be a triangle with orthocenter $H$ and circumcircle $\Gamma$ such that $AB = 13$, $BC = 14$, and $CA = 15$. $BH$ and $CH$ meet $\Gamma$ again at points $D$ and $E$, respectively, and $DE$ meets $AB$ and $AC$ at $F$ and $G$, respectively. The circumcircles of triangles $ABG$ and $ACF$ meet BC again at points $P$ and $Q$. If $PQ$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd (a, b) = 1$, find $a + b$.
Let $\omega$ be a semicircle with diamater $AB$. Let $M$ be the midpoint of $AB$. Let $X,Y$ be points on the same semiplane with $\omega$ with respect to the line $AB$ such that $AMXY$ is a parallelogram. Let $XM\cap \omega = C$ and $YM \cap \omega = D$. Let $I$ be the incenter of $\triangle XYM$. Let $AC \cap BD= E$ and $ME$ intersects $XY$ at $T$. Let the intersection point of $TI$ and $AB$ be $Q$ and let the perpendicular projection of $T$ onto $AB$ be $P$. Prove that $M$ is midpoint of $PQ$
The cheering team of Ubon Ratchathani University sits on the amphitheater that has $441$ seats arranged into a $21\times 21$ grid. Every seat is occupied by exactly one person, and each person has a blue sign and a yellow sign.
Count the number of ways for each person to raise one sign so that each row and column has an odd number of people raising a blue sign.
We call a positive integer [i]interesting [/i] if the number and the number with its digits written in reverse order both leave remainder $2$ in division by $4$.
a) Determine if $2018$ is an interesting number.
b) For every positive integer $n$, find how many interesting $n$-digit numbers there are.
Find all triples $(a, b, c)$ of positive integers such that $a^3 + b^3 + c^3 = (abc)^2$.
Let $n$ be a positive integer. In an $n\times4$ table, each row is equal to
\[\begin{tabular}{| c | c | c | c |}
\hline
2 & 0 & 1 & 0 \\
\hline
\end{tabular}\]
A [i]change[/i] is taking three consecutive boxes in the same row with different digits in them and changing the digits in these boxes as follows:
\[0\to1\text{, }1\to2\text{, }2\to0\text{.}\]
For example, a row $\begin{tabular}{| c | c | c | c |}\hline 2 & 0 & 1 & 0 \\ \hline\end{tabular}$ can be changed to the row $\begin{tabular}{| c | c | c | c |}\hline 0 & 1 & 2 & 0 \\ \hline\end{tabular}$ but not to $\begin{tabular}{| c | c | c | c |}\hline 2 & 1 & 2 & 1 \\ \hline\end{tabular}$ because $0$, $1$, and $0$ are not distinct.
Changes can be applied as often as wanted, even to items already changed. Show that for $n<12$, it is not possible to perform a finite number of changes so that the sum of the elements in each column is equal.
Determine the minimum value of prime $p> 3$ for which there is no natural number $n> 0$ such that $2^n+3^n\equiv 0\pmod{p} $.