Found problems: 85335
There are $n\geq2$ weights such that each weighs a positive integer less than $n$ and their total weights is less than $2n$. Prove that there is a subset of these weights such that their total weights is equal to $n$.
Given that the $32$-digit integer $$64 \ 312 \ 311 \ 692 \ 944 \ 269 \ 609 \ 355 \ 712 \ 372 \ 657$$ is the product of $6$ consecutive primes, compute the sum of these $6$ primes.
A polyhedron is circumscribed around a sphere. Let's call its face [i]large [/i] if the projection of the sphere onto the plane of the face falls entirely within the face. Prove that there are no more than 6 large faces.
An arithmetic progression of natural numbers of length $10$ and with difference $11$ is given. Prove that the product of the numbers in this progression is divisible by $10!$.
For every $m \geq 2$, let $Q(m)$ be the least positive integer with the following property: For every $n \geq Q(m)$, there is always a perfect cube $k^3$ in the range $n < k^3 \leq m \cdot n$. Find the remainder when
\[ \sum_{m = 2}^{2017} Q(m) \]
is divided by 1000.
Consider circle inscribed quadriateral $ABCD$. Let $M,N,P,Q$ be midpoints of sides $DA,AB,BC,CD$.Let $E$ be the point of intersection of diagonals. Let $k1,k2$ be circles around $EMN$ and $EPQ$ . Let $F$ be point of intersection of $k1$ and $k2$ different from $E$. Prove that $EF$ is perpendicular to $AC$.
How many different $4\times 4$ arrays whose entries are all 1's and -1's have the property that the sum of the entries in each row is 0 and the sum of the entires in each column is 0?
Find all real numbers $a$ for which the following equation has a unique real solution:
$$|x-1|+|x-2|+\ldots+|x-99|=a.$$
Let $a_1,\ldots,a_n\ (n>2)$ be real numbers with at most one zero. Solve the system
\begin{align*}
x_1x_2 &= a_1, \\
x_2x_3 &= a_2, \\
&\ \vdots \\
x_{n-1}x_n &= a_{n-1}, \\
x_nx_1 &\ge a_n.
\end{align*}
A circle $\omega$ touched lines $a$ and $b$ at points $A$ and $B$ respectively. An arbitrary tangent to the circle meets $a$ and $b$ at $X$ and $Y$ respectively. Points $X'$ and $Y'$ are the reflections of $X$ and $Y$ about $A$ and $B$ respectively. Find the locus of projections of the center of the circle to the lines $X'Y'$.
Positive real numbers $a, b, c$ satisfy $\frac{1}{a} +\frac{1}{b} +\frac{1}{c} = 3.$ Prove the inequality \[\frac{1}{\sqrt{a^3+ b}}+\frac{1}{\sqrt{b^3 + c}}+\frac{1}{\sqrt{c^3 + a}}\leq \frac{3}{\sqrt{2}}.\]
Prove that for each positive integer $n$
\[\frac{4n^2+1}{4n^2-1}\int_0^{\pi} (e^{x}-e^{-x})\cos 2nx\ dx>\frac{e^{\pi}-e^{-\pi}-2}{4}\ln \frac{(2n+1)^2}{(2n-1)(n+3)}.\]
Let the continuous functions $ f_n(x), \; n\equal{}1,2,3,...,$ be defined on the interval $ [a,b]$ such that every point of $ [a,b]$ is a root of $ f_n(x)\equal{}f_m(x)$ for some $ n \not\equal{} m$. Prove that there exists a subinterval of $ [a,b]$ on which two of the functions are equal.
Find all solutions in integers $m,n$ of the equation \[ (m-n)^2 = \frac{4mn}{ m+n-1}. \]
Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.
One can holds $ 12$ ounces of soda. What is the minimum number of cans to provide a gallon ($ 128$ ounces) of soda?
$ \textbf{(A)}\ 7 \qquad
\textbf{(B)}\ 8 \qquad
\textbf{(C)}\ 9 \qquad
\textbf{(D)}\ 10 \qquad
\textbf{(E)}\ 11$
Let $ABC$ is triangle and $D \in AB$,$E \in AC$ such that $DE//BC$. Let $(ABC)$ meets with $(BDE)$ and $(CDE)$ at the second time $K,L$ respectively. $BK$ and $CL$ intersect at $T$. Prove that $TA$ is tangent to the $(ABC)$
Prove that there exists and infinity of multiples of $1997$ that have $1998$ as first four digits and last four digits.
In lawn-tennis the player who scores at least four points, while his opponent scores at least two points less, wins a game. The player who wins at least six games, while his opponent wins at least two games less, wins a set. What minimum percentage of all points does the winner have to score in a set?
Let $\Gamma$ be a circle centered at $O$ with chord $AB$. The tangents to $\Gamma$ at $A$ and $B$ meet at $C$. A secant from $C$ intersects chord $AB$ at $D$ and $\Gamma$ at $E$ such that $D$ lies on segment $CE$. Given that $\angle BOD + \angle EAD = 180^\circ$, $AE = 1$, and $BE = 2$, find $CE$.
Let $ABC$ be the triangle with $\angle ABC = 76^o$ and $\angle ACB = 72^o$. Points $P$ and $Q$ lie on the sides $(AB)$ and $(AC)$, respectively, such that $\angle ABQ = 22^o$ and $\angle ACP = 44^o$. Find the measure of angle $\angle APQ$.
Ann and Barbara were comparing their ages and found that Barbara is as old as Ann was when Barbara was as old as Ann had been when Barbara was half as old as Ann is. If the sum of their present ages is $44$ years, then Ann's age is
$\textbf{(A) }22\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad \textbf{(E) }28$
Let $n\ge 2$ be a positive integer. Find the positive integers $x$
\[\sqrt{x+\sqrt{x+\ldots +\sqrt{x}}}<n \]
for any number of radicals.
a) We are given $n$ circles $O_1, O_2, . . . , O_n$, passing through one point $O$. Let $A_1, . . . , A_n$ denote the second intersection points of $O_1$ with $O_2, O_2$ with $O_3$, etc., $O_n$ with $O_1$, respectively. We choose an arbitrary point $B_1$ on $O_1$ and draw a line segment through $A_1$ and $B_1$ to the second intersection with $O_2$ at $B_2$, then draw a line segment through $A_2$ and $B_2$ to the second intersection with $O_3$ at $B_3$, etc., until we get a point $B_n$ on $O_n$. We draw the line segment through $B_n$ and $A_n$ to the second intersection with $O_1$ at $B_{n+1}$. If $B_k$ and $A_k$ coincide for some $k$, we draw the tangent to $O_k$ through $A_k$ until this tangent intersects $O_{k+1}$ at $B_{k+1}$. Prove that $B_{n+1}$ coincides with $B_1$.
b) for $n=3$ the same problem.
A certain island has some ports along the coast and some towns inland. All roads on this island are one-way, and they do not meet except at a port or a town. Moreover, once you leave a certain port or town by road, there is no way you can return there by road. For any two ports $i$ and $j$, let $f_{ij}$ denote the number of different routes along the roads between $i$ and $j$.
(a) Suppose there are four ports on the island: $1, 2, 3$ and $4$, in clockwise order. Show that $$f_{14}f_{23} \ge f_{13}f_{24}$$
(b) Suppose there were six ports on the island: $1, 2, 3, 4, 5$ and $6$, in clockwise order. Show that
$$f_{16}f_{25}f_{34} + f_{15}f_{24}f_{36} + f_{14}f_{26}f_{35}\ge f_{16}f_{24}f_{35}+ f_{15}f_{26}f_{34} + f_{14}f_{25}f_{36}$$
(S Fomin}