Found problems: 85335
Let $C$ be a semicircle with diameter $AB$. Circles $S$, $S_1$, $S_2$ with radii $r$, $r_1$, $r_2$, respectively, are tangent to $C$ and the segment $AB$, and moreover $S_1$ and $S_2$ are externally tangent to $S$. Prove that $\frac{1}{\sqrt{r_1}}+\frac{1}{\sqrt{r_2}}=\frac{2\sqrt{2}}{\sqrt{r}}$
Let $ABCD$ be a parallelogram. Suppose that $E$ is on line $DC$ such that $C$ lies on segment $ED$. Then say lines $AE$ and $BD$ intersect at $X$ and lines $CX$ intersects AB at F. If $AB = 7$,$ BC = 13$, and $CE = 91$, then find $\frac{AF}{FB}$.
Let $ABCD$ be an isosceles trapezoid inscribed in circle $\omega$, such that $AD \| BC$. Point $E$ is chosen on the arc $BC$ of $\omega$ not containing $A$. Let $BC$ and $DE$ intersect at $F$. Show that if $E$ is chosen such that $EB = EC$, the area of $AEF$ is maximized.
Let $A$ and $B$ be two points on the same line $\ell$. If the points $P$ and $Q$ are two points $X$ on $\ell$ that mazimize and minimize the ratio $\frac{AX}{BX}$ respectively, prove that $A,B,P$ and $Q$ are concyclic.
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ which are differentiable in $0$ and satisfy the following inequality for all real numbers $x,y$ \[f(x+y)+f(xy)\geq f(x)+f(y).\][i]Dan Ștefan Marinescu and Mihai Piticari[/i]
Let $n>1 \in \mathbb{N}$ and $a_1, a_2, ..., a_n$ be a sequence of $n$ natural integers. Let:
$$b_1 = \left[\frac{a_2 + \cdots + a_n}{n-1}\right], b_i = \left[\frac{a_1 + \cdots + a_{i-1} + a_{i+1} + \cdots + a_n}{n-1}\right], b_n = \left[\frac{a_1 + \cdots + a_{n-1}}{n-1}\right]$$
Define a mapping $f$ by $f(a_1,a_2, \cdots a_n) = (b_1,b_2,\cdots,b_n)$.
a) Let $g: \mathbb{N} \to \mathbb{N}$ be a function such that $g(1)$ is the number of different elements in $f(a_1,a_2, \cdots a_n)$ and $g(m)$ is the number od different elements in $f^m(a_1,a_2, \cdots a_n) = f(f^{m-1}(a_1,a_2, \cdots a_n)); m>1$. Prove that $\exists k_0 \in \mathbb{N}$ s.t. for $m \ge k_0$ the function $g(m)$ is periodic.
b) Prove that $\sum_{m=1}^k \frac{g(m)}{m(m+1)} < C$ for all $k \in \mathbb{N}$, where $C$ is a function that doesn't depend on $k$.
An airline offer $2000$ two-way routes connecting $64$ towns in a country. Show that it is possible to reach any town from any other town using the offered routes.
In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test,
\[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]
(a) Is it true that, for arbitrary integer $n{}$ greater than $1$ and distinct positive integers $i{}$ and $j$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'}$ and $j^{'}$ whose product $i^{'}j^{'}$ is divisible by the product $ij$?
(b) Is it true that, for arbitrary integer $n{}$ greater than $2$ and distinct positive integers $i, j, k$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'},j^{'},k^{'}$ whose product $i^{'}j^{'}k^{'}$ is divisible by the product $ijk$?
We call a set $S$ a [i]good[/i] set if $S=\{x,2x,3x\}(x\neq 0).$ For a given integer $n(n\geq 3),$ determine the largest possible number of the [i]good[/i] subsets of a set containing $n$ positive integers.
It is known that the equation$ |x - 1| + |x - 2| +... + |x - 2001| = a$ has exactly one solution. Find $a$.
Prove that there are infinitely many pairs $(a, b)$ of positive integers with the following properties:
$\bullet$ $a+b$ divides $ab+1$,
$\bullet$ $a-b$ divides $ab -1$,
$\bullet$ $b > 2$ and $a > b\sqrt3 - 1$.
A baker uses $6\tfrac{2}{3}$ cups of flour when she prepares $\tfrac{5}{3}$ recipes of rolls. She will use $9\tfrac{3}{4}$ cups of flour when she prepares $\tfrac{m}{n}$ recipes of rolls where m and n are relatively prime positive integers. Find $m + n.$
The incircle $\omega$ of a triangle $ABC$ touches $BC, AC$ and $AB$ at points $A_0, B_0$ and $C_0$ respectively. The bisectors of angles $B$ and $C$ meet the perpendicular bisector to segment $AA_0$ at points $Q$ and $P$ respectively. Prove that $PC_0$ and $QB_0$ meet on $\omega$ .
Given a cyclic quadrilateral $ABCD$, let $M$ be the midpoint of the side $CD$, and let $N$ be a point on the circumcircle of triangle $ABM$. Assume that the point $N$ is different from the point $M$ and satisfies $\frac{AN}{BN}=\frac{AM}{BM}$. Prove that the points $E$, $F$, $N$ are collinear, where $E=AC\cap BD$ and $F=BC\cap DA$.
[i]Proposed by Dusan Dukic, Serbia and Montenegro[/i]
Let $\{f_n\}_{n \ge 0}$ be the Fibonacci sequence, given by $f_0 = f_1 = 1$, and for all positive integers $n$ the recurrence $f_{n+1} = f_n + f_{n-1}$.
Let $a_n = f_{n+1}f_n$ for any non-negative integer $n$, and let $$P_n(X) = X^n + a_{n-1}X^{n-1} + ... + a_1X + a_0.$$
Prove that for all positive integers $n \ge 3$ the polynomial $P_n(X)$ is irreducible in $Z[X]$.
Find integer solutions $(x,y)$ of the equation ($1964$ times "$\sqrt{}$"):
$$\sqrt{x+\sqrt{x+\sqrt{....\sqrt{x+\sqrt{x}}}}}=y$$
Investigate the asymptotic behaviour of the solutions $y$ of the equation $x^5 + x^2y^2 = y^6$ that tend to zero as $x\to0$.
Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.
[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square?
[b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$.
[b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$.
[b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle.
[b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Many television screens are rectangles that are measured by the length of their diagonals. The ratio of the horizontal length to the height in a standard television screen is $ 4 : 3$. The horizontal length of a “$ 27$-inch” television screen is closest, in inches, to which of the following?
[asy]import math;
unitsize(7mm);
defaultpen(linewidth(.8pt)+fontsize(8pt));
draw((0,0)--(4,0)--(4,3)--(0,3)--(0,0)--(4,3));
fill((0,0)--(4,0)--(4,3)--cycle,mediumgray);
label(rotate(aTan(3.0/4.0))*"Diagonal",(2,1.5),NW);
label(rotate(90)*"Height",(4,1.5),E);
label("Length",(2,0),S);[/asy]$ \textbf{(A)}\ 20 \qquad
\textbf{(B)}\ 20.5 \qquad
\textbf{(C)}\ 21 \qquad
\textbf{(D)}\ 21.5 \qquad
\textbf{(E)}\ 22$
Let $0\leq p,r\leq 1$ and consider the identities
$$a)\; (px+(1-p)y)^{2}=a x^2 +bxy +c y^2, \;\;\;\, b)\; (px+(1-p)y)(rx+(1-r)y) =\alpha x^2 + \beta xy + \gamma y^2.$$
Show that
$$ a)\; \max(a,b,c) \geq \frac{4}{9}, \;\;\;\; b)\; \max( \alpha, \beta , \gamma) \geq \frac{4}{9}.$$
Consider the sequence $a(n)$ defined by the following conditions: $$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$
Prove that the sequence contains an infinite number of perfect squares. (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which
\[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\]
Find the number of elements of the set $A_n$.
[i]Proposed by Vidan Govedarica, Serbia[/i]
Farmer James wishes to cover a circle with circumference $10\pi$ with six different types of colored arcs. Each type of arc has radius $5$, has length either $\pi$ or $2\pi$, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions:
[list][*] Any two adjacent arcs are of different colors.
[*] Any three adjacent arcs where the middle arc has length $\pi$ are of three different colors. [/list]
Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another.
[i]Proposed by James Lin.[/i]