This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

A point $ D$ is chosen on side $ BC$ of a triangle $ ABC$ such that the inradii of triangles $ ABD$ and $ ACD$ are equal. Consider in these triangles the excircles touching sides $ BD$ and $ CD$, respectively. Prove that their radii are also equal.
Source: Romania 1999 7.1 Determine the side lengths of a right trianlge if they are intgers and the product of the leg lengths is equal to three times the perimeter.
We say a positive integer $ n$ is [i]good[/i] if there exists a permutation $ a_1, a_2, \ldots, a_n$ of $ 1, 2, \ldots, n$ such that $ k \plus{} a_k$ is perfect square for all $ 1\le k\le n$. Determine all the good numbers in the set $ \{11, 13, 15, 17, 19\}$.
Find all quadruplets $(a, b, c, d)$ of positive integers such that \[ \left( 1 + \frac{1}{a} \right) \left( 1 + \frac{1}{b} \right) \left( 1 + \frac{1}{c} \right) \left( 1 + \frac{1}{d} \right) = 4. \]
Define $S_0$ to be $1.$ For $n \geq 1 $, let $S_n $ be the number of $n\times n $ matrices whose elements are nonnegative integers with the property that $a_{ij}=a_{ji}$ (for $i,j=1,2,\ldots, n$) and where $\sum_{i=1}^{n} a_{ij}=1$ (for $j=1,2,\ldots, n$). Prove that a) $S_{n+1}=S_{n} +nS_{n-1}.$ b) $\sum_{n=0}^{\infty} S_{n} \frac{x^{n}}{n!} =\exp \left(x+\frac{x^{2}}{2}\right).$
The ratio between the circumradius and the inradius of a given triangle is $7 : 2$. If the length of two sides of the triangle are $3$ and $7$, and the length of the remaining side is also an integer, what is the length of the remaining side?
Given three parallel lines on the plane. Find the locus of incenters of triangles with vertices lying on these lines (a single vertex on each line).
A point $P$ is interior to the triangle $ABC$ such that $AP \perp BC$. Let $E, F$ be the projections of $CA, AB$. Suppose that the tangents at $E, F$ of the circumcircle of triangle $AEF$ meets at a point on $BC$. Prove that $P$ is the orthocenter of triangle $ABC$. Do Thanh Son, High School of Natural Sciences, National University, Hanoi
Prove that for every $n \in N$, $n > 6$, every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.
Find all real numbers $c$ such that there exists a function $f: \mathbb{R}_{ \ge 0} \rightarrow \mathbb{R}$ which satisfies the following. For all nonnegative reals $x, y$, $f(x+y^2) \ge cf(x)+y$. Here $\mathbb{R}_{\ge 0}$ is the set of all nonnegative reals.
Let $ F_0\equal{}\ln x.$ For $ n\ge 0$ and $ x>0,$ let $ \displaystyle F_{n\plus{}1}(x)\equal{}\int_0^xF_n(t)\,dt.$ Evaluate $ \displaystyle\lim_{n\to\infty}\frac{n!F_n(1)}{\ln n}.$
Given a rectangle $ABCD$ with $AB> BC$. On the side $CD$, take a point $L$ such that $BL$ and $AC$ are perpendicular. Let $K$ be the intersection point of segments $BL$ and $AC$. It is known that segments $AL$. and $DK$ are perpendicular. Find $\angle ACB.$
A positive integer is called [i]fancy[/i] if it can be expressed in the form $$2^{a_1}+2^{a_2}+ \cdots+ 2^{a_{100}},$$ where $a_1,a_2, \cdots, a_{100}$ are non-negative integers that are not necessarily distinct. Find the smallest positive integer $n$ such that no multiple of $n$ is a [i]fancy[/i] number. [i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]
Find all functions $f: \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$, for which $f(k+1)>f(f(k)) \quad \forall k \geq 1$.
Isosceles triangle $\triangle{ABC}$ has $\angle{ABC}=\angle{ACB}=72^\circ$ and $BC=1$. If the angle bisector of $\angle{ABC}$ meets $AC$ at $D$, what is the positive difference between the perimeters of $\triangle{ABD}$ and $\triangle{BCD}$? [i]2019 CCA Math Bonanza Tiebreaker Round #2[/i]
For $100$ straight lines on a plane, let $T$ be the set of all right-angled triangles bounded by some $3$ lines. Determine, with proof, the maximum value of $|T|$.
(a) Find the smallest number of lines drawn on the plane so that they produce exactly 2022 points of intersection. (Note: For 1 point of intersection, the minimum is 2; for 2 points, minimum is 3; for 3 points, minimum is 3; for 4 points, minimum is 4; for 5 points, the minimum is 4, etc.) (b) What happens if the lines produce exactly 2023 intersections?
For any set of points $A_1, A_2,...,A_n$ on the plane, one defines $r( A_1, A_2,...,A_n)$ as the radius of the smallest circle that contains all of these points. Prove that if $n \ge 3$, there are indices $i,j,k$ such that $r( A_1, A_2,...,A_n)=r( A_i, A_j,A_k)$
Let $ [a]$ be the integer such that $ [a]\le a<[a]\plus{}1$. Find all real numbers $ (a,b,c)$ such that \[ \{a\}\plus{}[b]\plus{}\{c\}\equal{}2.9\\\{b\}\plus{}[c]\plus{}\{a\}\equal{}5.3\\\{c\}\plus{}[a]\plus{}\{b\}\equal{}4.0.\]
Find all real numbers $x$ such that $x\lfloor x\lfloor x\lfloor x\rfloor\rfloor\rfloor=88$. The notation $\lfloor x\rfloor$ means the greatest integer less than or equal to $x$.
Camila writes down five positive integers. The unique mode of these integers is $2$ greater than their median, and the median is $2$ greater than their arithmetic mean. What is the least possible value for the mode? $\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }11\qquad\textbf{(E) }13$
Let \((a_n)_{n \geq 1}\) s sequence of reals such that \(\sum_{n \geq 1}{\frac{a_n}{n}}\) converges. Show that \(\lim_{n \rightarrow \infty}{\frac{1}{n} \cdot \sum_{k=1}^{n}{a_k}} = 0\)
In quadrilateral $ABCD$, $S_{\triangle ABD}:S_{\triangle BCD}:S_{\triangle ABC}=3:4:1$. $M\in AC,N\in CD$, satisfying that $\frac{AM}{AC}=\frac{CN}{CD}$. If $B,M,N$ are collinear, prove that $M,N$ are mid points of $AC,CD$.
We call a table of size $n \times n$ self-describing if each cell of the table contains the total number of even numbers in its row and column other than itself. How many self-describing tables of size a) $3 \times 3$ exist? b) $4 \times 4$ exist? c) $5 \times 5$ exist? Two tables are different if they differ in at least one cell.
On a table are given $1999$ red candies and $6661$ yellow candies. The candies are indistinguishable due to the same packing. A gourmet applies the following procedure as long as it is possible: (i) He picks any of the remaining candies, notes its color, eats it and goes to (ii). (ii) He picks any of the remaining candies, and notes its color: if it is the same as the color of the last eaten candy, eats it and goes to (ii); otherwise returns it upon repacking and goes to (i). Prove that all the candies will be eaten and find the probability that the last eaten candy will be red.