Found problems: 85335
A segment of unit length is cut into eleven smaller segments, each with length of no more than $a$. For what values of $a$, can one guarantee that any three segments form a triangle?
[i](4 points)[/i]
Given a triangle $ABC$, with right $\angle A$, we know: the point $T$ of tangency of the circumference inscribed in $ABC$ with the hypotenuse $BC$, the point $D$ of intersection of the angle bisector of $\angle B$ with side AC and the point E of intersection of the angle bisector of $\angle C$ with side $AB$ . Describe a construction with ruler and compass for points $A$, $B$, and $C$. Justify.
Let $ k$ be a positive integer, $ z$ a complex number, and $ \varepsilon <\frac12$ a positive number. Prove that the following inequality holds for infinitely many positive integers $ n$: \[ \mid \sum_{0\leq l \leq \frac{n}{k+1}} \binom{n-kl}{l}z^l \mid \geq (\frac 12-\varepsilon)^n.\]
[i]P. Turan[/i]
Compute the remainder when $98!$ is divided by $101$.
Let $u, v,w$ be real numbers in geometric progression such that $u > v > w$. Suppose $u^{40} = v^n = w^{60}$. Find the value of $n$.
Prove that in each year , the $13^{th}$ day of some month occurs on a Friday .
Let $ABC$ be a triangle. Circle $\Gamma$ passes through $A$, meets segments $AB$ and $AC$ again at points $D$ and $E$ respectively, and intersects segment $BC$ at $F$ and $G$ such that $F$ lies between $B$ and $G$. The tangent to circle $BDF$ at $F$ and the tangent to circle $CEG$ at $G$ meet at point $T$. Suppose that points $A$ and $T$ are distinct. Prove that line $AT$ is parallel to $BC$.
Suppose we have a necklace of $n$ beads.
Each bead is labeled with an integer and the sum of all these labels is $n - 1$.
Prove that we can cut the necklace to form a string, whose consecutive labels $x_1,x_2,...,x_n$ satisfy
$\sum_{i=1}^{k} x_i \le k - 1$ for any $k = 1,...,n$
A [i]triangulation[/i] of a convex polygon $\Pi$ is a partitioning of $\Pi$ into triangles by diagonals having no common points other than the vertices of the polygon. We say that a triangulation is a [i]Thaiangulation[/i] if all triangles in it have the same area.
Prove that any two different Thaiangulations of a convex polygon $\Pi$ differ by exactly two triangles. (In other words, prove that it is possible to replace one pair of triangles in the first Thaiangulation with a different pair of triangles so as to obtain the second Thaiangulation.)
[i]Proposed by Bulgaria[/i]
Let $n$ be an integer with $n \geq 2$ and let $A \in \mathcal{M}_n(\mathbb{C})$ such that $\operatorname{rank} A \neq \operatorname{rank} A^2.$ Prove that there exists a nonzero matrix $B \in \mathcal{M}_n(\mathbb{C})$ such that $$AB=BA=B^2=0$$
[i]Cornel Delasava[/i]
Investigate the convergence of the integral
\[\int_{-\infty}^{\infty}\int_{-\infty}^{\infty}\frac{dxdy}{1+x^4y^4}\]
Consider all right triangles with integer sides such that the length of the hypotenuse and one of the two sides are consecutive. How many such triangles exist?
Prove that there exists an ordered set in which every uncountable subset contains an uncountable, well-ordered subset and that cannot be represented as a union of a countable family of well-ordered subsets.
[i]A. Hajnal[/i]
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
Prove that For all positive integers $m$ and $n$ , one has $| n \sqrt{2005} - m | > \frac{1}{90n}$
$(CZS 4)$ Let $K_1,\cdots , K_n$ be nonnegative integers. Prove that $K_1!K_2!\cdots K_n! \ge \left[\frac{K}{n}\right]!^n$, where $K = K_1 + \cdots + K_n$
A hemisphere is inscribed in a cone so that its base lies on the base of the cone. The ratio of the area of the entire surface of the cone to the area of the hemisphere (without the base) is $\frac{18}5$. Compute the angle at the vertex of the cone.
Let $ABC$ and $A'B'C'$ be similar triangles with different orientation such that their orthocenters coincide. Show that lines $AA′, BB′, CC′ are concurrent or parallel.
Let $\mathbb{N}$ be the set of positive integers. A function $f:\mathbb{N}\to\mathbb{N}$ satisfies the equation \[\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}\] for all positive integers $n$. Given this information, determine all possible values of $f(1000)$.
[i]Proposed by Evan Chen[/i]
In a convex hexagon $ABCDEF$ the diagonals $AD,BE,CF$ intersect at a point $M$. It is known that the triangles $ABM,BCM,CDM,DEM,EFM,FAM$ are acute. It is also known that the quadrilaterals $ABDE,BCEF,CDFA$ have the same area. Prove that the circumcenters of triangles $ABM,BCM,CDM,DEM,EFM,FAM$ are concyclic.
[i]Proposed by Nairy Sedrakyan[/i]
A positive integer is called [i]powerful [/i]if all exponents in its prime factorization are $\ge 2$. Prove that there are infinitely many pairs of powerful consecutive positive integers.
[i](Walther Janous)[/i]
The number $2024$ is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum?
$\textbf{(A) }20\qquad\textbf{(B) }21\qquad\textbf{(C) }22\qquad\textbf{(D) }23\qquad\textbf{(E) }24$
Compute $$\lim \limits_{n \to \infty}\frac{1}{n}\sum \limits_{k=1}^n\frac{\sqrt[n+k+1]{n+1}-\sqrt[n+k]{n}}{\sqrt[n+k]{n+1}-\sqrt[n+k]{n}}$$
There are two pipes on the plane (the pipes are circular cylinders of equal size, $4$ m around). Two of them are parallel and, being tangent one to another in the common generatrix, form a tunnel over the plane. The third pipe is perpendicular to two others and cuts out a chamber in the tunnel. Determine the area of the surface of this chamber.
Dua has all the odd natural numbers less than 20. Asija has all the even numbers less than 21. They play the following game. In each round, they take a number from each other and after every round, they may fix two or more consecutive numbers so that their opponent cannot take these fixed numbers in the next round. The game is won by the player who attains 10 consecutive numbers first. Does either player have a winning strategy?