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

Pentagon $ABCDE$ with $CD\parallel BE$ is inscribed in circle $\omega$. Tangent to $\omega$ through $B$ intersects line $AC$ at $F$ in a way that $A$ lies between $C$ and $F$. Lines $BD$ and $AE$ intersect at $G$. Prove that $FG$ is tangent to the circumcircle of $\triangle ADG$.
Bessie and her $2015$ bovine buddies work at the Organic Milk Organization, for a total of $2016$ workers. They have a hierarchy of bosses, where obviously no cow is its own boss. In other words, for some pairs of employees $(A, B)$, $B$ is the boss of $A$. This relationship satisfies an obvious condition: if $B$ is the boss of $A$ and $C$ is the boss of $B$, then $C$ is also a boss of $A$. Business has been slow, so Bessie hires an outside organizational company to partition the company into some number of groups. To promote growth, every group is one of two forms. Either no one in the group is the boss of another in the group, or for every pair of cows in the group, one is the boss of the other. Let $G$ be the minimum number of groups needed in such a partition. Find the maximum value of $G$ over all possible company structures. [i]Proposed by Yang Liu[/i]
A positive six-digit integer begins and ends in $8$, and is also the product of three consecutive even numbers. What is the sum of the three even numbers?
Let $ a,b,c\in \mathbb R$ such that $ a\ge b\ge c > 1$. Prove the inequality: $ \log_c\log_c b \plus{} \log_b\log_b a \plus{} \log_a\log_a c\geq 0$
Given a triangle with acute angle $ \angle BEC,$ let $ E$ be the midpoint of $ AB.$ Point $ M$ is chosen on the opposite ray of $ EC$ such that $ \angle BME \equal{} \angle ECA.$ Denote by $ \theta$ the measure of angle $ \angle BEC.$ Evaluate $ \frac{MC}{AB}$ in terms of $ \theta.$
In the acute triangle $ ABC $, $ L $, $ H $ and $ M $ are the intersection points of bisectors, altitudes and medians, respectively, and $ O $ is the center of the circumscribed circle. Denote by $ X $, $ Y $ and $ Z $ the intersection points of $ AL $, $ BL $ and $ CL $ with a circle, respectively. Let $ N $ be a point on the line $ OL $ such that the lines $ MN $ and $ HL $ are parallel. Prove that $ N $ is the intersection point of the medians of $ XYZ $.
In triangle $ABC$, $D$, $E$ and $F$ are the points of tangency of incircle with the center of $I$ to $BC$, $CA$ and $AB$ respectively. Let $M$ be the foot of the perpendicular from $D$ to $EF$. $P$ is on $DM$ such that $DP = MP$. If $H$ is the orthocenter of $BIC$, prove that $PH$ bisects $ EF$.
Find all $4$-tuple of real numbers $(x, y, z, w)$ that satisfy the following system of equations: $$x^2 + y^2 + z^2 + w^2 = 4$$ $$\frac{1}{x^2} +\frac{1}{y^2} +\frac{1}{z^2 }+\frac{1}{w^2} = 5 -\frac{1}{(xyzw)^2}$$
Let $n, k$ be natural numbers, $1 \leq k < n$. In each vertex of a regular polygon with $n$ sides is written $1$ or $-1$. At each step we choose $k$ consecutive vertices and change their signs. Is it possible that, starting from a certain configuration and by doing the operation a few times to obtain any other configuration?
Prove that $S_1 = (n + 1)^2 + (n + 2)^2 +...+ (n + 5)^2$ is divisible by $5$ for every $n$. Prove that for no $n$: $\sum_{\ell=1}^5 (n+\ell)^2$ is a perfect square. Let $S_2=(n + 6)^2 + (n + 7)^2 + ... + (n + 10)^2$. Prove that $S_1 \cdot S_2$ is divisible by $150$.
A number $N$ is in base 10, $503$ in base $b$ and $305$ in base $b+2$ find product of digits of $N$
Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. A line $\ell$ intersects the lines $AI$, $BI$, and $CI$ at points $D$, $E$, and $F$, respectively, distinct from the points $A$, $B$, $C$, and $I$. The perpendicular bisectors $x$, $y$, and $z$ of the segments $AD$, $BE$, and $CF$, respectively determine a triangle $\Theta$. Show that the circumcircle of the triangle $\Theta$ is tangent to $\Omega$.
Ben writes the string $$\underbrace{111\ldots 11}_{2020 \text{ digits}}$$on a blank piece of paper. Next, in between every two consecutive digits, he inserts either a plus sign $(+)$ or a multiplication sign $(\times)$. He then computes the expression using standard order of operations. Find the number of possible distinct values that Ben could have as a result. [i]Proposed by Taiki Aiba[/i]
Given a set $A$ which contains $n$ elements. For any two distinct subsets $A_{1}$, $A_{2}$ of the given set $A$, we fix the number of elements of $A_1 \cap A_2$. Find the sum of all the numbers obtained in the described way.
Let $ n \ge 2009$ be an integer and define the set: \[ S \equal{} \{2^x|7 \le x \le n, x \in \mathbb{N}\}. \] Let $ A$ be a subset of $ S$ and the sum of last three digits of each element of $ A$ is $ 8$. Let $ n(X)$ be the number of elements of $ X$. Prove that \[ \frac {28}{2009} < \frac {n(A)}{n(S)} < \frac {82}{2009}. \]
Some positive integers are initially written on a board, where each $2$ of them are different. Each time we can do the following moves: (1) If there are 2 numbers (written in the board) in the form $n, n+1$ we can erase them and write down $n-2$ (2) If there are 2 numbers (written in the board) in the form $n, n+4$ we can erase them and write down $n-1$ After some moves, there might appear negative numbers. Find the maximum value of the integer $c$ such that: Independetly of the starting numbers, each number which appears in any move is greater or equal to $c$
Two circles $ G_1$ and $ G_2$ intersect at two points $ M$ and $ N$. Let $ AB$ be the line tangent to these circles at $ A$ and $ B$, respectively, so that $ M$ lies closer to $ AB$ than $ N$. Let $ CD$ be the line parallel to $ AB$ and passing through the point $ M$, with $ C$ on $ G_1$ and $ D$ on $ G_2$. Lines $ AC$ and $ BD$ meet at $ E$; lines $ AN$ and $ CD$ meet at $ P$; lines $ BN$ and $ CD$ meet at $ Q$. Show that $ EP \equal{} EQ$.
A function $f:\mathbb{R} \to \mathbb{R}$ has the following property: $$\text{For every } x,y \in \mathbb{R} \text{ such that }(f(x)+y)(f(y)+x) > 0, \text{ we have } f(x)+y = f(y)+x.$$ Prove that $f(x)+y \leq f(y)+x$ whenever $x>y$.
Given an acute triangle $ABC$ with altitudes $AD$ and $BE$ intersecting at $H$, $M$ is the midpoint of $AB$. A nine-point circle of $ABC$ intersects with a circumcircle of $ABH$ on $P$ and $Q$ where $P$ lays on the same side of $A$ (with respect to $CH$). Prove that $ED, PH, MQ$ are concurrent on circumcircle $ABC$
Mr. Ganzgenau would like to take his tea mug out of the microwave right at the front. But Mr. Ganzgenau's microwave doesn't really want to be very precise play along. To be precise, the two of them play the following game: Let $n$ be a positive integer. The turntable of the microwave makes one in $n$ seconds full turn. Each time the microwave is switched on, an integer number of seconds turned either clockwise or counterclockwise so that there are n possible positions in which the tea mug can remain. One of these positions is right up front. At the beginning, the microwave turns the tea mug to one of the $n$ possible positions. After that Mr. Ganzgenau enters an integer number of seconds in each move, and the microwave decides either clockwise or counterclockwise this number of spin for seconds. For which $n$ can Mr. Ganzgenau force the tea cup after a finite number of puffs to be able to take it out of the microwave right up front? (Birgit Vera Schmidt) [hide=original wording, in case it doesn't make much sense]Herr Ganzgenau möchte sein Teehäferl ganz genau vorne aus der Mikrowelle herausnehmen. Die Mikrowelle von Herrn Ganzgenau möchte da aber so ganz genau gar nicht mitspielen. Ganz genau gesagt spielen die beiden das folgende Spiel: Sei n eine positive ganze Zahl. In n Sekunden macht der Drehteller der Mikrowelle eine vollständige Umdrehung. Bei jedem Einschalten der Mikrowelle wird eine ganzzahlige Anzahl von Sekunden entweder im oder gegen den Uhrzeigersinn gedreht, sodass es n mögliche Positionen gibt, auf denen das Teehäferl stehen bleiben kann. Eine dieser Positionen ist ganz genau vorne. Zu Beginn dreht die Mikrowelle das Teehäferl auf eine der n möglichen Positionen. Danach gibt Herr Ganzgenau in jedem Zug eine ganzzahlige Anzahl von Sekunden ein, und die Mikrowelle entscheidet, entweder im oder gegen den Uhrzeigersinn diese Anzahl von Sekunden lang zu drehen. Für welche n kann Herr Ganzgenau erzwingen, das Teehäferl nach endlich vielen Zügen ganz genau vorne aus der Mikrowelle nehmen zu können? (Birgit Vera Schmidt) [/hide]
In a country between each pair of cities there is at most one direct road. There is a connection (using one or more roads) between any two cities even after the elimination of any given city and all roads incident to this city. We say that the city $A$ can be[i] k -directionally[/i] connected to the city $B$, if : we can orient at most $k$ roads such that after[i] arbitrary[/i] orientation of remaining roads for any fixed road $l$ (directly connecting two cities) there is a path passing through roads in the direction of their orientation starting at $A$, passing through $l$ and ending at $B$ and visiting each city at most once. Suppose that in a country with $n$ cities, any two cities can be[i] k - directionally[/i] connected. What is the minimal value of $k$?
Function $f:\mathbb{R}\to\mathbb{R}$, satisfies that $f(0)=1$, and $f(xy+1)=f(x)f(y)-f(y)-x+2$, then $f(x)=$________.
Let $k$ be a positive integer. Prove that there exists an infinite monotone increasing sequence of integers $\{a_{n}\}_{n \ge 1}$ such that \[a_{n}\; \text{divides}\; a_{n+1}^{2}+k \;\; \text{and}\;\; a_{n+1}\; \text{divides}\; a_{n}^{2}+k\] for all $n \in \mathbb{N}$.
Chandler the Octopus is at a tentacle party! At this party, there is $1$ creature with $2$ tentacles, $2$ creatures with $3$ tentacles, $3$ creatures with $4$ tentacles, all the way up to $14$ creatures with $15$ tentacles. Each tentacle is distinguishable from all other tentacles. For some $2\le m < n \le 15$, a creature with m tentacles “meets” a creature with n tentacles; “meeting” another creature consists of shaking exactly 1 tentacle with each other. Find the number of ways there are to pick distinct $m < n$ between $2$ and $15$, inclusive, and then to pick a creature with $m$ tentacles to “meet” a selected creature with $n$ tentacles. [i]Proposed by Armaan Tipirneni, Richard Chen, and Denise the Octopus[/i]
In a triangle $ABC$, points $D$ and $E$ are taken on rays $CB$ and $CA$ respectively so that $CD=CE = \frac{AC+BC}{2}$. Let $H$ be the orthocenter of the triangle, and $P$ be the midpoint of the arc $AB$ of the circumcircle of $ABC$ not containing $C$. Prove that the line $DE$ bisects the segment $HP$.