Found problems: 85335
The points $M, N, P$ are chosen on the sides $BC, CA, AB$ of a triangle $\Delta ABC$, such that the triangle $\Delta MNP$ is acute-angled. We denote with $x$ the length of the shortest altitude of the triangle $\Delta ABC$, and with $X$ the length of the longest altitudes of the triangle $\Delta MNP$. Prove that $x \leq 2X$.
A pyramid has a triangular base with side lengths $20$, $20$, and $24$. The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$. The volume of the pyramid is $m\sqrt{n}$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$.
There is a board numbered $-10$ to $10$. Each square is coloured either red or white, and the sum of the numbers on the red squares is $n$. Maureen starts with a token on the square labeled $0$. She then tosses a fair coin ten times. Every time she flips heads, she moves the token one square to the right. Every time she flips tails, she moves the token one square to the left. At the end of the ten flips, the probability that the token finishes on a red square is a rational number of the form $\frac a b$. Given that $a + b = 2001$, determine the largest possible value for $n$.
A $4$-dimensional hypercube of edge length $1$ is constructed in $4$-space with its edges parallel to
the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given
by $(a, b, c, d)$, where each of $a, b, c,$ and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given
by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional
volume of the solid formed by the intersection.
The two circles ${{w} _ {1}}, \, \, {{w} _ {2}}$ touch externally at the point $Q$. The common external tangent of these circles is tangent to ${{w} _ {1}}$ at the point $B$, $BA$ is the diameter of this circle. A tangent to the circle ${{w} _ {2}} $ is drawn through the point $A$, which touches this circle at the point $C$, such that the points $B$ and $C$ lie in one half-plane relative to the line $AQ$. Prove that the circle ${{w} _ {1}}$ bisects the segment $C $.
(Igor Nagel)
Suppose $f(x)$ is a polynomial with integer coefficients satisfying the condition $0 \le f(c) \le 1997$ for each $c \in \{0, 1, ..., 1998\}$. Is is true that $f(0) = f(1) = ... = f(1998)$?
(variation of [url=https://artofproblemsolving.com/community/c6h49788p315649]1997 IMO Shortlist p12[/url])
Let $ABC$ be a triangle and let $X$ be a point in its interior. Point $S_A$ is the midpoint of arc $BC$ containing $X$ of the circumcircle of $BCX$. $S_B$ and $S_C$ are defined similarly. Prove that $S_A,S_B,S_C$ and $X$ are concyclic.
We want to choose telephone numbers for a city. The numbers have $10$ digits and $0$ isn’t used in the numbers. Our aim is: We don’t choose some numbers such that every $2$ telephone numbers are different in more than one digit OR every $2$ telephone numbers are different in a digit which is more than $1$. What is the maximum number of telephone numbers which can be chosen? In how many ways, can we choose the numbers in this maximum situation?
Let $x_1,x_2,\ldots,x_n$ be distinct positive integers. Prove that
\[ x_1^2+x_2^2 + \cdots + x_n^2 \geq \frac {2n+1}3 ( x_1+x_2+\cdots + x_n). \]
[i]Laurentiu Panaitopol[/i]
Let $a,b,c,d,e\geq -1$ and $a+b+c+d+e=5.$ Find the maximum and minimum value of $S=(a+b)(b+c)(c+d)(d+e)(e+a).$
Determine the number of ordered pairs of positive integers $(m,n)$ with $1\leq m\leq 100$ and $1\leq n\leq 100$ such that
\[
\gcd(m+1,n+1) = 10\gcd(m,n).
\]
Prove that the natural numbers can be divided into two groups in a way that both conditions are fulfilled:
1) For every prime number $p$ and every natural number $n$, the numbers $p^n,p^{n+1}$ and $p^{n+2}$ do not have the same colour.
2) There does not exist an infinite geometric sequence of natural numbers of the same colour.
Let $x,y$ be two positive real numbers such that $x^4-y^4=x-y$. Prove that
$$\frac{x-y}{x^6-y^6}\leq \frac{4}{3}(x+y).$$
There are $9$ vertical columns in a row. In some places, horizontal sticks are inserted between adjacent columns, no two are at the same height. The beetle crawls from the bottom up; when he meets the wand, he crawls over it to the next column and continues to crawl up. It is known that if a beetle starts at the bottom of the first (leftmost) column, then it will end its journey on the ninth (rightmost) column. Is it always possible to remove one stick so that the beetle
ends up at the top of the fifth column? (For example, if the sticks are arranged as in picture, the beetle will crawl along a solid line. If you remove the third one A stick in the path of the beetle, then it will crawl along the dotted line.)
[i] Proposed by G. Karavaev[/i]
The quadratic equation $ax^2 + bx + c = 0$ has its roots in the interval $[0, 1]$. Find the maximum of $\frac{(a - b)(2a - b)}{a(a - b + c)}$.
Consider the square grid with $A=(0,0)$ and $C=(n,n)$ at its diagonal ends. Paths from $A$ to $C$ are composed of moves one unit to the right or one unit up. Let $C_n$ (n-th catalan number) be the number of paths from $A$ to $C$ which stay on or below the diagonal $AC$. Show that the number of paths from $A$ to $C$ which cross $AC$ from below at most twice is equal to $C_{n+2}-2C_{n+1}+C_n$
Find all functions $f:\mathbb{Z}_{>0}\mapsto\mathbb{Z}_{>0}$ such that
$$xf(x)+(f(y))^2+2xf(y)$$
is perfect square for all positive integers $x,y$.
**This problem was proposed by me for the BMO 2017 and it was shortlisted. We then used it in our TST.
Find all prime numbers $p,q,r,k$ such that $pq+qr+rp = 12k+1$
Let $f:[0,1]\times[0,1]\to\mathbb R$ be a continuous function. Find the limit
$$\lim_{n\to\infty}\left(\frac{(2n+1)!}{(n!)^2}\right)^2\int^1_0\int^1_0(xy(1-x)(1-y))^nf(x,y)\text dx\text dy.$$
Find all strictly monotonic functions $f: \mathbb{R}^+\rightarrow\mathbb{R}^+$ for which $f\left(\frac{x^2}{f(x)}\right)=x$ for all $x$.
A function $f : R \to R$ satisfy the functional equation $f(x + 2y) + 2f(y - 2x) = 3x -4y + 6$ for all reals $x, y$. Compute $f(2548)$.
Find the number of positive integers less than or equal to $2017$ that have at least one pair of adjacent digits that are both even. For example, count the numbers $24$, $1862$, and $2012$, but not $4$, $58$, or $1276$.
Matt has somewhere between $1000$ and $2000$ pieces of paper he's trying to divide into piles of the same size (but not all in one pile or piles of one sheet each). He tries $2$, $3$, $4$, $5$, $6$, $7$, and $8$ piles but ends up with one sheet left over each time. How many piles does he need?
Let $ABC$ be a triangle such that $AB < AC$. Let $P$ lie on a line through $A$ parallel to line $BC$ such that $C$ and $P$ are on the same side of line $AB$. Let $M$ be the midpoint of segment $BC$. Define $D$ on segment $BC$ such that $\angle BAD = \angle CAM$, and define $T$ on the extension of ray $CB$ beyond $B$ so that $\angle BAT = \angle CAP$. Given that lines $PC$ and $AD$ intersect at $Q$, that lines $PD$ and $AB$ intersect at $R$, and that $S$ is the midpoint of segment $DT$, prove that if $A$,$P$,$Q$, and $R$ lie on a circle, then $Q$, $R$, and $S$ are collinear.
[i]David Rush[/i]
Let $P(x)$ be an odd degree polynomial in $x$ with real coefficients. Show that the equation $P(P(x))=0$ has at least as many distinct real roots as the equation $P(x)=0$.