Found problems: 85335
Let $ \triangle ABC $ be equilateral. On the side $ AB $ points $ C_{1} $ and $ C_{2} $, on the side $ AC $ points $ B_{1} $ and $ B_{2} $ are chosen, and on the side $ BC $ points $ A_{1} $ and $ A_{2} $ are chosen. The following condition is given : $ A_{1}A_{2} $ = $ B_{1}B_{2} $ = $ C_{1}C_{2} $. Let the intersection lines $ A_{2}B_{1}$ and $ B_{2}C_{1} $, $ B_{2}C_{1} $ and $ C_{2}A_{1} $ and $ C_{2}A_{1} $ and $ A_{2}B_{1} $ are $ E $, $ F $, and $ G $ respectively. Show that the triangle formed by $ B_{1}A_{2} $, $ A_{1}C_{2} $ and $ C_{1}B_{2} $ is similar to $ \triangle EFG $.
Four buddies bought a ball. First one paid half of the ball price. Second one gave one third of money that other three gave. Third one paid a quarter of sum paid by other three. Fourth paid $5\$$. How much did the ball cost?
Let $f(x) = \sin \frac{x}{3}+ \cos \frac{3x}{10}$ for all real $x$.
Find the least natural number $n$ such that $f(n\pi + x)= f(x)$ for all real $x$.
Denote by $\mathbb{N}$ the set of positive integers. Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that:
[b]•[/b] For all positive integers $a> 2023^{2023}$ it holds that $f(a) \leq a$.
[b]•[/b] $\frac{a^2f(b)+b^2f(a)}{f(a)+f(b)}$ is a positive integer for all $a,b \in \mathbb{N}$.
[i]Proposed by Nikola Velov[/i]
An $n$-digit positive integer is [i]cute[/i] if its $n$ digits are an arrangement of the set $\{1,2,\ldots,n\}$ and its first $k$ digits form an integer that is divisible by $k$, for $k = 1,2,\ldots,n$. For example 321 is a cute 3-digit integer because 1 divides 3, 2 divides 32, and 3 divides 321. How many cute 6-digit integers are there?
$ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4 $
Let $a,b,c$ be non-zero real numbers.Prove that if function $f,g:\mathbb{R}\to\mathbb{R}$ satisfy $af(x+y)+bf(x-y)=cf(x)+g(y)$ for all real number $x,y$ that $y>2018$ then there exists a function $h:\mathbb{R}\to\mathbb{R}$ such that $f(x+y)+f(x-y)=2f(x)+h(y)$ for all real number $x,y$.
Let $f$ of degree at most 13 such that $f(k) = 13^k$ for $0 \leq k \leq 13$. Compute the last three digits of $f(14)$.
[i]Proposed by Kaylee Ji[/i]
Determine the sum of all possible positive integers $n, $ the product of whose digits equals $n^2 -15n -27$.
The plane is colored with two colors so that the following property holds: for each real $a>0$ there is an equilateral triangle of side length $a$ whose $3$ vertices are of the same color.
Prove that for any three numbers $a,b,c>0$ for which the sum of any two is greater than the third there is a triangle with sides $a$, $b$, and $c$ whose $3$ vertices are of the same color.
Find all sets $x,y,z$ of real numbers that satisfy
$$\begin{cases} x^3 - y^2 = z^2 - x \\ y^3 -z^2 =x^2 -y \\z^3 -x^2 = y^2 -z \end{cases}$$
Dave arrives at an airport which has twelve gates arranged in a straight line with exactly $ 100$ feet between adjacent gates. His departure gate is assigned at random. After waiting at that gate, Dave is told the departure gate has been changed to a different gate, again at random. Let the probability that Dave walks $ 400$ feet or less to the new gate be a fraction $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.
Determine the largest possible value of$ M$ for which it holds that:
$$\frac{x}{1 +\dfrac{yz}{x}}+ \frac{y}{1 + \dfrac{zx}{y}}+ \frac{z}{1 + \dfrac{xy}{z}} \ge M,$$
for all real numbers $x, y, z > 0$ that satisfy the equation $xy + yz + zx = 1$.
Let $f(x)$ be a quadratic polynomial with two real roots in the interval $[-1,1]$. Prove that if the maximum value of $|f(x)|$ in the interval $[-1,1]$ is equal to $1$, then the maximum value of $|f'(x)|$ in the interval $[-1,1]$ is not less than $1$.
Solve the following diophantine equation in the set of nonnegative integers:
$11^{a}5^{b}-3^{c}2^{d}=1$.
A line passing through vertex $A$ of regular triangle $ABC$ doesn’t intersect segment $BC$. Points $M$ and $N$ lie on this line, and $AM = AN = AB$ (point $B$ lies inside angle $MAC$). Prove that the quadrilateral formed by lines $AB, AC, BN, CM$ is cyclic.
In set $S$, there is an operation $'' \circ ''$ such that $\forall a,b \in S$, a unique $a \circ b \in S$ exists. And
(i) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ (b \circ c)$.
(ii) $a \circ b \neq b \circ a$ when $a \neq b$.
Prove that:
a.) $\forall a,b,c \in S$, $(a \circ b) \circ c = a \circ c$.
b.) If $S = \{1,2, \ldots, 1990\}$, try to define an operation $'' \circ ''$ in $S$ with the above properties.
For finite sets $A,M$ such that $A \subseteq M \subset \mathbb{Z}^+$, we define $$f_M(A)=\{x\in M \mid x\text{ is divisible by an odd number of elements of }A\}.$$ Given a positive integer $k$, we call $M$ [i]k-colorable[/i] if it is possible to color the subsets of $M$ with $k$ colors so that for any $A \subseteq M$, if $f_M(A)\neq A$ then $f_M(A)$ and $A$ have different colors.
Determine the least positive integer $k$ such that every finite set $M \subset\mathbb{Z}^+$ is k-colorable.
For positive integers $a,b$, $a\uparrow\uparrow b$ is defined as follows: $a\uparrow\uparrow 1=a$, and $a\uparrow\uparrow b=a^{a\uparrow\uparrow (b-1)}$ if $b>1$.
Find the smallest positive integer $n$ for which there exists a positive integer $a$ such that $a\uparrow\uparrow 6\not \equiv a\uparrow\uparrow 7$ mod $n$.
Let $ABC$ be a triangle with $AC > BC,$ let $\omega$ be the circumcircle of $\triangle ABC,$ and let $r$ be its radius. Point $P$ is chosen on $\overline{AC}$ such taht $BC=CP,$ and point $S$ is the foot of the perpendicular from $P$ to $\overline{AB}$. Ray $BP$ mets $\omega$ again at $D$. Point $Q$ is chosen on line $SP$ such that $PQ = r$ and $S,P,Q$ lie on a line in that order. Finally, let $E$ be a point satisfying $\overline{AE} \perp \overline{CQ}$ and $\overline{BE} \perp \overline{DQ}$. Prove that $E$ lies on $\omega$.
Prove the following inequality where positive reals $a$, $b$, $c$ satisfies $ab+bc+ca=1$.
\[
\frac{a+b}{\sqrt{ab(1-ab)}} + \frac{b+c}{\sqrt{bc(1-bc)}} + \frac{c+a}{\sqrt{ca(1-ca)}} \le \frac{\sqrt{2}}{abc}
\]
Compute the remainder when
$$\sum_{n=1}^{2018} n^4$$
is divided by $53$.
Two jokers are added to a $52$ card deck and the entire stack of $54$ cards is shuffled randomly. What is the expected number of cards that will be strictly between the two jokers?
Points $P$ and $Q$ are on line segment $AB$, and both points are on the same side of the midpoint of $AB$. Point $P$ divides $AB$ in the ratio $2:3$ and $Q$ divides $AB$ in the ratio $3:4$. If $PQ=2$, then the length of segment $AB$ is
$\textbf{(A) }12\qquad\textbf{(B) }28\qquad\textbf{(C) }70\qquad\textbf{(D) }75\qquad \textbf{(E) }105$
For a positive integer $n$, let $\langle n \rangle$ denote the perfect square integer closest to $n$. For example, $\langle 74 \rangle = 81$, $\langle 18 \rangle = 16$. If $N$ is the smallest positive integer such that
$$ \langle 91 \rangle \cdot \langle 120 \rangle \cdot \langle 143 \rangle \cdot \langle 180 \rangle \cdot \langle N \rangle = 91 \cdot 120 \cdot 143 \cdot 180 \cdot N $$
find the sum of the squares of the digits of $N$.
Prove that:
(a) if $y<\frac12$ and $n\ge3$ is a natural number then $(y+1)^n\ge y^n+(1+2y)^\frac n2$;
(b) if $x,y,z$ and $n\ge3$ are natural numbers for which $x^2-1\le2y$ then $x^n+y^n\ne z^n$.