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

For how many positive integers $ m$ does there exist at least one positive integer $ n$ such that $ m\cdot n \le m \plus{} n$? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}$ infinitely many
Prove that for all the positive numbers $a,b,c$ the following inequality is valid: $$a^3+b^3+c^3+3abc>ab(a+b)+bc(b+c)+ac(a+c)$$
The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.
Let $R$ and $r$ be the radii of the circles circumscribed and inscribed, respectively, in a triangle. Prove that $R \ge 2r$, and that $R = 2r$ only for an equilateral triangle.
$(HUN 6)$ Find the positions of three points $A,B,C$ on the boundary of a unit cube such that $min\{AB,AC,BC\}$ is the greatest possible.
Determine the (real) domain of a function $$y=\sqrt{1-\frac{x}{4}|x|+\sqrt{1-\frac{x}{2}|x|\,}\,}-\sqrt{1-\frac{x}{4}|x|-\sqrt{1-\frac{x}{2}|x|\,}\,}$$ and draw its graph.
The figure consists of alternating light and dark squares. The number of dark squares exceeds the number of light squares by $ \text{(A)}\ 7\qquad\text{(B)}\ 8\qquad\text{(C)}\ 9\qquad\text{(D)}\ 10\qquad\text{(E)}\ 11 $ [asy] unitsize(12); for(int a=0; a<7; ++a) { fill((2a,0)--(2a+1,0)--(2a+1,1)--(2a,1)--cycle,black); draw((2a+1,0)--(2a+2,0)); } for(int b=7; b<15; ++b) { fill((b,14-b)--(b+1,14-b)--(b+1,15-b)--(b,15-b)--cycle,black); } for(int c=1; c<7; ++c) { fill((c,c)--(c+1,c)--(c+1,c+1)--(c,c+1)--cycle,black); } for(int d=1; d<6; ++d) { draw((2d+1,1)--(2d+2,1)); } fill((6,4)--(7,4)--(7,5)--(6,5)--cycle,black); draw((5,4)--(6,4)); fill((7,5)--(8,5)--(8,6)--(7,6)--cycle,black); draw((7,4)--(8,4)); fill((8,4)--(9,4)--(9,5)--(8,5)--cycle,black); draw((9,4)--(10,4)); label("same",(6.3,2.45),N); label("pattern here",(7.5,1.4),N);[/asy]
We call a sequence of $n$ digits one or zero a code. Subsequence of a code is a palindrome if it is the same after we reverse the order of its digits. A palindrome is called nice if its digits occur consecutively in the code. (Code $(1101)$ contains $10$ palindromes, of which $6$ are nice.) a) What is the least number of palindromes in a code? b) What is the least number of nice palindromes in a code?
Let $T$ be a period of a function $f(x)=|\cos x|\sin x\ (-\infty,\ \infty).$ Find $\lim_{n\to\infty} \int_0^{nT} e^{-x}f(x)\ dx.$
Let $p_1, p_2, \ldots, p_{25}$ are primes which don’t exceed 2004. Find the largest integer $T$ such that every positive integer $\leq T$ can be expressed as sums of distinct divisors of $(p_1\cdot p_2 \cdot \ldots \cdot p_{25})^{2004}.$
Two circles lie outside regular hexagon $ ABCDEF$. The first is tangent to $ \overline{AB}$, and the second is tangent to $ \overline{DE}$. Both are tangent to lines $ BC$ and $ FA$. What is the ratio of the area of the second circle to that of the first circle? $ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 27\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 81\qquad\textbf{(E)}\ 108$
Let $a$, $b$, and $c$ be the $3$ roots of $x^3-x+1=0$. Find $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}.$
Find the maximum value of the positive real number $k$ such that the inequality $$\frac{1}{kab+c^2} +\frac{1} {kbc+a^2} +\frac{1} {kca+b^2} \geq \frac{k+3}{a^2+b^2+c^2} $$holds for all positive real numbers $a,b,c$ such that $a^2+b^2+c^2=2(ab+bc+ca).$
Alice asserts that after her recent visit to Addis-Ababa she now has spent the New Year inside every possible hemisphere of Earth except one. What is the minimal number of places where Alice has spent the New Year? Note: we consider places of spending the New Year to be points on the sphere. A point on the border of a hemisphere does not lie inside the hemisphere. Ilya Dumansky, Roman Krutovsky
Consider the finite sequence $\left\lfloor \frac{k^2}{1998} \right\rfloor$, for $k=1,2,\ldots, 1997$. How many distinct terms are there in this sequence? [i]Greece[/i]
For two real numbers $ a$, $ b$, with $ ab\neq 1$, define the $ \ast$ operation by \[ a\ast b=\frac{a+b-2ab}{1-ab}.\] Start with a list of $ n\geq 2$ real numbers whose entries $ x$ all satisfy $ 0<x<1$. Select any two numbers $ a$ and $ b$ in the list; remove them and put the number $ a\ast b$ at the end of the list, thereby reducing its length by one. Repeat this procedure until a single number remains. $ a.$ Prove that this single number is the same regardless of the choice of pair at each stage. $ b.$ Suppose that the condition on the numbers $ x$ is weakened to $ 0<x\leq 1$. What happens if the list contains exactly one $ 1$?
Consider a circular necklace with $\displaystyle{2013}$ beads. Each bead can be paintes either green or white. A painting of the necklace is called [i]good[/i] if among any $\displaystyle{21}$ successive beads there is at least one green bead. Prove that the number of good paintings of the necklace is odd. [b]Note.[/b] Two paintings that differ on some beads, but can be obtained from each other by rotating or flipping the necklace, are counted as different paintings. [i]Proposed by Vsevolod Bykov and Oleksandr Rybak, Kiev.[/i]
If $x,y,K,m \in N$, let us define: $a_m= \underset{k \, twos}{2^{2^{,,,{^{2}}}}}$, $A_{km} (x)= \underset{k \, twos}{ 2^{2^{,,,^{x^{a_m}}}}}$, $B_k(y)= \underset{m \, fours}{4^{4^{4^{,,,^{4^y}}}}}$, Determine all pairs $(x,y)$ of non-negative integers, dependent on $k>0$, such that $A_{km} (x)=B_k(y)$
Three friends are to divide five different jobs between each other so that nobody is left without a job. In how many different ways can this be done? A. 6 B. 25 C. 40 D. 90 E. 150
Let $PROBLEMZ$ be a regular octagon inscribed in a circle of unit radius. Diagonals $MR$, $OZ$ meet at $I$. Compute $LI$.
The circle, which is tangent to the circumcircle of isosceles triangle $ABC$ ($AB=AC$), is tangent $AB$ and $AC$ at $P$ and $Q$, respectively. Prove that the midpoint $I$ of the segment $PQ$ is the center of the excircle (which is tangent to $BC$) of the triangle .
Determine the last digit of $5^5+6^6+7^7+8^8+9^9$.
In the corners of triangle $ABC$ there are three circles with the same radius. Each of them is tangent to two of the triangle's sides. The vertices of triangle $MNK$ lie on different sides of triangle $ABC$, and each edge of $MNK$ is also tangent to one of the three circles. Likewise, the vertices of triangle $PQR$ lie on different sides of triangle $ABC$, and each edge of $PQR$ is also tangent to one of the three circles (see picture below). Prove that triangles $MNK,PQR$ have the same inradius. [img]https://i.imgur.com/bYuBabS.png[/img]
Let $n$ be a positive integer. Prove that the numbers $n^2(n^2 + 2)^2$ and $n^4(n^2 + 2)^2$ are written in base $n^2 +1$ with the same digits but in opposite order.
Let $p$ a prime number and $r$ the remainder of the division of $p$ by $210$. It is known that $r$ is a composite number and can be written as the sum of two non-zero perfect squares. Find all primes less than $2018$ that satisfy these conditions.