Found problems: 85335
Let $P_1P_2...P_n$ be a regular $n$-gon in the plane and $a_1, . . . , a_n$ be nonnegative integers. It is possible to draw $m$ circles so that for each $1 \le i \le n$, there are exactly $a_i$ circles that contain $P_i$ on their interior. Find, with proof, the minimum possible value of $m$ in terms of the $a_i$.
.
Consider a sequence of equilateral triangles $T_{n}$ as represented below:
[asy]
defaultpen(linewidth(0.8));size(350);
real r=sqrt(3);
path p=origin--(2,0)--(1,sqrt(3))--cycle;
int i,j,k;
for(i=1; i<5; i=i+1) {
for(j=0; j<i; j=j+1) {
for(k=0; k<j; k=k+1) {
draw(shift(5*i-5+(i-2)*(i-1)*1,0)*shift(2(j-k)+k, k*r)*p);
}}}[/asy]
The length of the side of the smallest triangles is $1$. A triangle is called a delta if its vertex is at the top; for example, there are $10$ deltas in $T_{3}$. A delta is said to be perfect if the length of its side is even. How many perfect deltas are there in $T_{20}$?
Given an integer $n \geq 2$, determine all $n$-digit numbers $M_0 = \overline{a_1a_2 \cdots a_n} \ (a_i \neq 0, i = 1, 2, . . ., n)$ divisible by the numbers $M_1 = \overline{a_2a_3 \cdots a_na_1}$ , $M_2 = \overline{a_3a_4 \cdots a_na_1 a_2}$, $\cdots$ , $M_{n-1} = \overline{a_na_1a_2 . . .a_{n-1}}.$
The vertices of a right-angled triangle are on a circle of radius $R$ and the sides of the triangle are tangent to another circle of radius $r$ (this is the circle that is inside triangle). If the lengths of the sides about the right angles are 16 and 30, determine the value of $R+r$.
Are there $4$ distinct positive integers such that adding the product of any two of them to $2006$ yields a perfect square?
Let $ a,b,c$ be positive integers. If $ 30|a\plus{}b\plus{}c$, prove that $ 30|a^5\plus{}b^5\plus{}c^5$.
Diameter $ACE$ is divided at $C$ in the ratio $2:3$. The two semicircles, $ABC$ and $CDE$, divide the circular region into an upper (shaded) region and a lower region. The ratio of the area of the upper region to that of the lower region is
[asy]pair A,B,C,D,EE;
A = (0,0); B = (2,2); C = (4,0); D = (7,-3); EE = (10,0);
fill(arc((2,0),A,C,CW)--arc((7,0),C,EE,CCW)--arc((5,0),EE,A,CCW)--cycle,gray);
draw(arc((2,0),A,C,CW)--arc((7,0),C,EE,CCW));
draw(circle((5,0),5));
dot(A); dot(B); dot(C); dot(D); dot(EE);
label("$A$",A,W);
label("$B$",B,N);
label("$C$",C,E);
label("$D$",D,N);
label("$E$",EE,W);
[/asy]
$\textbf{(A)}\ 2:3 \qquad \textbf{(B)}\ 1:1 \qquad \textbf{(C)}\ 3:2 \qquad \textbf{(D)}\ 9:4 \qquad \textbf{(E)}\ 5:2$
Two persons are dividing a piece of cheese. The first person cuts it into two pieces, then the second person cuts one of these pieces into two, then again the first person cuts one of the pieces into two, and so until they have 5 pieces. After that the first person chooses one of the pieces, then the second person chooses one of remaining pieces and so on until all pieces are taken. For each of the players, what is the maximal amount of cheese he can get for certain, regardless of the other's actions?
The plane is dissected by broken lines into some regions. It is possible to paint the map formed by these regions in three colours so that any neighbouring regions will have different colours. Call by knots the points which belong to at least two segments of broken lines. One of the segments connecting two knots is erased and replaced by arbitrary broken line connecting the same knots. Prove that it is possible to paint new map in three colours so that any neighbouring regions will have different colours.
Let $\mathbb{S}$ be the set of all functions $f:\mathbb{Z}\rightarrow \mathbb{R}$. Now, consider the function $g:\mathbb{S} \rightarrow \mathbb{S} ,g(f(x)) = f(x + 1)-f(x)$. Now, we call a function $f \in \mathbb{S}$ good if $g^n(f(x))=0$ for some natural $n$.
Prove that if $s \not = t \in S$ are good functions then $s(m)-t(m)$ is 0 for only finitely many $m \in \mathbb{Z}$.
$HOW,BOW,$ and $DAH$ are equilateral triangles in a plane such that $WO=7$ and $AH=2$. Given that $D,A,B$ are collinear in that order, find the length of $BA$.
Triangle $ABC$ is inscribed in a unit circle $\omega$. Let $H$ be its orthocenter and $D$ be the foot of the perpendicular from $A$ to $BC$. Let $\triangle XY Z$ be the triangle formed by drawing the tangents to $\omega$ at $A, B, C$. If $\overline{AH} = \overline{HD}$ and the side lengths of $\triangle XY Z$ form an arithmetic sequence, the area of $\triangle ABC$ can be expressed in the form $\tfrac{p}{q}$ for relatively prime positive integers $p, q$. What is $p + q$?
Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.
Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that
\[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
For every dollar Ben spent on bagels, David spent $25$ cents less. Ben paid $\$12.50$ more than David. How much did they spend in the bagel store together?
$\textbf{(A)}\ \$37.50 \qquad\textbf{(B)}\ \$50.00\qquad\textbf{(C)}\ \$87.50\qquad\textbf{(D)}\ \$90.00\qquad\textbf{(E)}\ \$92.50$
In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?
Let an acute angled triangle $ABC$ be given. Prove that the circles whose diameters are $AB$ and $AC$ have a point of intersection on $BC$.
Find all functions $f : Z \to Z$ satisfying
$\bullet$ $ f(p) > 0$ for all prime numbers $p$,
$\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.
The sides $AB$ and $AC$ are tangent at points $P$ and $Q$, respectively, to the incircle of a triangle $ABC. R$ and $S$ are the midpoints of the sides $AC$ and $BC$, respectively, and $T$ is the intersection point of the lines $PQ$ and $RS$. Prove that $T$ lies on the bisector of the angle $B$ of the triangle.
(M Evdokimov)
The point $P$ lies inside, or on the boundary of, the triangle $ABC$. Denote by $d_{a}$, $d_{b}$ and $d_{c}$ the distances between $P$ and $BC$, $CA$, and $AB$, respectively. Prove that $\max\{AP,BP,CP \} \ge \sqrt{d_{a}^{2}+d_{b}^{2}+d_{c}^{2}}$. When does the equality holds?
Chris and Michael play a game on a board which is a rhombus of side length $n$ (a positive integer) consisting of two equilateral triangles, each of which has been divided into equilateral triangles of side length $ 1$. Each has a single token, initially on the leftmost and rightmost squares of the board, called the “home” squares (the illustration shows the case $n = 4$).
[img]https://cdn.artofproblemsolving.com/attachments/e/b/8135203c22ce77c03c144850099ad1c575edb8.png[/img]
A move consists of moving your token to an adjacent triangle (two triangles are adjacent only if they share a side). To win the game, you must either capture your opponent’s token (by moving to the triangle it occupies), or move on to your opponent’s home square.
Supposing that Chris moves first, which, if any, player has a winning strategy?
Let $f(x)$ be a continuous real-valued function defined on the interval $[0, 1]$. Show that \[\int_0^1\int_0^1|f(x)+f(y)|dx \; dy \ge \int_0^1 |f(x)|dx\]
A child lines up $2020^2$ pieces of bricks in a row, and then remove bricks whose positions are square numbers (i.e. the 1st, 4th, 9th, 16th, ... bricks). Then he lines up the remaining bricks again and remove those that are in a 'square position'. This process is repeated until the number of bricks remaining drops below $250$. How many bricks remain in the end?
Do there exist four points $P_i = (x_i, y_i) \in \mathbb{R}^2\ (1\leq i \leq 4)$ on the plane such that:
[list]
[*] for all $i = 1,2,3,4$, the inequality $x_i^4 + y_i^4 \le x_i^3+ y_i^3$ holds, and
[*] for all $i \neq j$, the distance between $P_i$ and $P_j$ is greater than $1$?
[/list]
[i]Pakawut Jiradilok[/i]
Triangle $ABC$ has $\overline{AB} = \overline{AC} = 20$ and $\overline{BC} = 15$. Let $D$ be the point in $\triangle ABC$ such that $\triangle ADB \sim \triangle BDC$. Let $l$ be a line through $A$ and let $BD$ and $CD$ intersect $l$ at $P$ and $Q$, respectively. Let the circumcircles of $\triangle BDQ$ and $\triangle CDP$ intersect at $X$. The area of the locus of $X$ as $l$ varies can be expressed in the form $\tfrac{p}{q}\pi$ for positive coprime integers $p$ and $q$. What is $p + q$?