Found problems: 85335
Let $S=\{13, 133, \cdots\}$ be the set of the positive integers of the form $133 \cdots 3$. Consider a horizontal row of $2022$ cells. Ana and Borja play a game: they alternatively write a digit on the leftmost empty cell, starting with Ana. When the row is filled, the digits are read from left to right to obtain a $2022$-digit number $N$. Borja wins if $N$ is divisible by a number in $S$, otherwise Ana wins. Find which player has a winning strategy and describe it.
[b]p1.[/b] An evil galactic empire is attacking the planet Naboo with numerous automatic drones. The fleet defending the planet consists of $101$ ships. By the decision of the commander of the fleet, some of these ships will be used as destroyers equipped with one rocket each or as rocket carriers that will supply destroyers with rockets. Destroyers can shoot rockets so that every rocket destroys one drone. During the attack each carrier will have enough time to provide each destroyer with one rocket but not more. How many destroyers and how many carriers should the commander assign to destroy the maximal number of drones and what is the maximal number of drones that the fleet can destroy?
[b]p2.[/b] Solve the inequality: $\sqrt{x^2-3x+2} \le \sqrt{x+7}$
[b]p3.[/b] Find all positive real numbers $x$ and $y$ that satisfy the following system of equations:
$$x^y = y^{x-y}$$
$$x^x = y^{12y}$$
[b]p4.[/b] A convex quadrilateral $ABCD$ with sides $AB = 2$, $BC = 8$, $CD = 6$, and $DA = 7$ is divided by a diagonal $AC$ into two triangles. A circle is inscribed in each of the obtained two triangles. These circles touch the diagonal at points $E$ and $F$. Find the distance between the points $E$ and $F$.
[b]p5.[/b] Find all positive integer solutions $n$ and $k$ of the following equation:
$$\underbrace{11... 1}_{n} \underbrace{00... 0}_{2n+3} + \underbrace{77...7}_{n+1} \underbrace{00...0}_{n+1}+\underbrace{11...1}_{n+2} = 3k^3.$$
[b]p6.[/b] The Royal Council of the planet Naboo consists of $12$ members. Some of these members mutually dislike each other. However, each member of the Council dislikes less than half of the members. The Council holds meetings around the round table. Queen Amidala knows about the relationship between the members so she tries to arrange their seats so that the members that dislike each other are not seated next to each other. But she does not know whether it is possible. Can you help the Queen in arranging the seats? Justify your answer.
PS. You should use hide for answers.
A spatial quadrilateral is circumscribed around a sphere. Prove that all the tangent points lie in one plane.
Let $O$ be the circumcenter of $\triangle ABC$($AB<AC$), and $D$ be a point on the internal angle bisector of $\angle BAC$. Point $E$ lies on $BC$, satisfying $OE\parallel AD$, $DE\perp BC$. Point $K$ lies on $EB$ extended such that $EK=EA$. The circumcircle of $\triangle ADK$ meets $BC$ at $P\neq K$, and meets the circumcircle of $\triangle ABC$ at $Q\neq A$. Prove that $PQ$ is tangent to the circumcircle of $\triangle ABC$.
In a scalene triangle $ABC$, $\alpha$ and $\beta$ respectively denote the interior angles at vertixes $A$ and $B$. The bisectors of these two angles meet the opposite sides of the triangle at points $D$ and $E$, respectively. Prove that the acute angle between the lines $DE$ and $AB$ does not exceed $ \frac{ | \alpha - \beta |}{3}$ .
[i]Proposed by Dusan Djukic[/i]
Let $P_1,P_2,P_3,P_4$ be four distinct points in the plane. Suppose $\ell_1,\ell_2, … , \ell_6$ are closed segments in that plane with the following property: Every straight line passing through at least one of the points $P_i$ meets the union $\ell_1 \cup \ell_2\cup … \cup\ell_6$ in exactly two points. Prove or disprove that the segments $\ell_i$ necessarily form a hexagon.
Let $\varphi$ be the positive solution to the equation $$x^2=x+1.$$ For $n\ge 0$, let $a_n$ be the unique integer such that $\varphi^n-a_n\varphi$ is also an integer. Compute $$\sum_{n=0}^{10}a_n.$$
Six mathematician sit around a round table. Each of them has a number and they do the following transformation: Each time, two mathematician sitting next to each other is chosen, they will add $1$ to their own number. Is it possible to make all the six numbers equal if the initial numbers are
a) 6,5,4,3,2,1
b) 7,5,3,2,1,4
$\cos^210^{\circ}+\cos^250-\sin40^{\circ}\cdot\sin80^{\circ}$=________.
The $ABC$ triangle is given, point $I_a$ is the center of an exscribed circle touching the side $BC$ , the point $M$ is the midpoint of the side $BC$, the point $W$ is the intersection point of the bisector of the angle $A$ of the triangle $ABC$ with the circumscribed circle around him. Prove that the area of the triangle $I_aBC$ is calculated by the formula $S_{ (I_aBC)} = MW \cdot p$, where $p$ is the semiperimeter of the triangle $ABC$.
(Mykola Moroz)
The faces of a convex polyhedron are congruent parallelograms. Prove that they are all rhombuses.
Let $p$ be a prime such that $p \equiv 3 \pmod 4$. Prove that we can't partition the numbers $a,a+1,a+2,\cdots,a+p-2$,($a \in \mathbb Z$) in two sets such that product of members of the sets be equal.
Two identically oriented equilateral triangles, $ABC$ with center $S$ and $A'B'C$, are given in the plane. We also have $A' \neq S$ and $B' \neq S$. If $M$ is the midpoint of $A'B$ and $N$ the midpoint of $AB'$, prove that the triangles $SB'M$ and $SA'N$ are similar.
Let $D$ be the interior of the circle $C$ and let $A \in C$. Show that the function $f : D \to \mathbb R, f(M)=\frac{|MA|}{|MM'|}$ where $M' = AM \cap C$, is strictly convex; i.e., $f(P) <\frac{f(M_1)+f(M_2)}{2}, \forall M_1,M_2 \in D, M_1 \neq M_2$ where $P$ is the midpoint of the segment $M_1M_2.$
Let $a_1,a_2,\ldots$ be a sequence defined by $a_1=a_2=1$ and $a_{n+2}=a_{n+1}+a_n$ for $n\geq 1$. Find \[\sum_{n=1}^\infty \dfrac{a_n}{4^{n+1}}.\]
A regular tetrahedral massless frame whose side length is physically variable (with the constraint of the tetrahedron being regular) is dipped in a soap solution of surface tension $T$, taken outside and allowed to settle after a little wiggle.\\
The soap film is formed such that there is no volume in space that is enclosed by any of the surfaces soap film and all the soap film surfaces are planar. You may assume the configuration of the soap film without proof.\\
Now 4 point charges of charge $q$ are fixed at the vertices of the tetrahedron.\\
The system now sets into motion with the shape and nature of soap film being unaltered at all times.\\
[list]
[*] Find the side length of the tetrahedron for which the system attains mechanical equilibrium. [/*]
[*] Find the differential equation(s) governing the side length with respect to time.[/*]
[*] If the amplitude of oscillations are very small, find the time period of oscillations.[/*]
[/list]
Consider the binomial coefficients $\binom{n}{k}=\frac{n!}{k!(n-k)!}\ (k=1,2,\ldots n-1)$. Determine all positive integers $n$ for which $\binom{n}{1},\binom{n}{2},\ldots ,\binom{n}{n-1}$ are all even numbers.
A parking lot has $ 16$ spaces in a row. Twelve cars arrive, each of which requires one parking space, and their drivers chose spaces at random from among the available spaces. Auntie Em then arrives in her SUV, which requires $ 2$ adjacent spaces. What is the probability that she is able to park?
$ \textbf{(A)} \ \frac {11}{20} \qquad \textbf{(B)} \ \frac {4}{7} \qquad \textbf{(C)} \ \frac {81}{140} \qquad \textbf{(D)} \ \frac {3}{5} \qquad \textbf{(E)} \ \frac {17}{28}$
Alice the architect and Bob the builder play a game. First, Alice chooses two points $P$ and $Q$ in the plane and a subset $\mathcal{S}$ of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair $A,\,B$ of cities, they are connected with a road along the line segment $AB$ if and only if the following condition holds:
[center]For every city $C$ distinct from $A$ and $B$, there exists $R\in\mathcal{S}$ such[/center]
[center]that $\triangle PQR$ is directly similar to either $\triangle ABC$ or $\triangle BAC$.[/center]
Alice wins the game if (i) the resulting roads allow for travel between any pair of cities via a finite sequence of roads and (ii) no two roads cross. Otherwise, Bob wins. Determine, with proof, which player has a winning strategy.
[i]Note:[/i] $\triangle UVW$ is [i]directly similar[/i] to $\triangle XYZ$ if there exists a sequence of rotations, translations, and dilations sending $U$ to $X$, $V$ to $Y$, and $W$ to $Z$.
Find the locus of the points $ M $ that are situated on the plane where a rhombus $ ABCD $ lies, and satisfy:
$$ MA\cdot MC+MB\cdot MD=AB^2 $$
[i]Ovidiu Pop[/i]
Shelby drives her scooter at a speed of 30 miles per hour if it is not raining, and 20 miles per hour if it is raining. Today she drove in the sun in the morning and in the rain in the evening, for a total of 16 miles in 40 minutes. How many minutes did she drive in the rain?
$ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 30$
Given positive integers $m$ and $n$. Let $a_{i,j} ( 1 \le i \le m, 1 \le j \le n)$ be non-negative real numbers, such that
$$ a_{i,1} \ge a_{i,2} \ge \cdots \ge a_{i,n} \text{ and } a_{1,j} \ge a_{2,j} \ge \cdots \ge a_{m,j} $$
holds for all $1 \le i \le m$ and $1 \le j \le n$. Denote
$$ X_{i,j}=a_{1,j}+\cdots+a_{i-1,j}+a_{i,j}+a_{i,j-1}+\cdots+a_{i,1},$$
$$ Y_{i,j}=a_{m,j}+\cdots+a_{i+1,j}+a_{i,j}+a_{i,j+1}+\cdots+a_{i,n}.$$
Prove that
$$ \prod_{i=1}^{m} \prod_{j=1}^{n} X_{i,j} \ge \prod_{i=1}^{m} \prod_{j=1}^{n} Y_{i,j}.$$
Alice and Bob play a game on a sphere which is initially marked with a finite number of points. Alice and Bob then take turns making moves, with Alice going first:
- On Alice’s move, she counts the number of marked points on the sphere, \(n\). She then marks another \(n + 1\) points on the sphere.
- On Bob’s move, he chooses one hemisphere and removes all marked points on that hemisphere, including any marked points on the boundary of the hemisphere.
Can Bob always guarantee that after a finite number of moves, the sphere contains no marked points?
(A [i]hemisphere[/i] is the region on a sphere that lies completely on one side of any plane passing through the centre of the sphere.)
[i]proposed by the ICMC Problem Committee[/i]
A positive integer is called [i]nice[/i] if the sum of its digits in the number system with base $ 3$ is divisible by $ 3$.
Calculate the sum of the first $ 2005$ nice positive integers.
Three wooden equilateral triangles of side length $18$ inches are placed on axles as shown in the diagram to the right. Each axle is $30$ inches from the other two axles. A $144$-inch leather band is wrapped around the wooden triangles, and a dot at the top corner is painted as shown. The three triangles are then rotated at the same speed and the band rotates without slipping or stretching. Compute the length of the path that the dot travels before it returns to its initial position at the top corner.
[asy]
size(150);
defaultpen(linewidth(0.8)+fontsize(10));
pair A=origin,B=(48,0),C=rotate(60,A)*B;
path equi=(0,0)--(18,0)--(9,9*sqrt(3))--cycle,circ=circle(centroid(A,B,C)*18/48,1/3);
picture a;
fill(a,equi,grey);
fill(a,circ,white);
add(a);
add(shift(15,15*sqrt(3))*a);
add(shift(30,0)*a);
draw(A--B--C--cycle,linewidth(1));
path top = circle(C,2/3);
unfill(top);
draw(top);
real r=-5/2;
draw((9,r+1)--(9,r-1)^^(9,r)--(39,r)^^(39,r-1)--(39,r+1));
label("$30$",(24,r),S);
[/asy]