Found problems: 85335
Let $ABC$ be an acute triangle with $AB\le AC$ and let $c(O,R)$ be it's circumscribed circle (with center $O$ and radius $R$). The perpendicular from vertex $A$ on the tangent of the circle passing through point $C$, intersect it at point $D$.
a) If the triangle $ABC$ is isosceles with $AB=AC$, prove that $CD=BC/2$.
b) If $CD=BC/2$, prove that the triangle $ABC$ is isosceles.
Before going to vacation, each of the $ 7$ pupils decided to send to each of the $ 3$ classmates one postcard. Is it possible that each student receives postcards only from the classmates he has sent postcards?
Let $a$, $b$, $c$ be given integers, $a>0$, $ac-b^2=p$ a squarefree positive integer. Let $M(n)$ denote the number of pairs of integers $(x, y)$ for which $ax^2 +bxy+cy^2=n$. Prove that $M(n)$ is finite and $M(n)=M(p^{k} \cdot n)$ for every integer $k \ge 0$.
Do there exist three natural numbers greater than 1, such that the square of each, minus one, is divisible by each of the others?
[i]A. Golovanov[/i]
Let $O$ be a point with three other points $A,B,C$ and $\angle AOB=\angle BOC=\angle AOC=2\pi/3$. Consider the average area of the set of triangles $ABC$ where $OA,OB,OC\in\{3,4,5\}$. The average area can be written in the form $m\sqrt n$ where $m,n$ are integers and $n$ is not divisible by a perfect square greater than $1$. Find $m+n$.
Points $A_1, B_1, C_1$ inside an acute-angled triangle $ABC$ are selected on the altitudes from $A, B, C$ respectively so that the sum of the areas of triangles $ABC_1, BCA_1$, and $CAB_1$ is equal to the area of triangle $ABC$. Prove that the circumcircle of triangle $A_1B_1C_1$ passes through the orthocenter $H$ of triangle $ABC$.
Find all values of the parameter $a$ for which there are exactly $1998$ integers $x$ satisfying the inequality $$x^2 -\pi x +a < 0.$$
The function $ 4x^2\minus{}12x\minus{}1$:
$ \textbf{(A)}\ \text{always increases as }x\text{ increases}\\
\textbf{(B)}\ \text{always decreases as }x\text{ decreases to 1} \\
\textbf{(C)}\ \text{cannot equal 0} \\
\textbf{(D)}\ \text{has a maximum value when }x\text{ is negative} \\
\textbf{(E)}\ \text{has a minimum value of \minus{}10}$
Let $a(n)$ be the sequence defined by $a(1)=2$ and $a(n+1)=(a(n))^{n+1}-1$ for each integer $n\geq 1$. Suppose that $p>2$ is a prime and $k$ is a positive integer. Prove that some term of the sequence $a(n)$ is divisible by $p^k$.
[i]Proposed by John Berman[/i]
Let $n\geq 2$ be an integer. Consider the solutions of the system
$$\begin{cases}
n=a+b-c \\
n=a^2+b^2-c^2
\end{cases}$$
where $a,b,c$ are integers. Show that there is at least one solution and that the solutions are finitely many.
Let $ S$ be the sum of the inversible elements of a finite ring. Prove that $ S^2\equal{}S$ or $ S^2\equal{}0$.
A circle concentric with the inscribed circle of $ABC$ intersects the sides of the triangle at six points forming a convex hexagon $A_1A_2B_1B_2C_1C_2$ (points $C_1$ and $C_2$ on the $AB$ side, $A_1$ and $A_2$ on $BC$, $B_1$ and $B_2$ on $AC$). Prove that if line $A_1B_1$ is parallel to the bisector of angle $B$, then line $A_2C_2$ is parallel to the bisector of angle $C$.
A lazy student used the approximation $\pi=\frac{22} 7$ to calculate the circumference of a given circle. If his
answer was 6, what was the radius of the circle?
Prove that there exists a positive integer $N$ such that for every polynomial $P(x)$ of degree $2019$, there exist $N$ linear polynomials $p_1,p_2, \ldots p_N$ such that $P(x)=p_1(x)^{2019}+p_2(x)^{2019}+ \ldots + p_N(x)^{2019}$. (Assume all polynomials in this problem have real coefficients, and leading coefficients cannot be zero.)
Let $\mathbb{N} = \{1, 2, 3, \dots\}$ be the set of all positive integers, and let $f$ be a bijection from $\mathbb{N}$ to $\mathbb{N}$. Must there exist some positive integer $n$ such that $(f(1), f(2), \dots, f(n))$ is a permutation of $(1, 2, \dots, n)$?
Let $ A_{1}A_{2}A_{3}A_{4}A_{5}$ be a convex pentagon, such that
\[ [A_{1}A_{2}A_{3}] \equal{} [A_{2}A_{3}A_{4}] \equal{} [A_{3}A_{4}A_{5}] \equal{} [A_{4}A_{5}A_{1}] \equal{} [A_{5}A_{1}A_{2}].\]
Prove that there exists a point $ M$ in the plane of the pentagon such that
\[ [A_{1}MA_{2}] \equal{} [A_{2}MA_{3}] \equal{} [A_{3}MA_{4}] \equal{} [A_{4}MA_{5}] \equal{} [A_{5}MA_{1}].\]
Here $ [XYZ]$ stands for the area of the triangle $ \Delta XYZ$.
Let $a,b,c>0$ and $abc=1$. Prove that $$\frac{a}{b^2(c+a)(a+b)}+\frac{b}{c^2(a+b)(b+c)}+\frac{c}{a^2(c+a)(a+b)}\ge \frac{3}{4}.$$
[i](Zhuge Liang)[/i]
Two runners started a race simultaneously. Initially they ran on the street toward the stadium and then 3 laps on the stadium. Both runners covered the whole distance at their own constant speed. During the whole race the first runner passed the second runner exactly twice. Prove that the speed of the first runner is at least double the speed of the second runner.
(Author: I. Rubanov)
There are $24$ apples in $4$ boxes. An optimistic worm is convinced that he can eat no more than half of the apples such that there will be $3$ boxes with equal number of apples. Is it possible that he is wrong?
At Andover, $35\%$ of students are lowerclassmen and the rest are upperclassmen. Given that $26\%$ of lowerclassmen and $6\%$ of upperclassmen take Latin, what percentage of all students take Latin?
[i]Proposed by Anthony Yang[/i]
Let there be $ 4n \plus{} 2$ distinct paths in space with exactly $ 2n^2 \plus{} 6n \plus{} 1$ points at which exactly two of the paths intersect. (A path never intersects itself.) What is the maximum number of points where exactly three paths intersect?
Let $n$ be an even positive integer. Write the numbers $1, 2, \cdots, n^2$ in the squares of an $n \times n$ grid so that the $k$th row, from left to right, is \[ (k-1)n + 1, \ (k-1)n + 2, \ \cdots, \ (k-1)n + n. \] Color the squares of the grid so that half of the squares in each row and in each column are red and the other half are black (a checkerboard coloring is one possibility). Prove that for each coloring, the sum of the numbers on the red squares is equal to the sum of the numbers on the black squares.
In a planar rectangular coordinate system, a sequence of points ${A_n}$ on the positive half of the y-axis and a sequence of points ${B_n}$ on the curve $y=\sqrt{2x}$ $(x\ge0)$ satisfy the condition $|OA_n|=|OB_n|=\frac{1}{n}$. The x-intercept of line $A_nB_n$ is $a_n$, and the x-coordinate of point $B_n$ is $b_n$, $n\in\mathbb{N}$. Prove that
(1) $a_n>a_{n+1}>4$, $n\in\mathbb{N}$;
(2) There is $n_0\in\mathbb{N}$, such that for any $n>n_0$, $\frac{b_2}{b_1}+\frac{b_3}{b_2}+\ldots +\frac{b_n}{b_{n-1}}+\frac{b_{n+1}}{b_n}<n-2004$.
[b]p1.[/b] Find a real number $x$ for which $x\lfloor x \rfloor = 1234.$
Note: $\lfloor x\rfloor$ is the largest integer less than or equal to $x$.
[b]p2.[/b] Let $C_1$ be a circle of radius $1$, and $C_2$ be a circle that lies completely inside or on the boundary of $C_1$. Suppose$ P$ is a point that lies inside or on $C_2$. Suppose $O_1$, and $O_2$ are the centers of $C_1$, and $C_2$, respectively. What is the maximum possible area of $\vartriangle O_1O_2P$? Prove your answer.
[b]p3.[/b] The numbers $1, 2, . . . , 99$ are written on a blackboard. We are allowed to erase any two distinct (but perhaps equal) numbers and replace them by their nonnegative difference. This operation is performed until a single number $k$ remains on the blackboard. What are all the possible values of $k$? Prove your answer.
Note: As an example if we start from $1, 2, 3, 4$ on the board, we can proceed by erasing $1$ and $2$ and replacing them by $1$. At that point we are left with $1, 3, 4$. We may then erase $3$ and $4$ and replacethem by $1$. The last step would be to erase $1$, $1$ and end up with a single $0$ on the board.
[b]p4.[/b] Let $a, b$ be two real numbers so that $a^3 - 6a^2 + 13a = 1$ and $b^3 - 6b^2 + 13b = 19$. Find $a + b$. Prove your answer.
[b]p5.[/b] Let $m, n, k$ be three positive integers with $n \ge k$. Suppose $A =\prod_{1\le i\le j\le m} gcd(n + i, k + j) $ is the product of $gcd(n + i, k + j)$, where $i, j$ range over all integers satisfying $1\le i\le j\le m$. Prove that the following fraction is an integer $$\frac{A}{(k + 1) \dots(k + m)}{n \choose k}.$$
Note: $gcd(a, b)$ is the greatest common divisor of $a$ and $b$, and ${n \choose k}= \frac{n!}{k!(n - k)!}$
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Every point in the plane is coloured one of seven distinct colours. Is there an inscribed trapezoid whose vertices are all of the same colour?