Found problems: 85335
A rectangular yard contains two flower beds in the shape of congruent isosceles right triangles. THe remainder of the yard has a trapezoidal shape, as shown. The parallel sides of the trapezoid have lengths $ 15$ and $ 25$ meters. What fraction of the yard is occupied by the flower beds?
[asy]unitsize(2mm);
defaultpen(linewidth(.8pt));
fill((0,0)--(0,5)--(5,5)--cycle,gray);
fill((25,0)--(25,5)--(20,5)--cycle,gray);
draw((0,0)--(0,5)--(25,5)--(25,0)--cycle);
draw((0,0)--(5,5));
draw((20,5)--(25,0));[/asy]$ \textbf{(A)}\ \frac18\qquad
\textbf{(B)}\ \frac16\qquad
\textbf{(C)}\ \frac15\qquad
\textbf{(D)}\ \frac14\qquad
\textbf{(E)}\ \frac13$
[list]
(a) Consider an ellipse in the plane. Prove that there exists a Riemannian metric which is defined on the whole plane, and with respect to which the ellipse is a geodesic. Prove that the Gaussian curvature of any such Riemannian metric takes a positive value.
(b) Consider two nonintersecting, simple closed smooth curves in the plane. Prove that if there is a Riemmanian metric defined on the whole plane and the two curves are geodesics of that metric, then the Gaussian curvature of the metric vanishes somewhere.
[/list]
[i]Proposed by Tran Quoc Binh[/i]
Alice and Bob are each secretly given a real number between 0 and 1 uniformly at random. Alice states, “My number is probably greater than yours.” Bob repudiates, saying, “No, my number is probably greater than yours!” Alice concedes, muttering, “Fine, your number is probably greater than mine.” If Bob and Alice are perfectly reasonable and logical, what is the probability that Bob’s number is actually greater than Alice’s?
$\triangle ABC$ has area $240$. Points $X, Y, Z$ lie on sides $AB$, $BC$, and $CA$, respectively. Given that $\frac{AX}{BX} = 3$, $\frac{BY}{CY} = 4$, and $\frac{CZ}{AZ} = 5$, find the area of $\triangle XYZ$.
[asy]
size(175);
defaultpen(linewidth(0.8));
pair A=(0,15),B=(0,-5),C=(25,0.5),X=origin,Y=(4C+B)/5,Z=(5A+C)/6;
draw(A--B--C--cycle^^X--Y--Z--cycle);
label("$A$",A,N);
label("$B$",B,S);
label("$C$",C,E);
label("$X$",X,W);
label("$Y$",Y,S);
label("$Z$",Z,NE);[/asy]
Let $ f(x)$ be a polynomial with integer coefficients and let $ p$ be a prime. Denote by $ z_1,...,z_{p\minus{}1}$ the $ (p\minus{}1)$th complex roots of unity. Prove that
$ f(z_1)\cdots f(z_{p\minus{}1})\equiv f(1)\cdots f(p\minus{}1) \pmod{p}$.
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
x,y are real numbers different from 0 such that :$x^3+y^3+3x^2y^2=x^3y^3$
Find all possible values of E=$\dfrac{1}{x}+\dfrac{1}{y}$
Four lighthouses are located at points $ A$, $ B$, $ C$, and $ D$. The lighthouse at $ A$ is $ 5$ kilometers from the lighthouse at $ B$, the lighthouse at $ B$ is $ 12$ kilometers from the lighthouse at $ C$, and the lighthouse at $ A$ is $ 13$ kilometers from the lighthouse at $ C$. To an observer at $ A$, the angle determined by the lights at $ B$ and $ D$ and the angle determined by the lights at $ C$ and $ D$ are equal. To an observer at $ C$, the angle determined by the lights at $ A$ and $ B$ and the angle determined by the lights at $ D$ and $ B$ are equal. The number of kilometers from $ A$ to $ D$ is given by $ \displaystyle\frac{p\sqrt{r}}{q}$, where $ p$, $ q$, and $ r$ are relatively prime positive integers, and $ r$ is not divisible by the square of any prime. Find $ p\plus{}q\plus{}r$,
Let $ a>1$ be a positive integer. Prove that every non-zero positive integer $ N$ has a multiple in the sequence $ (a_n)_{n\ge1}$, $ a_n\equal{}\left\lfloor\frac{a^n}n\right\rfloor$.
Let $ABCD$ be a cyclic quadrilateral with $AB = 1$, $BC = 2$, $CD = 3$, $DA = 4$. Find the square of the area of quadrilateral $ABCD$.
Let the circle $ (I; r)$ be inscribed in the triangle $ ABC$. Let $ D$ be the point of contact of this circle with $ BC$. Let $ E$ and $ F$ be the midpoints of $ BC$ and $ AD$, respectively. Prove that the three points $ I$, $ E$, $ F$ are collinear.
Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio $3: 2: 1$, what is the least possible total for the number of bananas?
A table with $m$ rows and $n$ columns is given. At any move one chooses some empty cells such that any two of them lie in different rows and columns, puts a white piece in any of those cells and then puts a black piece in the cells whose rows and columns contain white pieces. The game is over if it is not possible to make a move. Find the maximum possible number of white pieces that can be put on the table.
A rectangular sheet of paper is folded so that one corner lies on top of the corner diagonally opposite. The resulting shape is a pentagon whose area is $20\%$ one-sheet thick, and $80\%$ two-sheets-thick. Determine the ratio of the two sides of the original sheet of paper.
Find the minimum value of $\int_1^e \left|\ln x-\frac{a}{x}\right|dx\ (0\leq a\leq e)$
Consider a set of $n > 3$ points in the plane, no three of which are collinear, and a natural number $k < n$. Prove the following statements:
(a) If $k \le \frac{n}{2}$, then each point can be connected with at least k other points by segments so that no three segments form a triangle.
(b) If $k \ge \frac{n}{2}$, and each point is connected with at least k other points by segments, then some three segments form a triangle.
If an integer $n$ is such that $7n$ is the form $a^2 +3b^2$, prove that $n$ is also of that form.
For three positive integers $a,b$ and $c,$ if $\text{gcd}(a,b,c)=1$ and $a^2+b^2+c^2=2(ab+bc+ca),$ prove that all of $a,b,c$ is perfect square.
A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple $(s_1, \dots, s_k)$ of cells in a $n \times n$ grid of square unit cells. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. If the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead.
Determine whether there exists an integer $n > 1$ such that: one can place some snake of length $0.9n^2$ in an $n \times n$ grid which can turn around.
[i]Nikolai Beluhov[/i]
Find all functions $f: \mathbb R \to \mathbb R$ such that $$f(x+f(x+y))=x+f(f(x)+y)$$ holds for all real numbers $x$ and $y$.
In a checkered square $101 \times 101$, each cell of the inner square $99 \times 99$ is painted in one of ten colors (cells adjacent to the border of the square, not painted). Could it turn out that in every in a $3\times 3$ square, is exactly one more cell painted the same color as the central cell?
Let $S$ be a set containing $n^{2}+n-1$ elements, for some positive integer $n$. Suppose that the $n$-element subsets of $S$ are partitioned into two classes. Prove that there are at least $n$ pairwise disjoint sets in the same class.
Let $ABC$ be a triangle with $AB \ne AC$ and incenter $I$. The incircle touches $BC$ at $D$. Let $M$ be the midpoint of $BC$ . Show that the line $IM$ bisects segment $AD$ .
Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.
For a sequence $u_1,u_2\dots,$ define $\Delta^1(u_n)=u_{n+1}-u_n$ and, for all integer $k>1$, $\Delta^k(u_n)=\Delta^1(\Delta^{k-1}(u_n))$. If $u_n=n^3+n$, then $\Delta^k(u_n)=0$ for all $n$
$\textbf{(A) }\text{if }k=1\qquad$
$\textbf{(B) }\text{if }k=2,\text{ but not if }k=1\qquad$
$\textbf{(C) }\text{if }k=3,\text{ but not if }k=2\qquad$
$\textbf{(D) }\text{if }k=4,\text{ but not if }k=3\qquad$
$\textbf{(E) }\text{for no value of }k$