Found problems: 85335
Find the four smallest four-digit numbers that meet the following condition: by dividing by $2$, $3$, $4$, $5$ or $6$ the remainder is $ 1$.
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
Consider a $8\times 8$ chessboard where all $64$ unit squares are at the start white. Prove that, if any $12$ of the $64$ unit square get painted black, then we can find $4$ lines and $4$ rows that have all these $12$ unit squares.
Let $a,b,c>0$ the sides of a right triangle. Find all real $x$ for which $a^x>b^x+c^x$, with $a$ is the longest side.
Let $\Theta_1$ and $\Theta_2$ be circumferences with centers $O_1$ and $O_2$, exteriorly tangents. Let $A$ and $B$ be points in $\Theta_1$ and $\Theta_2$, respectively, such that $AB$ is common external tangent to $\Theta_1$ and $\Theta_2$. Let $C$ and $D$ be points on the semiplane determined by $AB$ that does not contain $O_1$ and $O_2$ such that $ABCD$ is a square. If $O$ is the center of this square, compute the possible values for the angle $\angle O_1OO_2$.
A triangle $ ABC$ is given with $ \left|AB\right| > \left|AC\right|$. Line $ l$ tangents in a point $ A$ the circumcirle of $ ABC$. A circle centered in $ A$ with radius $ \left|AC\right|$ cuts $ AB$ in the point $ D$ and the line $ l$ in points $ E, F$ (such that $ C$ and $ E$ are in the same halfplane with respect to $ AB$). Prove that the line $ DE$ passes through the incenter of $ ABC$.
(a) Let $ABC$ be any triangle. Let $X, Y, Z$ be points on the sides $BC, CA, AB$ respectively.
Suppose that $BX \leq XC, CY \leq YA, AZ \leq ZB$. Show that the area of the triangle $XYZ$ $\geq 1\slash 4$ times the area of $ABC.$
(b) Let $ABC$ be any triangle, and let $X, Y, Z$ be points on the sides $BC, CA, AB$ respectively. Using (a) or by any other method, show: One of the three corner triangles $AZY, BXZ, CYX$ has an area $\leq$ area of the triangle $XYZ.$
Let $n\ge 2$ be a positive integer. $S$ is a set of $2n$ airports. For two arbitrary airports $A,B$, if there is an airway from $A$ to $B$, then there is an airway from $B$ to $A$. Suppose that $S$ has only one independent set of $n$ airports. Let the independent set $X$. Prove that there exists an airport $P\in S\setminus X$ which satisfies following condition.
[b]Condition[/b] : For two arbitrary distinct airports $A,B\in S\setminus \{P\}$, if there exists a path connecting $A$ and $B$, then there exists a path connecting $A$ and $B$ which does not pass $P$.
Let $\dots, a_{-1}, a_0, a_1, a_2, \dots$ be a sequence of positive integers satisfying the folloring relations: $a_n = 0$ for $n < 0$, $a_0 = 1$, and for $n \ge 1$,
\[a_n = a_{n - 1} + 2(n - 1)a_{n - 2} + 9(n - 1)(n - 2)a_{n - 3} + 8(n - 1)(n - 2)(n - 3)a_{n - 4}.\]
Compute
\[\sum_{n \ge 0} \frac{10^n a_n}{n!}.\]
Find all polynomials $P(x,y)$ with real coefficients such that for all real numbers $x,y$ and $z$:
$$P(x,2yz)+P(y,2zx)+P(z,2xy)=P(x+y+z,xy+yz+zx).$$
[i]Proposed by Sina Saleh[/i]
Let $n\geq 2$ be integer. On a plane there are $n+2$ points $O,\ P_{0},\ P_{1},\ \cdots P_{n}$ which satisfy the following conditions as follows.
[1] $\angle{P_{k-1}OP_{k}}=\frac{\pi}{n}\ (1\leq k\leq n),\ \angle{OP_{k-1}P_{k}}=\angle{OP_{0}P_{1}}\ (2\leq k\leq n).$
[2] $\overline{OP_{0}}=1,\ \overline{OP_{1}}=1+\frac{1}{n}.$
Find $\lim_{n\to\infty}\sum_{k=1}^{n}\overline{P_{k-1}P_{k}}.$
Prove that $5^n$ has a block of $1976$ consecutive $0's$ in its decimal representation.
There are $n \ge 2$ positive integers written on the whiteboard. A move consists of three steps: calculate the least common multiple $N$ of all numbers then choose any number $a$ and replace $a$ by $N/a$ .
Prove that, using a finite number of moves, you can always make all the numbers on the whiteboard equal to $ 1$.
If $\frac{1}{\sqrt{2011+\sqrt{2011^2-1}}}=\sqrt{m}-\sqrt{n}$, where $m$ and $n$ are positive integers, what is the value of $m+n$?
It is given an acute triangle $ABC$ , $AB \neq AC$ where the feet of altitude from $A$ its $H$. In the extensions of the sides $AB$ and $AC$ (in the direction of $B$ and $C$) we take the points $P$ and $Q$ respectively such that $HP=HQ$ and the points $B,C,P,Q$ are concyclic.
Find the ratio $\tfrac{HP}{HA}$.
Consider the collection of all three-element subsets drawn from the set $ \{1,2,3,4,\dots,299,300\}$.
Determine the number of those subsets for which the sum of the elements is a multiple of 3.
The function $f(x)$ satisfies $f(2+x) = f(2-x)$ for all real numbers $x$. If the equation $f(x) = 0$ has exactly four distinct real roots, then the sum of these roots is
A. 0
B. 2
C. 4
D. 6
E. 8
[u]Round 1[/u]
[b]p1.[/b] Ten children arrive at a birthday party and leave their shoes by the door. All the children have different shoe sizes. Later, as they leave one at a time, each child randomly grabs a pair of shoes their size or larger. After some kids have left, all of the remaining shoes are too small for any of the remaining children. What is the greatest number of shoes that might remain by the door?
[b]p2.[/b] Turans, the king of Saturn, invented a new language for his people. The alphabet has only $6$ letters: A, N, R, S, T, U; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the first word is SATURN. Which word follows immediately after TURANS?
[b]p3.[/b] Benji chooses five integers. For each pair of these numbers, he writes down the pair's sum. Can all ten sums end with different digits?
[b]p4.[/b] Nine dwarves live in a house with nine rooms arranged in a $3\times3$ square. On Monday morning, each dwarf rubs noses with the dwarves in the adjacent rooms that share a wall. On Monday night, all the dwarves switch rooms. On Tuesday morning, they again rub noses with their adjacent neighbors. On Tuesday night, they move again. On Wednesday morning, they rub noses for the last time. Show that there are still two dwarves who haven't rubbed noses with one another.
[b]p5.[/b] Anna and Bobby take turns placing rooks in any empty square of a pyramid-shaped board with $100$ rows and $200$ columns. If a player places a rook in a square that can be attacked by a previously placed rook, he or she loses. Anna goes first. Can Bobby win no matter how well Anna plays?
[img]https://cdn.artofproblemsolving.com/attachments/7/5/b253b655b6740b1e1310037da07a0df4dc9914.png[/img]
[u]Round 2[/u]
[b]p6.[/b] Some boys and girls, all of different ages, had a snowball fight. Each girl threw one snowball at every kid who was older than her. Each boy threw one snowball at every kid who was younger than him. Three friends were hit by the same number of snowballs, and everyone else took fewer hits than they did. Prove that at least one of the three is a girl.
[b]p7.[/b] Last year, jugglers from around the world travelled to Jakarta to participate in the Jubilant Juggling Jamboree. The festival lasted $32$ days, with six solo performances scheduled each day. The organizers noticed that for any two days, there was exactly one juggler scheduled to perform on both days. No juggler performed more than once on a single day. Prove there was a juggler who performed every day.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let be a natural number $ n\ge 4 $ and $ n $ nonnegative numbers $ a,b,\ldots ,c. $ Prove that
$$ \prod_{\text{cyc} } (a+b+c)^2 \ge 2^n\prod_{\text{cyc} } (a+b)^2, $$
and tell in which circumstances equality happens.
Call a positive integer $n$ [i]tubular [/i] if for any two distinct primes $p$ and $q$ dividing $n, (p + q) | n$. Find the number of tubular numbers less than $100,000$. (Integer powers of primes, including $1, 3$, and $16$, are not considered [i]tubular[/i].)
Let $P(x)=x^{2000}-x^{1000}+1$. Prove that there don't exist 8002 distinct positive integers $a_1,\dots,a_{8002}$ such that $a_ia_ja_k|P(a_i)P(a_j)P(a_k)$ for all $i\neq j\neq k$.
[I]Proposed by A. Baranov[/i]
There are $N$ points on the plane; no three of them belong to the same straight line. Every pair of points is connected by a segment. Some of these segments are colored in red and the rest of them in blue. The red segments form a closed broken line without self-intersections(each red segment having only common endpoints with its two neighbors and no other common points with the other segments), and so do the blue segments. Find all possible values of $N$ for which such a disposition of $N$ points and such a choice of red and blue segments are possible.
Let $ABCDEF$ be a regular hexagon of side lengths $1$ and $O$ its centre, Join $O$ cto each of the six vertices , thus getting $12$ unit line segments in all. Find the number of closed paths from (i) $O$ to $O$ (ii) $A$ to $A$ each of length $2004$
[b]p1.[/b] Two players play the following game. On the lowest left square of an $8 \times 8$ chessboard there is a rook (castle). The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second layer is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy?
[b]p2.[/b] Find the smallest positive whole number that ends with $17$, is divisible by $17$, and the sum of its digits is $17$.
[b]p3.[/b] Three consecutive $2$-digit numbers are written next to each other. It turns out that the resulting $6$-digit number is divisible by $17$. Find all such numbers.
[b]p4.[/b] Let $ABCD$ be a convex quadrilateral (a quadrilateral $ABCD$ is called convex if the diagonals $AC$ and $BD$ intersect). Suppose that $\angle CBD = \angle CAB$ and $\angle ACD = \angle BDA$ . Prove that $\angle ABC = \angle ADC$.
[b]p5.[/b] A circle of radius $1$ is cut into four equal arcs, which are then arranged to make the shape shown on the picture. What is its area?
[img]https://cdn.artofproblemsolving.com/attachments/f/3/49c3fe8b218ab0a5378ecc635b797a912723f9.png[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let real numbers $x_1, x_2, \cdots , x_n$ satisfy $0 < x_1 < x_2 < \cdots< x_n < 1$ and set $x_0 = 0, x_{n+1} = 1$. Suppose that these numbers satisfy the following system of equations:
\[\sum_{j=0, j \neq i}^{n+1} \frac{1}{x_i-x_j}=0 \quad \text{where } i = 1, 2, . . ., n.\]
Prove that $x_{n+1-i} = 1- x_i$ for $i = 1, 2, . . . , n.$