Found problems: 85335
There are positive real numbers $a$, $b$, $c$, $d$, and $p$ such that $a$ is $62.5\%$ of $b$, $b$ is $64\%$ of $c$, c is $125\%$ of $d$, and $d$ is $p\%$ of $a$. Find $p$.
2 .Solve the inequality $|x-1|-2|x-4|>3+2x$
In a right $\Delta ABC$ ($\angle C = 90^{\circ} $), $CD$ is the height. Let $r_1$ and $r_2$ be the radii of inscribed circles of $\Delta ACD$ and $\Delta DCB$. Find the radius of inscribed circle of $\Delta ABC$
There are two bowls on a table, one white and one black. In the white bowl there $2019$ balls.
Players $A$ and $B$ play a game where they make every other move ($A$ begins).
One move consists is
$\bullet$ to move one or your balls from one bowl to the other, or
$\bullet$ to remove a ball from the white bowl,
with the condition that the resulting position (that is, the number of bullets in the two bowls) have not occurred before. The player who has no valid move to make loses.
Can any of the players be sure to win? If so, which one?
The sum of $ 18$ consecutive positive integers is a perfect square. The smallest possible value of this sum is
$ \textbf{(A)}\ 169 \qquad
\textbf{(B)}\ 225 \qquad
\textbf{(C)}\ 289 \qquad
\textbf{(D)}\ 361 \qquad
\textbf{(E)}\ 441$
Let $S_0$ be a finite set of positive integers. We define finite sets $S_1, S_2, \cdots$ of positive integers as follows: the integer $a$ in $S_{n+1}$ if and only if exactly one of $a-1$ or $a$ is in $S_n$. Show that there exist infinitely many integers $N$ for which $S_N = S_0 \cup \{ N + a: a \in S_0 \}$.
On the board are written numbers $1, 2,. . . , 33$. In one step we select two numbers written on the product of which is the square of the natural number, we wipe off the two chosen numbers and write the square root of their product on the board. This way we continue to the board only the numbers remain so that the product of neither of them is a square. (In one we can also wipe out two identical numbers and replace them with the same number.) Prove that at least $16$ numbers remain on the board.
On the board is written an integer $N \geq 2$. Two players $A$ and $B$ play in turn, starting with $A$. Each player in turn replaces the existing number by the result of performing one of two operations: subtract 1 and divide by 2, provided that a positive integer is obtained. The player who reaches the number 1 wins.
Determine the smallest even number $N$ requires you to play at least $2015$ times to win ($B$ shifts are not counted).
Let $n$ be an even positive integer. We fill in a number on each cell of a rectangle table of $n$ columns and multiple rows as following:
i. Each row is assigned to some positive integer $a$ and its cells are filled by $0$ or $a$ (in any order);
ii. The sum of all numbers in each row is $n$.
Note that we cannot add any more row to the table such that the conditions (i) and (ii) still hold.
Prove that if the number of $0$’s on the table is odd then the maximum odd number on the table is a perfect square.
Lil Wayne, the rain god, determines the weather. If Lil Wayne makes it rain on any given day, the probability that he makes it rain the next day is $75\%$. If Lil Wayne doesn't make it rain on one day, the probability that he makes it rain the next day is $25\%$. He decides not to make it rain today. Find the smallest positive integer $n$ such that the probability that Lil Wayne [i]makes it rain[/i] $n$ days from today is greater than $49.9\%$.
How many polynomials $P$ with integer coefficients and degree at most $5$ satisfy $0 \le P(x) < 120$ for all $x \in \{0,1,2,3,4,5\}$?
Let $ n(\ge2) $ be a positive integer. Find the minimum $ m $, so that there exists $x_{ij}(1\le i ,j\le n)$ satisfying:
(1)For every $1\le i ,j\le n, x_{ij}=max\{x_{i1},x_{i2},...,x_{ij}\} $ or $ x_{ij}=max\{x_{1j},x_{2j},...,x_{ij}\}.$
(2)For every $1\le i \le n$, there are at most $m$ indices $k$ with $x_{ik}=max\{x_{i1},x_{i2},...,x_{ik}\}.$
(3)For every $1\le j \le n$, there are at most $m$ indices $k$ with $x_{kj}=max\{x_{1j},x_{2j},...,x_{kj}\}.$
In acute-angled triangle $ABC$, altitude of $A$ meets $BC$ at $D$, and $M$ is midpoint of $AC$. Suppose that $X$ is a point such that $\measuredangle AXB = \measuredangle DXM =90^\circ$ (assume that $X$ and $C$ lie on opposite sides of the line $BM$). Show that $\measuredangle XMB = 2\measuredangle MBC$.Proposed by Davood Vakili
In the triangle $ABC$, the medians $AA_1$, $BB_1$, and $CC_1$ are concurrent at a point $T$ such that $BA_1=TA_1$. The points $C_2$ and $B_2$ are chosen on the extensions of $CC_1$ and $BB_2$, respectively, such that
$$C_1C_2 = \frac{CC_1}{3} \quad \text{and} \quad B_1B_2 = \frac{BB_1}{3}.$$
Show that $TB_2AC_2$ is a rectangle.
Suppose that a polynomial of the form $p(x)=x^{2010}\pm x^{2009}\pm \cdots \pm x \pm 1$ has no real roots. What is the maximum possible number of coefficients of $-1$ in $p$?
Suppose that $p$ and $q$ are positive numbers for which \[ \log_{9}(p) = \log_{12}(q) = \log_{16}(p+q) \] What is the value of $\frac{q}{p}$?
$\textbf{(A)}\ \frac{4}{3}\qquad\textbf{(B)}\ \frac{1+\sqrt{3}}{2}\qquad\textbf{(C)}\ \frac{8}{5}\qquad\textbf{(D)}\ \frac{1+\sqrt{5}}{2}\qquad\textbf{(E)}\ \frac{16}{9} $
Let $f$ be a real function on the real line with continuous third derivative. Prove that there exists a point $a$ such that \[f(a)\cdot f^\prime(a)\cdot f^{\prime\prime}(a)\cdot f^{\prime\prime\prime}(a)\geq 0.\]
a) Prove that $\{x+y\}-\{y\}$ can only be equal to $\{x\}$ or $\{x\}-1$ for any $x,y\in \mathbb{R}$.
b) Let $\alpha\in \mathbb{R}\backslash \mathbb{Q}$. Denote $a_n=\{n\alpha\}$ for all $n\in \mathbb{N}^*$ and define the sequence $(x_n)_{n\ge 1}$ by
\[x_n=(a_2-a_1)(a_3-a_2)\cdot \ldots \cdot (a_{n+1}-a_n)\]
Prove that the sequence $(x_n)_{n\ge 1}$ is convergent and find it's limit.
Let $a\geq 1$ be a real number. Put $x_{1}=a,x_{n+1}=1+\ln{(\frac{x_{n}^{2}}{1+\ln{x_{n}}})}(n=1,2,...)$. Prove that the sequence $\{x_{n}\}$ converges and find its limit.
The set of positive integers is partitioned into $n$ disjoint infinite arithmetic progressions $S_1, S_2, \ldots, S_n$ with common differences $d_1, d_2, \ldots, d_n$, respectively. Prove that there exists exactly one index $1\leq i \leq n$ such that\[ \frac{1}{d_i}\prod_{j=1}^n d_j \in S_i.\]
For some real numbers $ a$ and $ b$, the equation
\[ 8x^3 \plus{} 4ax^2 \plus{} 2bx \plus{} a \equal{} 0
\]has three distinct positive roots. If the sum of the base-$ 2$ logarithms of the roots is $ 5$, what is the value of $ a$?
$ \textbf{(A)}\minus{}\!256 \qquad
\textbf{(B)}\minus{}\!64 \qquad
\textbf{(C)}\minus{}\!8 \qquad
\textbf{(D)}\ 64 \qquad
\textbf{(E)}\ 256$
Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$.
Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$.
Find a closed form for $a_n$.
[i]Proposed by Bobby Shen[/i]
Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations:
$$\log_2\left({x \over yz}\right) = {1 \over 2}$$
$$\log_2\left({y \over xz}\right) = {1 \over 3}$$
$$\log_2\left({z \over xy}\right) = {1 \over 4}$$
Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is ${m \over n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
Let $N$ be the set of non-negative integers. The function $f:N\to N$ satisfies $f(a+b) = f(f(a)+b)$ for all $a, b$ and $f(a+b) = f(a)+f(b)$ for $a+b < 10$. Also $f(10) = 1$. How many three digit numbers $n$ satisfy $f(n) = f(N)$, where $N$ is the "tower" $2, 3, 4, 5$, in other words, it is $2^a$, where $a = 3^b$, where $b = 4^5$?
Given a circle $\Omega$ tangent to side $AB$ of angle $\angle BAC$ and lying outside this angle. We consider circles $w$ inscribed in angle $BAC$. The internal tangent of $\Omega$ and $w$, different from $AB$, touches $w$ at a point $K$. Let $L$ be the point of tangency of $w$ and $AC$. Prove that all such lines $KL$ pass through a fixed point without depending on the choice of circle $w$.