Found problems: 85335
A square has vertices $(0,10)$, $(0, 0)$, $(10, 0)$, and $(10,10)$ on the $x-y$ coordinate plane. A second quadrilateral is constructed with vertices $(0,10)$, $(0, 0)$, $(10, 0)$, and $(15,15)$. Find the positive difference between the areas of the original square and the second quadrilateral.
[i]Proposed byWilliam Hua[/i]
Let $a, b,$ and $c$ be non-zero real numbers and let $a \ge b \ge c$. Prove the inequality
$\frac{a^3 - c^3}{3} \ge abc (\frac{a- b}{c}+ \frac{b- c}{a})$ . When does equality hold?
The arithmetic mean (average) of a set of $50$ numbers is $38$. If two numbers, namely, $45$ and $55$, are discarded, the mean of the remaining set of numbers is:
$ \textbf{(A)}\ 36.5 \qquad\textbf{(B)}\ 37\qquad\textbf{(C)}\ 37.2\qquad\textbf{(D)}\ 37.5\qquad\textbf{(E)}\ 37.52 $
Consider the paths from $(0,0)$ to $(6,3)$ that only take steps of unit length up and right. Compute the sum of the areas bounded by the path, the $x$-axis, and the line $x = 6$ over all such paths.
(In particular, the path from $(0,0)$ to $(6,0)$ to $(6,3)$ corresponds to an area of $0.$)
For which integers $n \ge 2$ can we arrange numbers $1,2, \ldots, n$ in a row, such that for all integers $1 \le k \le n$ the sum of the first $k$ numbers in the row is divisible by $k$?
Let $ABC$ be a non-isosceles triangle. The altitude from $A$, the bisector from $B$ and the median from $C$ concur at point $K$.
a) Which of the sidelengths of the triangle is medial (intermediate in length)?
b) Which of the lengths of segments $AK, BK, CK$ is medial (intermediate in length)?
Find all primes $p \geq 3$ with the following property: for any prime $q<p$, the number
\[
p - \Big\lfloor \frac{p}{q} \Big\rfloor q
\]
is squarefree (i.e. is not divisible by the square of a prime).
Let $100$ discs lie on the plane in such a way that each two of them have a common point. Prove that there exists a point lying inside at least $15$ of these discs.
(M. Kharitonov, A. Polyansky)
Using each of the digits $1,2,3,\ldots ,8,9$ exactly once,we form nine,not necassarily distinct,nine-digit numbers.Their sum ends in $n$ zeroes,where $n$ is a non-negative integer.Determine the maximum possible value of $n$.
Given $n>4$, prove that every cyclic quadrilateral can be dissected into $n$ cyclic quadrilaterals.
It is known in Euclidean geometry that the sum of the angles of a triangle is constant. Prove, however, that the sum of the dihedral angles of a tetrahedron is not constant.
Let $ABC$ be an isosceles triangle with $AB = AC$. Let $AD$ be the diameter of the circumcircle of $ABC$ and let $P$ be a point on the smaller arc $BD$. The line $DP$ intersects the rays $AB$ and $AC$ at points $M$ and $N$, respectively. The line $AD$ intersects the lines $BP$ and $CP$ at points $Q$ and $R$, respectively. Prove that the midpoint of $MN$ lies on the circumcircle of $PQR$
Let $ABCD$ be a unit square. $E$ and $F$ trisect $AB$ such that $AE<AF. G$ and $H$ trisect $BC$ such that $BG<BH. I$ and $J$ bisect $CD$ and $DA,$ respectively. Let $HJ$ and $EI$ meet at $K,$ and let $GJ$ and $FI$ meet at $L.$ Compute the length $KL.$
Let $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that
\[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\]
[i]Proposed by Pavel Novotný, Slovakia[/i]
Positive real numbers $a,b,c$ satisfy $a+b+c=1$. Prove that
$$(a+1)\sqrt{2a(1-a)} + (b+1)\sqrt{2b(1-b)} + (c+1)\sqrt{2c(1-c)} \geq 8(ab+bc+ca).$$
Also, find the values of $a,b,c$ for which the equality happens.
We define $\mathbb F_{101}[x]$ as the set of all polynomials in $x$ with coefficients in $\mathbb F_{101}$ (the integers modulo $101$ with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of $x^k$ are equal in $\mathbb F_{101}$ for each nonnegative integer $k$. For example, $(x+3)(100x+5)=100x^2+2x+15$ in $\mathbb F_{101}[x]$ because the corresponding coefficients are equal modulo $101$.
We say that $f(x)\in\mathbb F_{101}[x]$ is \emph{lucky} if it has degree at most $1000$ and there exist $g(x),h(x)\in\mathbb F_{101}[x]$ such that \[f(x)=g(x)(x^{1001}-1)+h(x)^{101}-h(x)\] in $\mathbb F_{101}[x]$. Find the number of lucky polynomials.
[i]Proposed by Michael Ren.[/i]
An unfair coin, which has the probability of $a\ \left(0<a<\frac 12\right)$ for showing $Heads$ and $1-a$ for showing $Tails$, is flipped $n\geq 2$ times. After $n$-th trial, denote by $A_n$ the event that heads are showing on at least two times and by$B_n$ the event that are not showing in the order of $tails\rightarrow heads$, until the trials $T_1,\ T_2,\ \cdots ,\ T_n$ will be finished . Answer the following questions:
(1) Find the probabilities $P(A_n),\ P(B_n)$.
(2) Find the probability $P(A_n\cap B_n )$.
(3) Find the limit $\lim_{n\to\infty} \frac{P(A_n) P(B_n)}{P(A_n\cap B_n )}.$
You may use $\lim_{n\to\infty} nr^n=0\ (0<r<1).$
Island Hopping Holidays offer short holidays to $64$ islands, labeled Island $i, 1 \le i \le 64$. A guest chooses any Island $a$ for the fi rst night of the holiday, moves to Island $b$ for the second night, and finally moves to Island $c$ for the third night. Due to the limited number of boats, we must have $b \in T_a$ and $c \in T_b$, where the sets $T_i$ are chosen so that
(a) each $T_i$ is non-empty, and $i \notin T_i$,
(b) $\sum^{64}_{i=1} |T_i| = 128$, where $|T_i|$ is the number of elements of $T_i$.
Exhibit a choice of sets $T_i$ giving at least $63\cdot 64 + 6 = 4038$ possible holidays.
Note that c = a is allowed, and holiday choices $(a, b, c)$ and $(a',b',c')$ are considered distinct if $a \ne a'$ or $b \ne b'$ or $c \ne c'$.
(a) Prove that if the six dihedral (i.e. angles between pairs of faces) of a given tetrahedron are congruent, then the tetrahedron is regular.
(b) Is a tetrahedron necessarily regular if five dihedral angles are congruent?
In a group of $n$ people, each one had a different ball. They performed a sequence of swaps, in each swap, two people swapped the ball they had at that moment. Each pair of people performed at least one swap. In the end each person had the ball he/she had at the start. Find the least possible number of swaps, if:
a) $n = 5$,
b) $n = 6$.
$A,B,C$ are playing backgammon tournament. At first, $A$ plays with $B$. Then the winner plays with $C$. As the tournament goes on, the last winner plays with the player who did not play in the previous game. When a player wins two successive games, he will win the tournament. If each player has equal chance to win a game, what is the probability that $C$ wins the tournament?
$ \textbf{(A)}\ \frac27
\qquad\textbf{(B)}\ \frac13
\qquad\textbf{(C)}\ \frac3{14}
\qquad\textbf{(D)}\ \frac 17
\qquad\textbf{(E)}\ \text{None}
$
Let $PQRS$ be a square with side length 12. Point $A$ lies on segment $\overline{QR}$ with $\angle QPA = 30^\circ$, and point $B$ lies on segment $\overline{PQ}$ with $\angle SRB = 60^\circ$. What is $AB$?
Let $E$ be the projection of the vertex $C$ of a rectangle $ABCD$ to the diagonal $BD$. Prove that the common external tangents to the circles $AEB$ and $AED$ meet on the circle $AEC$.
Prove that a regular polygon with an odd number of edges cannot be partitioned into four pieces with equal areas by two lines that pass through the center of polygon.
Find all positive integers $n, n>1$ for wich holds :
If $a_1, a_2 ,\dots ,a_k$ are all numbers less than $n$ and relatively prime to $n$ , and holds $a_1<a_2<\dots <a_k $, then none of sums $a_i+a_{i+1}$ for $i=1,2,3,\dots k-1 $ are divisible by $3$.