Found problems: 85335
In a circumference of a circle, $ 10000$ points are marked, and they are numbered from $ 1$ to $ 10000$ in a clockwise manner. $ 5000$ segments are drawn in such a way so that the following conditions are met:
1. Each segment joins two marked points.
2. Each marked point belongs to one and only one segment.
3. Each segment intersects exactly one of the remaining segments.
4. A number is assigned to each segment that is the product of the number assigned to each end point of the segment.
Let $ S$ be the sum of the products assigned to all the segments.
Show that $ S$ is a multiple of $ 4$.
Choose a point $(x,y)$ in the square bounded by $(0,0), (0,1), (1,0)$ and $(1,1)$. Your score is the minimal distance from your point to any other team's submitted point. Your answer must be in the form $(0.abcd, 0.efgh)$ where $a, b, c, d, e, f, g, h$ are decimal digits.
Let $ABC$ be a triangle with $|AB| < |AC|$, where $| · |$ denotes length. Suppose $D, E, F$ are points on side $BC$ such that $D$ is the foot of the perpendicular on $BC$ from $A$, $AE$ is the angle bisector of $\angle BAC$, and $F$ is the midpoint of $BC$. Further suppose that $\angle BAD = \angle DAE = \angle EAF = \angle FAC$. Determine all possible values of $\angle ABC$.
The sequence $a_1, a_2,..., a_{2000}$ of real numbers satisfies the condition
\[a_1^3+a_2^3+...+a_n^3=(a_1+a_2+...+a_n)^2\]
for all $n$, $1\leq n \leq 2000$. Prove that every element of the sequence is an integer.
Let $S_n$ be the number of sequences $(a_1, a_2, \ldots, a_n),$ where $a_i \in \{0,1\},$ in which no six consecutive blocks are equal. Prove that $S_n \rightarrow \infty$ when $n \rightarrow \infty.$
Determine all functions $f : \mathbb R \to \mathbb R$ satisfying the following two conditions:
(a) $f(x + y) + f(x - y) = 2f(x)f(y)$ for all $x, y \in \mathbb R$, and
(b) $\lim_{x\to \infty} f(x) = 0$.
Two triangular pyramids have common base. One pyramid contains the other. Can the sum of the lengths of the edges of the inner pyramid be longer than that of the outer one?
Find all functions $ f: \mathbb{R} \to \mathbb{R}$ satisfying
\[ f\left(\frac {x \plus{} y}{x \minus{} y}\right) \equal{} \frac {f\left(x\right) \plus{} f\left(y\right)}{f\left(x\right) \minus{} f\left(y\right)}
\]
for all $ x \neq y$.
There are $2n+1$ segments on the line. Any segment intersects at with at least $n$ others. Prove that there is a segment that intersects all the others.
Let $S$ be a set of positive integers such that $\lfloor \sqrt{x}\rfloor =\lfloor \sqrt{y}\rfloor $ for all $x, y \in S$. Show that the products $xy$, where $x, y \in S$, are pairwise distinct.
Find the number of ways one can put numbers $1$ or $2$ in each cell of an $8\times 8$ chessboard in such a way that the sum of the numbers in each column and in each row is an odd number. (Two ways are considered different if the number in some cell in the first way is different from the number in the cell situated in the corresponding position in the second way)
Consider 2016 points arranged on a circle. We are allowed to jump ahead by 2 or 3 points in clockwise direction.
What is the minimum number of jumps required to visit all points and return to the starting point?
(Gerd Baron)
There are two paper figures: an equilateral triangle and a rectangle. The height of rectangle is equal to the height of the triangle and the base of the rectangle is equal to the base of the triangle. Divide the triangle into three parts and the rectangle into two, using straight cuts, so that with the five pieces can be assembled, without gaps or overlays, a equilateral triangle. To assemble the figure, each part can be rotated and / or turned around.
A player pays $ \$ 5$ to play a game. A die is rolled. If the number on the die is odd, the game is lost. If the number on the die is even, the die is rolled again. In this case the player wins if the second number matches the first and loses otherwise. How much should the player win if the game is fair? (In a fair game the probability of winning times the amount won is what the player should pay.)
$ \textbf{(A) } \$ 12 \qquad \textbf{(B) } \$ 30 \qquad \textbf{(C) } \$ 50\qquad \textbf{(D) } \$ 60 \qquad \textbf{(E) } \$ 100$
Let $S$ be a subset of the real numbers with the following
properties:
$(i)$ If $x \in S$ and $y \in S$, then $x - y \in S$;
$(ii)$ If $x \in S$ and $y \in S$, then $xy \in S$;
$(iii)$ $S$ contains an exceptional number $x'$ such that there is no number $y$ in $S$ satisfying $x'y + x' + y = 0$;
$(iv)$ If $x \in S$ and $x \neq x'$ , there is a number $y$ in $S$ such that $xy+x+y = 0$.
Show that
$(a)$ $S$ has more than one number in it;
$(b)$ $x' \neq -1$ leads to a contradiction;
$(c)$ $x \in S$ and $x \neq 0$ implies $1/x \in S$.
Given a circle of radius 2, there are many line segments of length 2 that are tangent to the circle at their midpoints. Find the area of the region consisting of all such line segments.
$\text{(A)}\ \frac \pi 4 \qquad \text{(B)}\ 4 - \pi \qquad \text{(C)}\ \frac \pi 2 \qquad \text{(D)}\ \pi \qquad \text{(E)}\ 2\pi$
Players $A$ and $B$ play a game on a blackboard that initially contains 2020 copies of the number 1 . In every round, player $A$ erases two numbers $x$ and $y$ from the blackboard, and then player $B$ writes one of the numbers $x+y$ and $|x-y|$ on the blackboard. The game terminates as soon as, at the end of some round, one of the following holds:
[list]
[*] $(1)$ one of the numbers on the blackboard is larger than the sum of all other numbers;
[*] $(2)$ there are only zeros on the blackboard.
[/list]
Player $B$ must then give as many cookies to player $A$ as there are numbers on the blackboard. Player $A$ wants to get as many cookies as possible, whereas player $B$ wants to give as few as possible. Determine the number of cookies that $A$ receives if both players play optimally.
How many non-isomorphic graphs with $9$ vertices, with each vertex connected to exactly $6$ other vertices, are there? (Two graphs are isomorphic if one can relabel the vertices of one graph to make all edges be exactly the same.)
[b]Problem 1.[/b] Points $D$ and $E$ are chosen on the sides $AB$ and $AC$, respectively, of a triangle $\triangle ABC$ such that $DE\parallel BC$. The circumcircle $k$ of triangle $\triangle ADE$ intersects the lines $BE$ and $CD$ at the points $M$ and $N$ (different from $E$ and $D$). The lines $AM$ and $AN$ intersect the side $BC$ at points $P$ and $Q$ such that $BC=2\cdot PQ$ and the point $P$ lies between $B$ and $Q$. Prove that the circle $k$ passes through the point of intersection of the side $BC$ and the angle bisector of $\angle BAC$.
[i]Nikolai Nikolov[/i]
a. Prove that there are infinitely many positive integers $t$ such that both $2012t+1$ and $2013t+1$ are perfect squares.
b. Suppose that $m,n$ are positive integers such that both $mn+1$ and $mn+n+1$ are perfect squares. Prove that $8(2m+1)$ divides $n$.
Is there a circle which passes through five points with integer co-ordinates?
Andy creates a 3 sided dice with a side labeled $7$, a side labeled $17$, and a side labeled $27$. He then asks Anthony to roll the dice $3$ times. The probability that the product of Anthony's rolls is greater than $2023$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
[i]Proposed by Andy Xu[/i]
Prove that for all positive real numbers $a,b,c$, \[ \frac{a}{\sqrt{a^2 + 8bc}} + \frac{b}{\sqrt{b^2 + 8ca}} + \frac{c}{\sqrt{c^2 + 8ab}} \geq 1. \]
In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a [i]clique[/i] if each two of them are friends. (In particular, any group of fewer than two competitiors is a clique.) The number of members of a clique is called its [i]size[/i].
Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged into two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.
[i]Author: Vasily Astakhov, Russia[/i]
Let there be a scalene triangle $ABC$, and denote $M$ by the midpoint of $BC$. The perpendicular bisector of $BC$ meets the circumcircle of $ABC$ at point $P$, on the same side with $A$ with respect to $BC$. Let the incenters of $ABM$ and $AMC$ be $I,J$, respectively. Let $\angle BAC=\alpha$, $\angle ABC=\beta$, $\angle BCA=\gamma$. Find $\angle IPJ$.