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

There are a million numbered chairs at a large round table. The Sultan has seated a million wise men on them. Each of them sees the thousand people following him in clockwise order. Each of them was given a cap of black or white color, and they must simultaneously write down on their own piece of paper a guess about the color of their cap. Those who do not guess will be executed. The wise men had the opportunity to agree on a strategy before the test. What is the largest number of survivors that they can guarantee?
Determine all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that $$f(f(x)-9f(y))=(x+3y)^2f(x-3y)$$ for all $x,y\in \mathbb{R}$.
For every integer $n \ge 2$ let $B_n$ denote the set of all binary $n$-nuples of zeroes and ones, and split $B_n$ into equivalence classes by letting two $n$-nuples be equivalent if one is obtained from the another by a cyclic permutation.(for example 110, 011 and 101 are equivalent). Determine the integers $n \ge 2$ for which $B_n$ splits into an odd number of equivalence classes.
Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.
For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.
Let u be a fixed positive integer. Prove that the equation $n! = u^{\alpha} - u^{\beta}$ has a finite number of solutions $(n, \alpha, \beta).$
A triangle and a trapezoid are equal in area. They also have the same altitude. If the base of the triangle is $ 18$ inches, the median of the trapezoid is: $ \textbf{(A)}\ 36\text{ inches} \qquad\textbf{(B)}\ 9\text{ inches} \qquad\textbf{(C)}\ 18\text{ inches}\\ \textbf{(D)}\ \text{not obtainable from these data} \qquad\textbf{(E)}\ \text{none of these}$
Let $PQ$ be the diameter of semicircle $H$. Circle $O$ is internally tangent to $H$ and tangent to $PQ$ at $C$. Let $A$ be a point on $H$ and $B$ a point on $PQ$ such that $AB\perp PQ$ and is tangent to $O$. Prove that $AC$ bisects $\angle PAB$
Can the numbers $1,2,3,\ldots,100$ be covered with $12$ geometric progressions? [i]A. Golovanov[/i]
Let $\omega$ be a semicircle and $AB$ its diameter. $\omega_1$ and $\omega_2$ are two different circles, both tangent to $\omega$ and to $AB$, and $\omega_1$ is also tangent to $\omega_2$. Let $P,Q$ be the tangent points of $\omega_1$ and $\omega_2$ to $AB$ respectively, and $P$ is between $A$ and $Q$. Let $C$ be the tangent point of $\omega_1$ and $\omega$. Find $\tan\angle ACQ$.
Let $ABCD$ be a quadrilateral with $\overline{AB}\parallel\overline{CD}$, $AB=16$, $CD=12$, and $BC<AD$. A circle with diameter $12$ is inside of $ABCD$ and tangent to all four sides. Find $BC$.
Let $ABCD$ be a convex quadrilateral with perpendicular diagonals, such that $\angle BAC = \angle ADB$, $\angle CBD = \angle DCA$, $AB = 15$, $CD = 8$. Show that $ABCD$ is cyclic and find the distance between its circumcenter and the intersection point of its diagonals.
For a positive integer $n$, let $f(n)$ be the integer formed by reversing the digits of $n$ (and removing any leading zeroes). For example $f(14172)=27141$. Define a sequence of numbers $\{a_n\}_{n\ge 0}$ by $a_0=1$ and for all $i\ge 0$, $a_{i+1}=11a_i$ or $a_{i+1}=f(a_i)$ . How many possible values are there for $a_8$? [i]Proposed by James Lin[/i]
Prove that the polynomial $P_n(x)=1+x+\frac{x^2}{2!}+\cdots +\frac{x^n}{n!}$ has no real zeros if $n$ is even and has exatly one real zero if $n$ is odd
Prove that the unit square can be tiled with rectangles (not necessarily of the same size) similar to a rectangle of size $1\times(3+\sqrt[3]{3})$.
Al has three red marbles and four blue marbles. He draws two different marbles at the same time. What is the probability that one is red and the other is blue?
Misha came to country with $n$ cities, and every $2$ cities are connected by the road. Misha want visit some cities, but he doesn`t visit one city two time. Every time, when Misha goes from city $A$ to city $B$, president of country destroy $k$ roads from city $B$(president can`t destroy road, where Misha goes). What maximal number of cities Misha can visit, no matter how president does?
Suppose there are $4n$ line segments of unit length inside a circle of radius $n$. Furthermore, a straight line $L$ is given. Prove that there exists a straight line $L'$ that is either parallel or perpendicular to $L$ and that $L'$ cuts at least two of the given line segments.
Show that there is no infinite sequence of primes $p_1, p_2, p_3, . . .$ there any for each $ k$: $p_{k+1} = 2p_k - 1$ or $p_{k+1} = 2p_k + 1$ is fulfilled. Note that not the same formula for every $k$.
Show that for no integers $a \geq 1, n \geq 1$ is the sum \[1+\frac{1}{1+a}+\frac{1}{1+2a}+\cdots+\frac{1}{1+na}\] an integer.
Let be a natural number $ n\ge 2 $ and the $ n\times n $ matrix whose entries at the $ \text{i-th} $ line and $ \text{j-th} $ column is $ \min (i,j) . $ Calculate: [b]a)[/b] its determinant. [b]b)[/b] its inverse.
$10$ numbers are placed on a circle. Their sum is equal to $100$. A sum of any three neighbouring numbers is no less than $29$. Find the minimal number $A$ such that for any such set of 10 numbers none of them is greater than $A$. Prove that this value for $A$ is really minimal. (A. Tolpygo, Kiev)
Let $n =123456789101112 ... 998999$ be the natural number where is obtained by writing the natural numbers from $1$ to $999$ one after the other. What is the $1997$-th digit number in $n$?
Let $ABCD$ be a cyclic quadrilateral with $3AB = 2AD$ and $BC = CD$. The diagonals $AC$ and $BD$ intersect at point $X$. Let $E$ be a point on $AD$ such that $DE = AB$ and $Y$ be the point of intersection of lines $AC$ and $BE$. If the area of triangle $ABY$ is $5$, then what is the area of quadrilateral $DEY X$?
Determine the integers $n, n \ge 2$, with the property that the numbers $1! , 2 ! , 3 ! , ..., (n- 1)!$ give different remainders when dividing by $n $.