Found problems: 85335
Determine the number of three digit integers that are equal to $19$ times the sum of its digits.
In an equilateral triangle ${ABC}$ the segments ${ED}$ and ${GF}$ are drawn to obtain two equilateral triangles ${ADE}$ and ${GFC}$ with sides 1 and 100 (points $E$ and $G$ are on the side ${AC}$ ). The segments ${EF}$ and ${DG}$ meet at point $O$ so that the angle ${EOG}$ is equal to ${120}^{ \circ }$ . What is the length of the side of the triangle ${ABC}$ ?
Mikhail Evdokimov
Calculate the sum of $n$ addends
$$7 + 77 + 777 +...+ 7... 7.$$
Let $R$ be a commutative ring with $1$ such that the number of elements of $R$ is equal to $p^3$ where $p$ is a prime number. Prove that if the number of elements of $\text{zd}(R)$ be in the form of $p^n$ ($n \in \mathbb{N^*}$) where $\text{zd}(R) = \{a \in R \mid \exists 0 \neq b \in R, ab = 0\}$, then $R$ has exactly one maximal ideal.
The rook, standing on the surface of the checkered cube, beats the cells, located in the same row as well as on the
continuations of this series through one or even several edges. (The picture shows an example for a $4 \times 4 \times 4$ cube,visible cells that some beat the rook, shaded gray.) What is the largest number do not beat each other rooks can be placed on the surface of the cube $50 \times 50 \times 50$?
Big Bad Brandon is assigning groups of his Big Bad Burglars to attack 7 different towers. Each Burglar can only belong to one attack group and Brandon takes over a tower if the number of Burglars attacking the tower strictly exceeds the number of knights guarding it. He knows there the total number of knights guarding the towers is 99 but does not know the exact number of knights guarding each tower. What is the minimum number of Burglars that Brandon needs to guarantee he can take over at least 4 of the 7 towers?
[i]Proposed by Eric Wang[/i]
Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ :
$P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$
$n>1$
In-circle of $ABC$ with center $I$ touch $AB$ and $AC$ at $P$ and $Q$ respectively. $BI$ and $CI$ intersect $PQ$ at $K$ and $L$ respectively. Prove, that circumcircle of $ILK$ touch incircle of $ABC$ iff $|AB|+|AC|=3|BC|$.
Prove that the number $\left(\frac{76}{\frac{1}{\sqrt[3]{77}-\sqrt[3]{75}}-\sqrt[3]{5775}}+\frac{1}{\frac{76}{\sqrt[3]{77}+\sqrt[3]{75}}+\sqrt[3]{5775}}\right)^3$ is an integer.
Find all polynomials $P,Q\in \mathbb{R}[x]$, such that $P(2)=2$ , $Q(x)$ has no negative roots, and
$(x-2)P(x^2-1)Q(x+1)=P(x)Q(x^2 )+Q(x+1)$.
Ten coins of $1$ cm radius are placed around a circle as indicated in the figure.
Each coin is tangent to the circle and its two neighboring coins.
Prove that the sum of the areas of the ten coins is twice the area of the circle.
[img]https://cdn.artofproblemsolving.com/attachments/5/e/edf7a7d39d749748f4ae818853cb3f8b2b35b5.gif[/img]
Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.
Let $n$ be a fixed positive integer. Which is greater?[list=1]
[*]The number of $n$-tuples of integers whose largest value is $7$ and whose smallest value
is $0$; or
[*]The number of ordered triples $(A, B, C)$ that satisfy the following property: $A$, $B$, $C$
are subsets of $\{1, 2, 3, \dots , n\}$, and neither $C\subseteq A\cup B$, nor $B\subseteq A\cup C$.
[/list]
Your answer can be: $(1)$, $(2)$, the two counts are equal, or it depends on $n$.
If $a$, $b$ ,$c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that \[ \sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}. \]
Let $a,b,c\in\mathbb R_+$ satisfy that
$$\sqrt{(1+a)(1+b)(1+c)}=\sqrt{(ab-a-b+1)(1+c)}+\sqrt{(bc-b-c+1)(1+a)}+\sqrt{(ca-c-a+1)(1+b)}.$$
Find the value range of $a+b+c.$
Consider five points in the plane, no three collinear. The convex hull of this points has area $S$. Prove that there exist three points of them that form a triangle with area at most $\frac{5-\sqrt 5}{10}S$
Determine all ordered pairs $(x, y)$ of nonnegative integers that satisfy the equation $$3x^2 + 2 \cdot 9^y = x(4^{y+1}-1).$$
Construct a triangle $ABC$ given angle $A$ and the medians drawn from vertices $B$ and $C$.
Let $ x,y,z\in\mathbb R^{\plus{}}$ and $ x\plus{}y\plus{}z\equal{}3$. Prove that:
\[ \frac{x^3}{y^3\plus{}8}\plus{}\frac{y^3}{z^3\plus{}8}\plus{}\frac{z^3}{x^3\plus{}8}\geq\frac19\plus{}\frac2{27}(xy\plus{}xz\plus{}yz)\]
Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, $n^p -p$ is not divisible by $q$.
Let $VWXYZ$ be a square pyramid with vertex $V$ with height $1$, and with the unit square as its base. Let $STANFURD$ be a cube, such that face $FURD$ lies in the same plane as and shares the same center as square face $WXYZ$. Furthermore, all sides of $FURD$ are parallel to the sides of $WXY Z$. Cube $STANFURD$ has side length $s$ such that the volume that lies inside the cube but outside the square pyramid is equal to the volume that lies inside the square pyramid but outside the cube. What is the value of $s$?
Let $a, b$ and $c$ be positive integers such that $1 < a < b < c$. Suppose that $(ab-l)(bc-1 )(ca-1)$ is divisible by $abc$. Find the values of $a, b$ and $c$. Justify your answer.
Let $n$ be a positive integer. Find all functions $f\colon \mathbb{R}\rightarrow \mathbb{R}$ that satisfy the equation
$$
(f(x))^n f(x+y) = (f(x))^{n+1} + x^n f(y)
$$
for all $x ,y \in \mathbb{R}$.
Using the letters $ A$, $ M$, $ O$, $ S$, and $ U$, we can form $ 120$ five-letter "words". If these "words" are arranged in alphabetical order, then the "word" $ USAMO$ occupies position
$ \textbf{(A)}\ 112 \qquad
\textbf{(B)}\ 113 \qquad
\textbf{(C)}\ 114 \qquad
\textbf{(D)}\ 115 \qquad
\textbf{(E)}\ 116$
What is the total number of natural numbes divisible by 9 the number of digits of which does not exceed 2008 and at least two of the digits are 9s?