Found problems: 85335
Determine all functions $f : \mathbb{R} - [0,1] \to \mathbb{R}$ such that \[ f(x) + f \left( \dfrac{1}{1-x} \right) = \dfrac{2(1-2x)}{x(1-x)} . \]
We call a bar of width ${w}$ on the surface of the unit sphere ${\Bbb{S}^2}$, a spherical segment, centered at the origin, which has width ${w}$ and is symmetric with respect to the origin.
Prove that there exists a constant ${c>0}$, such that for any positive integer ${n}$ the surface ${\Bbb{S}^2}$ can be covered with ${n}$ bars of the same width so that any point is contained in no more than ${c\sqrt{n}}$ bars.
Let $N$ be a positive integer; a divisor of $N$ is called [i]common[/i] if it's great than $1$ and different of $N$. A positive integer is called [i]special[/i] if it has, at least, two common divisors and it is multiple of all possible differences between any two of their common divisors.
Find all special integers.
Let $\mathbb{N}$ denote the set of all positive integers.Function $f:\mathbb{N}\cup{0}\rightarrow\mathbb{N}\cup{0}$ satisfies :for any two distinct positive integer $a,b$, we have $$f(a)+f(b)-f(a+b)=2019$$
(1)Find $f(0)$
(2)Let $a_1,a_2,...,a_{100}$ be 100 positive integers (they are pairwise distinct), find $f(a_1)+f(a_2)+...+f(a_{100})-f(a_1+a_2+...+a_{100})$
Prove that for every integer $n\ge 3$ there exists $N(n)$ with the following property: whenever $P$ is a set of at least $N(n)$ points of the plane such that any three points of $P$ determines a nondegenerate triangle containing at most one point of $P$ in its interior, then $P$ contains the vertices of a convex $n$-gon whose interior does not contain any point of $P$.
Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.
The infinite sequence of integers $a_1, a_2, \cdots $ is defined recursively as follows: $a_1 = 3$, $a_2 = 7$, and $a_n$ equals the alternating sum
$$a_1 - 2a_2 + 3a_3 - 4a_4 + \cdots (-1)^n \cdot (n-1)a_{n-1}$$
for all $n > 2$. Let $a_x$ be the smallest positive multiple of $1090$ appearing in this sequence. Find the remainder of $a_x$ when divided by $113$.
Find all non decreasing function $f : \mathbb{R} \to \mathbb{R}$ such that for all $x,y \in \mathbb{R}$ and $m,n \in \mathbb{N}_0$ such that $m+n \neq 0$ there exist $m',n' \in \mathbb{N}_0$ such that $m'+n'=m+n+1$ and $$f(f^m(x)+f^n(y))=f^{m'}(x)+f^{n'}(y)$$ . Note : $f^0(x)=x$ and $f^{n}(x)=f(f^{n-1}(x))$ for all $n \in \mathbb{N}$ . [hide=original]Find all non decreasing functions $f \colon \mathbb{R} \to \mathbb{R}$ such that for all $x,y \in \mathbb{R}$
$$ f(x+f(y))=f(x)+f(y) \text{ or } f(f(x))+y$$ .[/hide]
Let $A$, $B$, $C$, $D$ be four points in the plane, with $C$ and $D$ on the same side of the line $AB$, such that $AC \cdot BD = AD \cdot BC$ and $\angle ADB = 90^{\circ}+\angle ACB$. Find the ratio
\[\frac{AB \cdot CD}{AC \cdot BD}, \]
and prove that the circumcircles of the triangles $ACD$ and $BCD$ are orthogonal. (Intersecting circles are said to be orthogonal if at either common point their tangents are perpendicuar. Thus, proving that the circumcircles of the triangles $ACD$ and $BCD$ are orthogonal is equivalent to proving that the tangents to the circumcircles of the triangles $ACD$ and $BCD$ at the point $C$ are perpendicular.)
Let $\triangle ABC$ be acute with $\angle BAC = 45^{\circ}$. Let $\overline{AD}$ be an altitude of $\triangle ABC$, let $E$ be the midpoint of $\overline{BC}$, and let $F$ be the midpoint of $\overline{AD}$. Let $O$ be the center of the circumcircle of $\triangle ABC$, let $K$ be the intersection of lines $DO$ and $EF$, and let $L$ be the foot of the perpendicular from $O$ to line $AK$. If $BL = 6$ and $CL = 8$, find $AL^2$.
[i]Proposed by [b]Awesome_guy[/b][/i]
Evaluate $$\sum_{k=0}^n (-1)^k \binom{n}{k} (x-k)^n.$$
You are walking along a road of constant width with sidewalks on each side. You can only walk on the sidewalks or cross the road perpendicular to the sidewalk. Coming up on a turn, you realize that you are on the “outside” of the turn; i.e., you are taking the longer way around the turn. The turn is a circular arc. Assuming that your destination is on the same side of the road as you are currently, let $\theta$ be the smallest turn angle, in radians, that would justify crossing the road and then crossing back after the turn to take the shorter total path to your destination. What is $\lfloor 100 \cdot \theta \rfloor$ ?
Prove that \[ \frac{a}{b+2c+3d} +\frac{b}{c+2d+3a} +\frac{c}{d+2a+3b}+ \frac{d}{a+2b+3c} \geq \frac{2}{3} \] for all positive real numbers $a,b,c,d$.
Prove that the for all $n>1000$, we can arrange the number $1,2,\dots, \binom{n}{2}$ on edges of a complete graph with $n$ vertices so that the sum of the numbers assigned to edges of any length three path (possibly closed) is not less than $3n-1000log_2log_2 n$.
Let $p$ be a prime number bigger than $5$. Suppose, the decimal expansion of $\frac{1}{p}$ looks like $0.\overline{a_1a_2\cdots a_r}$ where the line denotes a recurring decimal. Prove that $10^r$ leaves a remainder of $1$ on dividing by $p$.
The audience chooses two of five cards, numbered from $1$ to $5$ respectively. The assistant of a magician chooses two of the remaining three cards, and asks a member of the audience to take them to the magician, who is in another room. The two cards are presented to the magician in arbitrary order. By an arrangement with the assistant beforehand, the magician is able to deduce which two cards the audience has chosen only from the two cards he receives. Explain how this may be done.
A square is divided into $25$ unit squares by drawing lines parallel to the sides of the square. Some diagonals of unit squares are drawn from such that two diagonals do not share points. What is the maximum number diagonals that can be drawn with this property?
Let be given $a\in\{0,1,2, 3,..., 100\}.$
Find all $n \in\{1,2, 3,..., 2013\}$ such that $C_n^{2013} > C_a^{2013}$ , where $C_k^m=\frac{m!}{k!(m -k)!}$.
$z_1,z_2$ are complex numbers. $|z_1|=3,|z_2|=5,|z_1+z_2|=7$, then $\arg(\frac{z_2}{z_1})^3=$________.
Consider the segment $[0; 1]$. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed $1/2$.
[i]Mikhail Lukin[/i]
Evaluate the following integrals.
(1) $\int_0^{\pi} \cos mx\cos nx\ dx\ (m,\ n=1,\ 2,\ \cdots).$
(2) $\int_1^3 \left(x-\frac{1}{x}\right)(\ln x)^2dx.$
Let be given $32$ positive integers with the sum $120$, none of which is greater than $60.$ Prove that these integers can be divided into two disjoint subsets with the same sum of elements.
Let $p$ be a real number and $f(x)=x^p-x+p$. Prove that:
(a) Every root $\alpha$ of $f(x)$ satisfies $|\alpha|<p^{\frac1{p-1}}$;
(b) If $p$ is a prime number, then $f(x)$ cannot be written as the product of two non-constant polynomials with integer coefficients.
Derek and Julia are two of 64 players at a casual basketball tournament. The players split up into 8 teams of 8 players at random. Each team then randomly selects 2 captains among their players. What is the probability that both Derek and Julia are captains?
Consider a sequence of numbers $(a_1, a_2, \ldots , a_{2^n}).$ Define the operation
\[S\biggl((a_1, a_2, \ldots , a_{2^n})\biggr) = (a_1a_2, a_2a_3, \ldots , a_{2^{n-1}a_{2^n}, a_{2^n}a_1).}\]
Prove that whatever the sequence $(a_1, a_2, \ldots , a_{2^n})$ is, with $a_i \in \{-1, 1\}$ for $i = 1, 2, \ldots , 2^n,$ after finitely many applications of the operation we get the sequence $(1, 1, \ldots, 1).$