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

$3.$ Positive integers $a$ and $b$ are such that $a+b=\frac{a}{b}+\frac{b}{a}.$ What is the value of $a^2+b^2 ?$
Consider a cyclic quadrilateral $ABCD$ and define points $X = AB \cap CD$, $Y = AD \cap BC$, and suppose that there exists a circle with center $Z$ inscribed in $ABCD$. Show that the $Z$ belongs to the circle with diameter $XY$ , which is orthogonal to circumcircle of $ABCD$.
Find all $a\in\mathbb{N}$ such that exists a bijective function $g :\mathbb{N} \to \mathbb{N}$ and a function $f:\mathbb{N}\to\mathbb{N}$, such that for all $x\in\mathbb{N}$, $$f(f(f(...f(x)))...)=g(x)+a$$ where $f$ appears $2009$ times. [i](tatari/nightmare)[/i]
Let $S\subset \mathbb{R}$ be a closed set and $f:\mathbb{R}^{2n}\to \mathbb{R}$ be a continuous function. Define a graph $G$ as follows: Let $x$ be a vertex of $G$ iff $x\in \mathbb{R}^{n}$ and $f(x,x)\not\in S$, then connect the vertices $x$ and $y$ by an edge in $G$ iff $f(x,y)\in S$ or $f(y,x)\in S$. Show that the chromatic number of $G$ is countable.
Determine whether there are infinitely many triples $(u,v,w)$ of positive integers such that $u,v,w$ form an arithmetic progression and the numbers $uv+1, vw+1$ and $wu+1$ are all perfect squares.
Let $ABC$ be a right triangle with $\angle A=90^\circ.$ The bisectors of the angles $B$ and $C$ meet each other in $I$ and meet the sides $AC$ and $AB$ in $D$ and $E$, respectively. Prove that $S_{BCDE}=2S_{BIC},$ where $S$ is the area function. [asy] import graph; size(200); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen ttqqcc = rgb(0.2,0,0.8); pen qqwuqq = rgb(0,0.39,0); pen xdxdff = rgb(0.49,0.49,1); pen fftttt = rgb(1,0.2,0.2); pen ccccff = rgb(0.8,0.8,1); draw((1.89,4.08)--(1.89,4.55)--(1.42,4.55)--(1.42,4.08)--cycle,qqwuqq); draw((1.42,4.08)--(7.42,4.1),ttqqcc+linewidth(1.6pt)); draw((1.4,10.08)--(1.42,4.08),ttqqcc+linewidth(1.6pt)); draw((1.4,10.08)--(7.42,4.1),ttqqcc+linewidth(1.6pt)); draw((1.4,10.08)--(4,4.09),fftttt+linewidth(1.2pt)); draw((7.42,4.1)--(1.41,6.24),fftttt+linewidth(1.2pt)); draw((1.41,6.24)--(4,4.09),ccccff+linetype("5pt 5pt")); dot((1.42,4.08),ds); label("$A$", (1.1,3.66),NE*lsf); dot((7.42,4.1),ds); label("$B$", (7.15,3.75),NE*lsf); dot((1.4,10.08),ds); label("$C$", (1.49,10.22),NE*lsf); dot((4,4.09),ds); label("$E$", (3.96,3.46),NE*lsf); dot((1.41,6.24),ds); label("$D$", (0.9,6.17),NE*lsf); dot((3.37,5.54),ds); label("$I$", (3.45,5.69),NE*lsf); clip((-6.47,-7.49)--(-6.47,11.47)--(16.06,11.47)--(16.06,-7.49)--cycle); [/asy]
Let $D=\{ z \in \mathbb{C} : \operatorname{Im}(z) >0 , \operatorname{Re}(z) >0 \} $. Let $n \geq 1 $ and let $a_1,a_2,\dots a_n \in D$ be distinct complex numbers. Define $$f(z)=z \cdot \prod_{j=1}^{n} \frac{z-a_j}{z-\overline{a_j}}$$ Prove that $f'$ has at least one root in $D$. [i]Proposed by Géza Kós (Lorand Eotvos University, Budapest)[/i]
Proove that if for a positive integer $n$ , both $3n + 1$ and $10n + 1$ are perfect squares , then $29n + 11$ is not a prime number.
The points $P$ and $Q$ lie inside the circle $\omega$. The perpendicular bisector to the segment $PQ$ intersects $\omega$ at points $A$ and $D$. A circle centered on $D$ passing through $P$ and $Q$ intersects $\omega$ at points $B$ and $C$. The segment $PQ$ lies inside the triangle $ABC$. Prove that $\angle ACP = \angle BCQ$. [i]Proposed by A. Zaslavsky [/i]
The positive reals $x_1, x_2, ... , x_n$ have harmonic mean $1$. Find the smallest possible value of $x_1 + \frac{x_2 ^2}{2} + \frac{x_3 ^3}{3} + ... + \frac{x_n ^n}{n}$.
We'll call a positive integer "almost prime", if it is not divisible by any prime from the interval $[3,19]$. We'll call a number "very non-prime", if it has at least 2 primes from interval $[3,19]$ dividing it. What is the greatest amount of almost prime numbers can be selected, such that the sum of any two of them is a very non-prime number? [I]Proposed by S. Berlov, S. Ivanov[/i]
Let $ABC$ be an arbitrary triangle. A regular $n$-gon is constructed outward on the three sides of $\triangle ABC$. Find all $n$ such that the triangle formed by the three centres of the $n$-gons is equilateral.
Let $\alpha\in(\frac{\pi}{4},\frac{\pi}{2})$, then the order of $(\cos\alpha)^{\cos\alpha},(\sin\alpha)^{\cos\alpha},(\cos\alpha)^{\sin\alpha}$ is $\text{(A)}(\cos\alpha)^{\cos\alpha}<(\sin\alpha)^{\cos\alpha}<(\cos\alpha)^{\sin\alpha}$ $\text{(B)}(\cos\alpha)^{\cos\alpha}<(\cos\alpha)^{\sin\alpha}<(\sin\alpha)^{\cos\alpha}$ $\text{(C)}(\sin\alpha)^{\cos\alpha}<(\cos\alpha)^{\cos\alpha}<(\cos\alpha)^{\sin\alpha}$ $\text{(D)}(\cos\alpha)^{\sin\alpha}<(\cos\alpha)^{\cos\alpha}<(\sin\alpha)^{\cos\alpha}$
I have a $2$ by $4$ grid of squares; how many ways can I shade at least one of the squares such that no two shaded squares share an edge?
Determine all pairs $(p,q)$ of primes for which both $p^2+q^3$ and $q^2+p^3$ are perfect squares.
Let a real-valued sequence $\{x_n\}_{n\geqslant 1}$ be such that $$\lim_{n\to\infty}nx_n=0$$ Find all possible real values of $t$ such that $\lim_{n\to\infty}x_n\big(\log n\big)^t=0$ .
A deck of $8056$ cards has $2014$ ranks numbered $1$–$2014$. Each rank has four suits - hearts, diamonds, clubs, and spades. Each card has a rank and a suit, and no two cards have the same rank and the same suit. How many subsets of the set of cards in this deck have cards from an odd number of distinct ranks?
Find all pair of integer numbers $(n,k)$ such that $n$ is not negative and $k$ is greater than $1$, and satisfying that the number: \[ A=17^{2006n}+4.17^{2n}+7.19^{5n} \] can be represented as the product of $k$ consecutive positive integers.
[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Petya drew a pentagon $ABCDE$ on the plane. After that, Vasya marked all the points $S$ in a given half-space relative to the plane of the pentagon so that in the pyramid $SABCD$ exactly two side faces are perpendicular to the plane of the base $ABCD$, and the height is $1$. How many points could have Vasya?
There are $\displaystyle{2n}$ students in a school $\displaystyle{\left( {n \in {\Bbb N},n \geqslant 2} \right)}$. Each week $\displaystyle{n}$ students go on a trip. After several trips the following condition was fulfiled: every two students were together on at least one trip. What is the minimum number of trips needed for this to happen? [i]Proposed by Oleksandr Rybak, Kiev, Ukraine.[/i]
Let $\{a_n\}$ be the sequance with $a_0=0$, $a_n=\frac{1}{a_{n-1}-2}$ ($n\in N_+$). Select an arbitrary term $a_k$ in the sequence $\{a_n\}$ and construct the sequence $\{b_n\}$: $b_0=a_k$, $b_n=\frac{2b_{n-1}+1} {b_{n-1}}$ ($n\in N_+$) . Determine whether the sequence $\{b_n\}$ is a finite sequence or an infinite sequence and give proof.
$16.$ In an acute angle triangle $ABC,$ let $D$ be the foot of the altitude from $A,$ and $E$ be the midpoint of $BC.$ Let $F$ be the midpoint of $AC.$ Suppose $\angle{BAE}=40^o. $ If $\angle{DAE}=\angle{DFE},$ What is the magnitude of $\angle{ADF}$ in degrees $?$
Let $ABCD$ be a unit square in the plane. Points $X$ and $Y$ are chosen independently and uniformly at random on the perimeter of $ABCD$. If the expected value of the area of triangle $\triangle AXY$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m+n$. [i]Proposed by Nathan Xiong[/i]
Let $ABCD$ be a cyclic quadrilateral whose sides have pairwise different lengths. Let $O$ be the circumcenter of $ABCD$. The internal angle bisectors of $\angle ABC$ and $\angle ADC$ meet $AC$ at $B_1$ and $D_1$, respectively. Let $O_B$ be the center of the circle which passes through $B$ and is tangent to $\overline{AC}$ at $D_1$. Similarly, let $O_D$ be the center of the circle which passes through $D$ and is tangent to $\overline{AC}$ at $B_1$. Assume that $\overline{BD_1} \parallel \overline{DB_1}$. Prove that $O$ lies on the line $\overline{O_BO_D}$.