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

The right prism $[A_1A_2A_3\ldots A_nA_1'A_2'A_3'\ldots A_n'],n\in\mathbb{N},n\ge 3$, has a convex polygon as its base. It is known that $A_1A_2'\perp A_2A_3',A_2A_3'\perp A_3A_4',$$\ldots A_{n-1}A_n'\perp A_nA_1', A_nA_1'\perp A_1A_2'$. Show that: $a)$ $n=3$; $b)$ the prism is regular.
Find the smallest natural number $k$ such that the system of equations $$x+y+z=x^2+y^2+z^2=\dots=x^k+y^k+z^k $$ has only one solution for positive real numbers $x$, $y$ and $z$.
Given a circle $C$ and a point $P$ on its exterior, two tangents to the circle are drawn through $P$, with $A$ and $B$ being the points of tangency. We take a point $Q$ on the minor arc $AB$ of $C$. Let $M$ be the intersection of $AQ$ with the line perpendicular to $AQ$ that goes through $P$, and let $N$ be the intersection of $BQ$ with the line perpendicular to $BQ$ that goes through $P$. Show that, by varying $Q$ on the minor arc $AB$, all of the lines $MN$ pass through the same point.
$ABCDE$ is a convex pentagon such that $DC = DE$ and $\angle C = \angle E = 90^{\cdot}$. $F$ is a point on the side $AB$ such that $\frac{AF}{BF}= \frac{AE}{BC}$. Show that $\angle FCE = \angle ADE$ and $\angle FEC = \angle BDC$.
In the triangle $ABC $ the median $BD$ is drawn, which is divided into three equal parts by the points $E $ and $F$ ($BE = EF = FD$). It is known that $AD = AF$ and $AB = 1$. Find the length of the segment $CE$.
Define the sequence $a_1, a_2 \dots$ as follows: $a_1=1$ and for every $n\ge 2$, \[ a_n = \begin{cases} n-2 & \text{if } a_{n-1} =0 \\ a_{n-1} -1 & \text{if } a_{n-1} \neq 0 \end{cases} \] A non-negative integer $d$ is said to be {\em jet-lagged} if there are non-negative integers $r,s$ and a positive integer $n$ such that $d=r+s$ and that $a_{n+r} = a_n +s$. How many integers in $\{1,2,\dots, 2016\}$ are jet-lagged?
One hundred million cities lie on Planet MO. Initially, there are no air routes between any two cities. Now an airline company comes. It plans to establish $5050$ two-way routes, each route connects two different cities, and no two routes connect the same two cities. The "degree" of a city is defined to be the number of routes departing from that city. The "benefit" of a route is the product of the "degrees" of the two cities it connects. Find the maximum possible value of the sum of the benefits of these $5050$ routes.
Six regular octagons each with sides of length 2 are placed in a two-by-three array and inscribed in a square as shown. The area of the square can be written in the form $m+n\sqrt{2}$ where $m$ and $n$ are positive integers. Find $m+n$. [asy] size(175); pair A=dir(-45/2); real h=A.x; path P=A; for(int k=1;k<8;++k) P=P--rotate(45*k)*A; P=P--cycle; for(real x=-2*h;x<3*h;x+=2*h) for(real y:new real[]{-h,h} ) draw (shift((x,y))*P); pair C=dir(45/2)+(2*h,h), X=(C.x+C.y,0), Y=(0,C.x+C.y); draw(X--Y--(-X)--(-Y)--cycle);[/asy]
A frog is placed on each cell of a $n \times n$ square inside an infinite chessboard (so initially there are a total of $n \times n$ frogs). Each move consists of a frog $A$ jumping over a frog $B$ adjacent to it with $A$ landing in the next cell and $B$ disappearing (adjacent means two cells sharing a side). Prove that at least $ \left[\frac{n^2}{3}\right]$ moves are needed to reach a configuration where no more moves are possible.
Show that there is a digit unequal to 2 in the decimal represesentation of $ \sqrt [3]{3}$ between the $ 1000000$-th und $ 3141592$-th position after decimal point.
Find all positive integers $n$ such that a positive integer power of $2n^2+4n-1$ equals to a positive integer power of $3n+4$.
Determine all ten-digit numbers whose decimal $\overline{a_0a_1a_2a_3a_4a_5a_6a_7a_8a_9}$ is given by such that for each integer $j$ with $0\le j \le 9, a_j$ is equal to the number of digits equal to $j$ in this representation. That is: the first digit is equal to the amount of "$0$" in the writing of that number, the second digit is equal to the amount of "$1$" in the writing of that number, the third digit is equal to the amount of "$2$" in the writing of that number, ... , the tenth digit is equal to the number of "$9$" in the writing of that number.
Find the set of solutions for $x$ in the inequality $\dfrac{x+1}{x+2}>\dfrac{3x+4}{2x+9}$ when $x\neq 2$, $x\neq -\dfrac{9}{2}$.
Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.
Let $n \in \mathbb{N}$ be such that $gcd(n, 6) = 1$. Let $a_1 < a_2 < \cdots < a_n$ and $b_1 < b_2 < \cdots < b_n$ be two collection of positive integers such that $a_j + a_k + a_l = b_j + b_k + b_l$ for all integers $1 \le j < k < l \le n$. Prove that $a_j = b_j$ for all $1 \le j \le n$.
Let $n(r)$ be the maximum possible number of points with integer coordinates on a circle with radius $r$ in Cartesian plane. Prove that $n(r) < 6\sqrt[3]{3 \pi r^2}.$
$N$ men are not acquainted each other. You need to introduce some of them to some of them in such a way, that no three men will have equal number of acquaintances. Prove that it is possible for all $N$.
Given positive integer $n$, find the biggest real number $C$ which satisfy the condition that if the sum of the reciprocals of a set of integers (They can be the same.) that are greater than $1$ is less than $C$, then we can divide the set of numbers into no more than $n$ groups so that the sum of reciprocals of every group is less than $1$.
In the triangle $ABC$ the edge $BC$ has length $a$, the edge $AC$ length $b$, and the edge $AB$ length $c$. Extend all the edges at both ends – by the length $a$ from the vertex $A, b$ from $B$, and $c$ from $C$. Show that the six endpoints of the extended edges all lie on a common circle. [img]https://cdn.artofproblemsolving.com/attachments/8/7/14c8c6a4090d4fade28893729a510d263e7abb.png[/img]
Find all pairs of positive integers $(x, y)$ such that $\frac{xy^3}{x+y}$ is the cube of a prime.
Let $N$ be the number of convex $27$-gons up to rotation there are such that each side has length $ 1$ and each angle is a multiple of $2\pi/81$. Find the remainder when $N$ is divided by $23$.
Let $ a$, $ b$, $ c$ be real numbers for which the polynomial $ x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has three real roots. Prove that \[ 12ab \plus{} 27c \le 6a^3 \plus{} 10\left(a^2 \minus{} 2b\right)^{\frac {3}{2}}\] When does equality occur?
In triangle $ABC$, sides $CB$ and $CA$ are equal to $a$ and $b$, respectively. The bisector of the angle $ACB$ intersects the side $AB$ at the point $K$ and the circumscribed circle of the triangle at point $M$. The circumscribed circle of the triangle $AMK$ intersects for second time the straight line $CA$ at the point $P$. Find the length of the segment $AP$.
Find values of $n\in \mathbb{N}$ for which the fraction $\frac{3^n-2}{2^n-3}$ is reducible.
For which $k$ does the system $x^2 - y^2 = 0, (x-k)^2 + y^2 = 1$ have exactly: (i) two, (ii) three real solutions?