Found problems: 85335
Point $F$ lies on the circumscribed circle around $\Delta ABC$, $P$ and $Q$ are projections of point $F$ on $AB$ and $AC$ respectively. Prove that, if $M$ and $N$ are the middle points of $BC$ and $PQ$ respectively, then $MN$ is perpendicular to $FN$.
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties:
(a) if $x\le y$, then $f(x)\le f(y)$; and
(b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$.
Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$.
[i](United Kingdom) Ben Elliott[/i]
Prove that if $ c, d $ are integers with $ c \neq d $, $ d > 0 $ then the equation $$ x^3 - 3cx^2 - dx + c = 0$$
has no more than one rational root.
Evaluate $\sin(1998^\circ+237^\circ)\sin(1998^\circ-1653^\circ)$.
Let $k \geq 2, 1 < n_1 < n_2 < \ldots < n_k$ are positive integers, $a,b \in \mathbb{Z}^+$ satisfy \[ \prod^k_{i=1} \left( 1 - \frac{1}{n_i} \right) \leq \frac{a}{b} < \prod^{k-1}_{i=1} \left( 1 - \frac{1}{n_i} \right) \]
Prove that: \[ \prod^k_{i=1} n_i \geq (4 \cdot a)^{2^k - 1}. \]
Find the largest value for $\frac{y}{x}$ for pairs of real numbers $(x,y)$ which satisfy \[(x-3)^2 + (y-3)^2 = 6.\]
$\textbf{(A) }3 + 2 \sqrt 2\qquad
\textbf{(B) } 2 + \sqrt 3\qquad
\textbf{(C ) }3 \sqrt 3\qquad
\textbf{(D) }6\qquad
\textbf{(E) }6 + 2 \sqrt 3$
The sum of nine consecutive odd numbers is $2007$. Find the greatest of these nine numbers.
We say that a digit is [i]high[/i] if it is placed between two other digits and it is bigger than both of them. The digits $0$,$1$,$2$,$\dots$,$9$ are used exactly once to form a 10-digit number. How many numbers can be formed with the property such that they don’t have any high digits?
Let $ S$ be the set of points $ (a,b)$ in the coordinate plane, where each of $ a$ and $ b$ may be $ \minus{} 1$, $ 0$, or $ 1$. How many distinct lines pass through at least two members of $ S$?
$ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 27\qquad \textbf{(E)}\ 36$
Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that
\[ m^2 + f(n) \mid mf(m) +n \]
for all positive integers $m$ and $n$.
The positive sequence $\{a_n\}$ satisfies:$a_1=1$ and $$a_n=2+\sqrt{a_{n-1}}-2 \sqrt{1+\sqrt{a_{n-1}}}(n\geq 2)$$
Let $S_n=\sum\limits_{k=1}^{n}{2^ka_k}$. Find the value of $S_{2023}$.
Point $O$ is the intersection point of the heights of an acute triangle $\vartriangle ABC$. Prove that the three circles which pass:
a) through $O, A, B$,
b) through $O, B, C$, and
c) through $O, C, A$, are equal
Prove that there exists a set of infinitely many positive integers such that the elements of no finite subset of this set add up to a perfect square.
Consider a semicircle of center $O$ and diameter $[AB]$, and let $C$ be an arbitrary point on the segment $(OB)$. The perpendicular to the line $AB$ through $C$ intersects the semicircle in $D$. A circle centered in $P$ is tangent to the arc $BD$ in $F$ and to the segments $[AB]$ and $[CD]$ in $G$ and $E$, respectively. Prove that the triangle $ADG$ is isosceles.
Let $c$ be a fixed real number. Show that a root of the equation
\[x(x+1)(x+2)\cdots(x+2009)=c\]
can have multiplicity at most $2$. Determine the number of values of $c$ for which the equation has a root of multiplicity $2$.
Find all primes $p$, such that there exist positive integers $x$, $y$ which satisfy
$$\begin{cases}
p + 49 = 2x^2\\
p^2 + 49 = 2y^2\\
\end{cases}$$
Let $ABCD$ be a square inscribed in circle $K$. Let $P$ be a point on the small arc $CD$ of circle $K$. The line $PB$ intersects $AC$ in $E$. The line $PA$ intersects $DB$ in $F$. The circle circumscribed to triangle $PEF$ intersects for second time $K$ in $Q$. Prove that $PQ$ is parallel to $CD$.
Let $n$ be a positive integer. There are $n$ ants walking along a line at constant nonzero speeds. Different ants need not walk at the same speed or walk in the same direction. Whenever two or more ants collide, all the ants involved in this collision instantly change directions. (Different ants need not be moving in opposite directions when they collide, since a faster ant may catch up with a slower one that is moving in the same direction.) The ants keep walking indefinitely.
Assuming that the total number of collisions is finite, determine the largest possible number of collisions in terms of $n$.
Given a natural number $n,$ find all polynomials $P(x)$ of degree less than $n$ satisfying the following condition \[ \sum^n_{i=0} P(i) \cdot (-1)^i \cdot \binom{n}{i} = 0. \]
Let $d(k)$ be the number of positive divisors of integer $k$. A number $n$ is called [i]balanced[/i] if $d(n-1) \leq d(n) \leq d(n+1)$ or $d(n-1) \geq d(n) \geq d(n+1)$.
Show that there are infinitely many balanced numbers.
Given a convex quadrilateral $ABCD$. The points $P$ and $Q$ are the midpoints of the diagonals $AC$ and $BD$ respectively. The line $PQ$ intersects the lines $AB$ and $CD$ at $N$ and $M$ respectively. Prove that the circumcircles of triangles $NAP$, $NBQ$, $MQD$, and $MPC$ have a common point.
A pyramid with a square base, and all its edges of length $2$, is joined to a regular tetrahedron, whose edges are also of length $2$, by gluing together two of the triangular faces. Find the sum of the lengths of the edges of the resulting solid.
Let $ABC$ be a triangle such that $AB<AC$. The perpendicular bisector of the side $BC$ meets the side $AC$ at the point $D$, and the (interior) bisectrix of the angle $ADB$ meets the circumcircle $ABC$ at the point $E$. Prove that the (interior) bisectrix of the angle $AEB$ and the line through the incentres of the triangles $ADE$ and $BDE$ are perpendicular.
Let $P_0 = (3,1)$ and define $P_{n+1} = (x_n, y_n)$ for $n \ge 0$ by $$x_{n+1} = - \frac{3x_n - y_n}{2}, y_{n+1} = - \frac{x_n + y_n}{2}$$Find the area of the quadrilateral formed by the points $P_{96}, P_{97}, P_{98}, P_{99}$.
The country of HMMTLand has $8$ cities. Its government decides to construct several two-way roads between pairs of distinct cities. After they finish construction, it turns out that each city can reach exactly $3$ other cities via a single road, and from any pair of distinct cities, either exactly $0$ or $2$ other cities can be reached from both cities by a single road. Compute the number of ways HMMTLand could have constructed the roads.