Found problems: 85335
In acute triangle $ABC$, let $D,E,F$ denote the feet of the altitudes from $A,B,C$, respectively, and let $\omega$ be the circumcircle of $\triangle AEF$. Let $\omega_1$ and $\omega_2$ be the circles through $D$ tangent to $\omega$ at $E$ and $F$, respectively. Show that $\omega_1$ and $\omega_2$ meet at a point $P$ on $BC$ other than $D$.
[i]Ray Li.[/i]
Find all functions $ f : \mathbb{R} \rightarrow \mathbb{R} $ such that for all reals $ x, y $,$$ f(x^2+f(x+y))=y+xf(x+1) $$
Let $n,k$ be positive integers such that n is not divisible by 3 and $k \geq n$. Prove that there exists a positive integer $m$ which is divisible by $n$ and the sum of its digits in decimal representation is $k$.
Let $f$ be a function which takes in $0, 1, 2$ and returns $0, 1, $ or $2$. The values need not be distinct: for instance we could have $f(0) = 1, f(1) = 1, f(2) = 2$. How many such functions are there which satisfy \[f(2) + f(f(0)) + f(f(f(1))) = 5?\]
How many terms are there in the arithmetic sequence $13, 16, 19, \dots, 70,73$?
$ \textbf{(A) }20\qquad\textbf{(B) }21\qquad\textbf{(C) }24\qquad\textbf{(D) }60\qquad\textbf{(E) }61 $
Points $E$ and $C$ are chosen on a semicircle with diameter $AB$ and center $O$ such that $OE \perp AB$ and the intersection point $D$ of $AC$ and $OE$ is inside the semicircle. Find all values of $\angle{CAB}$ for which the quadrilateral $OBCD$ is tangent.
Finds the sum of the infinite series $1+2\left(\dfrac{1}{1998}\right)+3\left(\dfrac{1}{1998}\right)^2+4\left(\dfrac{1}{1998}\right)^3+\cdots$.
[u]Round 1[/u]
[b]p1. [/b]The Queen of Bees invented a new language for her hive. The alphabet has only $6$ letters: A, C, E, N, R, T; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the word TRANCE immediately follows NECTAR. What is the last word in the dictionary?
[b]p2.[/b] Is it possible to solve the equation $\frac{1}{x}= \frac{1}{y} +\frac{1}{z}$ with $x,y,z$ integers (positive or negative) such that one of the numbers $x,y,z$ has one digit, another has two digits, and the remaining one has three digits?
[b]p3.[/b] The $10,000$ dots in a $100\times 100$ square grid are all colored blue. Rekha can paint some of them red, but there must always be a blue dot on the line segment between any two red dots. What is the largest number of dots she can color red? The picture shows a possible coloring for a $5\times 7$ grid.
[img]https://cdn.artofproblemsolving.com/attachments/0/6/795f5ab879938ed2a4c8844092b873fb8589f8.jpg[/img]
[b]p4.[/b] Six flies rest on a table. You have a swatter with a checkerboard pattern, much larger than the table. Show that there is always a way to position and orient the swatter to kill at least five of the flies. Each fly is much smaller than a swatter square and is killed if any portion of a black square hits any part of the fly.
[b]p5.[/b] Maryam writes all the numbers $1-81$ in the cells of a $9\times 9$ table. Tian calculates the product of the numbers in each of the nine rows, and Olga calculates the product of the numbers in every column. Could Tian's and Olga's lists of nine products be identical?
[u]Round 2[/u]
[b]p6.[/b] A set of points in the plane is epic if, for every way of coloring the points red or blue, it is possible to draw two lines such that each blue point is on a line, but none of the red points are. The figure shows a particular set of $4$ points and demonstrates that it is epic. What is the maximum possible size of an epic set?
[img]https://cdn.artofproblemsolving.com/attachments/e/f/44fd1679c520bdc55c78603190409222d0b721.jpg[/img]
[b]p7.[/b] Froggy Chess is a game played on a pond with lily pads. First Judit places a frog on a pad of her choice, then Magnus places a frog on a different pad of his choice. After that, they alternate turns, with Judit moving first. Each player, on his or her turn, selects either of the two frogs and another lily pad where that frog must jump. The jump must reduce the distance between the frogs (all distances between the lily pads are different), but both frogs cannot end up on the same lily pad. Whoever cannot make a move loses. The picture below shows the jumps permitted in a particular situation.
Who wins the game if there are $2017$ lily pads?
[img]https://cdn.artofproblemsolving.com/attachments/a/9/1a26e046a2a614a663f9d317363aac61654684.jpg[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
For natural $n$, define $f_n=[2^n\sqrt{69}]+[2^n\sqrt{96}]$ Prove that there are infinite even integers and infinite odd integers that appear in number $f_1,f_2,\dots$.
[i](tatari/nightmare)[/i]
Point D is from AC of triangle ABC so that 2AD=DC. Let DE be perpendicular to BC and AE
intersects BD at F. It is known that triangle BEF is equilateral. Find <ADB?
Let $p,q$ be two-digit number neither of which are divisible by $10$. Let $r$ be the four-digit number by putting the digits of $p$ followed by the digits of $q$ (in order). As $p,q$ very, a computer prints $r$ on the screen if $\gcd(p,q) = 1$ and $p+q$ divides $r$. Suppose that the largest number that is printed by the computer is $N$. Determine the number formed by the last two digits of $N$ (in the same order).
Michel starts with the string HMMT. An operation consists of either replacing an occurrence of H with HM, replacing an occurrence of MM with MOM, or replacing an occurrence of T with MT. For example, the two strings that can be reached after one operation are HMMMT and HMOMT. Compute the number of distinct strings Michel can obtain after exactly $10$ operations.
Show that there do not exist five consecutive integers whose sum of squares is itself a perfect square.
Let $ABC$ be an acute triangle with $\displaystyle{AB<AC<BC}$ inscribed in circle $ \displaystyle{c(O,R)}$.The excircle $\displaystyle{(c_A)}$ has center $\displaystyle{I}$ and touches the sides $\displaystyle{BC,AC,AB}$ of the triangle $ABC$ at $\displaystyle{D,E,Z} $ respectively.$ \displaystyle{AI}$ cuts $\displaystyle{(c)}$ at point $M$ and the circumcircle $\displaystyle{(c_1)}$ of triangle $\displaystyle{AZE}$ cuts $\displaystyle{(c)}$ at $K$.The circumcircle $\displaystyle{(c_2)}$ of the triangle $\displaystyle{OKM}$ cuts $\displaystyle{(c_1)} $ at point $N$.Prove that the point of intersection of the lines $AN,KI$ lies on $ \displaystyle{(c)}$.
Let $A$, $B$, $C$, and $P$ be points in the plane such that no three of them are collinear. Suppose that the areas of triangles $BPC$, $CPA$, and $APB$ are 13, 14, and 15, respectively. Compute the sum of all possible values for the area of triangle $ABC$.
[i]Proposed by Ankan Bhattacharya[/i]
We say that a natural number is called special if all of its digits are non-zero and any two adjacent digits in its decimal representation are consecutive (not necessarily in ascending order).
a) Determine the largest special number $m$ whose sum of digits is equal to $2023$.
b) Determine the smallest special number $n$ whose sum of digits is equal to $2022$.
Triangle $ABC$ is given. On its sides $AB$, $BC$ and $CA$, respectively, points $X, Y, Z$ are chosen so that $$AX : XB =BY : YC = CZ : ZA = 2:1.$$ It turned out that the triangle $XYZ$ is equilateral. Prove that the original triangle $ABC$ is also equilateral.
Consider an integrable function $f:\mathbb{R} \rightarrow \mathbb{R}$ such that $af(a)+bf(b)=0$ when $ab=1$. Find the value of the following integration:
$$ \int_{0}^{\infty} f(x) \,dx $$
On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue.
At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet.
After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls.
Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?
Let $P$ be the point in the interior of $\vartriangle ABC$. Let $D$ be the intersection of the lines $AP$ and $BC$ and let $A'$ be the point such that $\overrightarrow{AD} = \overrightarrow{DA'}$. The points $B'$ and $C'$ are defined in the similar way. Determine all points $P$ for which the triangles $A'BC, AB'C$, and $ABC'$ are congruent to $\vartriangle ABC$.
Let $\mathbb R$ be the set of real numbers. Determine all functions $f:\mathbb R\to\mathbb R$ that satisfy the equation
$$\sum_{i=1}^{2015} f(x_i + x_{i+1}) + f\left( \sum_{i=1}^{2016} x_i \right) \le \sum_{i=1}^{2016} f(2x_i)$$
for all real numbers $x_1, x_2, ... , x_{2016}.$
Let $a$ be a positive integer such that $\gcd(an+1, 2n+1) = 1$ for all integer $n$.
a) Prove that $\gcd(a-2, 2n+1) = 1$ for all integer $n$.
b) Find all possible $a$.
In a row there are $51$ written positive integers. Their sum is $100$ . An integer is [i]representable [/i] if it can be expressed as the sum of several consecutive numbers in a row of $51$ integers. Show that for every $k$ , with $1\le k \le 100$ , one of the numbers $k$ and $100-k$ is representable.
Consider the sequence of numbers defined recursively by $t_1=1$ and for $n>1$ by $t_n=1+t_{(n/2)}$ when $n$ is even and by $t_n=\frac{1}{t_{(n-1)}}$ when $n$ is odd. Given that $t_n=\frac{19}{87}$, the sum of the digits of $n$ is
$ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 17 \qquad\textbf{(C)}\ 19 \qquad\textbf{(D)}\ 21 \qquad\textbf{(E)}\ 23$
Let $a, b, c, d \in [0, 1]$. Prove that
$$\frac{a}{1 + b}+\frac{b}{1 + c}+\frac{c}{1 + d}+\frac{d}{1 + a}+ abcd \le 3.$$