Found problems: 85335
Some people know each other in a group of people, where "knowing" is a symmetric relation. For a person, we say that it is $social$ if it knows at least $20$ other persons and at least $2$ of those $20$ know each other. For a person, we say that it is $shy$ if it doesn't know at least $20$ other persons and at least $2$ of those $20$ don't know each other. Find the maximal number of people in that group, if we know that group doesn't have any $social$ nor $shy$ persons.
Given an equilateral triangle $ABC$ and a point $P$ so that the distances $P$ to $A$ and to $C$ are not farther than the distances $P$ to $B$. Prove that $PB = PA + PC$ if and only if $P$ lies on the circumcircle of $\vartriangle ABC$.
Let $ABC$ be an acute triangle with $\angle C>\angle B$. Let $D$ be a point on $BC$ such that $\angle ADB$ is obtuse, and let $H$ be the orthocentre of triangle $ABD$. Suppose that $F$ is a point inside triangle $ABC$ that is on the circumcircle of triangle $ABD$. Prove that $F$ is the orthocenter of triangle $ABC$ if and only if $HD||CF$ and $H$ is on the circumcircle of triangle $ABC$.
Let $n,k,m$ be positive integers, where $k\ge 2$ and $n\le m < \frac{2k-1}{k}n$. Let $A$ be a subset of $\{1,2,\ldots ,m\}$ with $n$ elements. Prove that every integer in the range $\left(0,\frac{n}{k-1}\right)$ can be expressed as $a-b$, where $a,b\in A$.
Jared has 3 distinguishable Rolexes. Each day, he selects a subset of his Rolexes and wears them on his arm (the order he wears them does not matter). However, he does not want to wear the same Rolex 2 days in a row. How many ways can he wear his Rolexes during a 6 day period?
Find all real $x$ in the interval $[0, 2\pi)$ such that
\[27 \cdot 3^{3 \sin x} = 9^{\cos^2 x}.\]
Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.
Consider an acute-angled triangle $ABC$. Let $P$ be the foot of the altitude of triangle $ABC$ issuing from the vertex $A$, and let $O$ be the circumcenter of triangle $ABC$. Assume that $\angle C \geq \angle B+30^{\circ}$. Prove that $\angle A+\angle COP < 90^{\circ}$.
Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)
The points $A$ and $P$ are marked on the plane. Consider all such points $B, C $ of this plane that $\angle ABP = \angle MAB$ and $\angle ACP = \angle MAC $, where $M$ is the midpoint of the segment $BC$. Prove that all the circumscribed circles around the triangle $ABC$ for different points $B$ and $C$ pass through some fixed point other than the point $A$.
(Alexei Klurman)
Let $a$ and $b$ be positive integers such that $(2a+b)(2b+a)=4752$. Find the value of $ab$.
[i]Proposed by James Lin[/i]
The six faces of a hexahedron are quadrilaterals. Prove that if seven its vertices lie on a sphere, then the eighth vertex also lies on the sphere.
Find the largest real number $c$ such that $$\sum_{i=1}^{n}\sum_{j=1}^{n}(n-|i-j|)x_ix_j \geq c\sum_{j=1}^{n}x^2_i$$
for any positive integer $n $ and any real numbers $x_1,x_2,\dots,x_n.$
Do there exist a set $A\subset [0,1]$ such that
$(a)$ $A$ is a finite union of segments of total length $\frac{1}{2}$,
$(b)$ The symmetric difference of $A$ and $B:=A/2\cup(A/2+1/2)$ is a union of segments of the total length less than $\frac{1}{10000}$?
Consider three parallelograms $P_1,~P_2,~ P_3$. Parallelogram $P_3$ is inside parallelogram $P_2$, and the vertices of $P_3$ are on the edges of $P_2$. Parallelogram $P_2$ is inside parallelogram $P_1$, and the vertices of $P_2$ are on the edges of $P_1$. The sides of $P_3$ are parallel to the sides of $P_1$. Prove that one side of $P_3$ has length at least half the length of the parallel side of $P_1$.
Let $a(x)$ and $b(x)$ be continuous functions on $[0,1]$ and let $0 \leq a(x) \leq a <1$ on that range. Under what other conditions (if any) is the solution of the equation for $u,$
$$ u= \max_{0 \leq x \leq 1} b(x) +a(x)u$$
given by
$$u = \max_{0 \leq x \leq 1} \frac{b(x)}{1-a(x)}.$$
In space there are given four distinct points $ A $, $ B $, $ C $, $ D $. Prove that the three segments connecting the midpoints of the segments $ AB $ and $ CD $, $ AC $ and $ BD $, $ AD $ and $ BC $ have a common midpoint.
Let $A, B \in M_2(\mathbb{R})$ such as $det(AB+BA)\leq 0$. Prove that $$det(A^2+B^2)\geq 0$$
Positive numbers $x, y, z$ satisfy $x^2+y^2+z^2+xy+yz+zy \le 1$.
Prove that $\big( \frac{1}{x}-1\big) \big( \frac{1}{y}-1\big)\big( \frac{1}{z}-1\big) \ge 9 \sqrt6 -19$.
On a circle $O$ with radius $\overline{OA}$, points $B$ and $C$ are drawn such that $\angle AOC = \angle BOA = 30^\circ$, as shown. A second circle passing through $B$, $C$, and the midpoint of $\overline{OA}$ is drawn. The ratio of the radius of this new circle to the radius of circle $O$ can be expressed in the form $\tfrac{a \sqrt 3 - b}{c}$ where $a$, $b$, and $c$ are positive integers and $c$ is as small as possible. What is $a + b + c$?
[asy]
size(100);
pair O,A,B,C;
O = (0,0);
label("$O$",O,W);
A = (2,0);
label("$A$",A,E);
B = (sqrt(3),1);
label("$B$",B,N*1.8);
C = (sqrt(3),-1);
label("$C$",C,S*1.8);
draw(Circle(O,2));
dot((1,0)^^A^^B^^C^^O);
draw(O--B);
draw(O--C);
draw(O--A);
draw(Circle((2.04904,0),1.04904),dashed);
[/asy]
[center]Note: In the diagram, $A$ is not necessarily the center of the second circle.[/center]
$\textbf{(A) }10\qquad\textbf{(B) }12\qquad\textbf{(C) }15\qquad\textbf{(D) }21\qquad\textbf{(E) }27$
Prove that there is no function $f: \mathbb{Z}\to\mathbb{Z}$ such that $f(f(x))=x+1$, for all $x\in\mathbb{Z}$.
Point $O$ is the center of the regular octagon $ABCDEFGH$, and $X$ is the midpoint of the side $\overline{AB}.$ What fraction of the area of the octagon is shaded?
$\textbf{(A) }\frac{11}{32} \qquad\textbf{(B) }\frac{3}{8} \qquad\textbf{(C) }\frac{13}{32} \qquad\textbf{(D) }\frac{7}{16}\qquad \textbf{(E) }\frac{15}{32}$
[asy]
pair A,B,C,D,E,F,G,H,O,X;
A=dir(45);
B=dir(90);
C=dir(135);
D=dir(180);
E=dir(-135);
F=dir(-90);
G=dir(-45);
H=dir(0);
O=(0,0);
X=midpoint(A--B);
fill(X--B--C--D--E--O--cycle,rgb(0.75,0.75,0.75));
draw(A--B--C--D--E--F--G--H--cycle);
dot("$A$",A,dir(45));
dot("$B$",B,dir(90));
dot("$C$",C,dir(135));
dot("$D$",D,dir(180));
dot("$E$",E,dir(-135));
dot("$F$",F,dir(-90));
dot("$G$",G,dir(-45));
dot("$H$",H,dir(0));
dot("$X$",X,dir(135/2));
dot("$O$",O,dir(0));
draw(E--O--X);
[/asy]
A dragon gave a captured knight $100$ coins. Half of them are magical, but only dragon knows which are. Each day, the knight should divide the coins into two piles (not necessarily equal in size). The day when either magic coins or usual coins are spread equally between the piles, the dragon set the knight free. Can the knight guarantee himself a freedom in at most
(a) $50$ days?
(b) $25$ days?
Let $n$ be a positive integer. Beto writes a list of $n$ non-negative integers on the board. Then he performs a succession of moves (two steps) of the following type:
First for each $i=1,2,...,n$, he counts how many numbers on the board are less than or equal to $i$.
Let $a_i$ be the number obtained for each $i=1,2,...,n$.
Next, he erases all the numbers from the board and writes the
numbers $a_1,a_2,...,a_n$.
For example, if $n=5$ and the initial numbers on the board are $0,7,2,6,2$, after the first move, the numbers on the board will bec$1,3,3,3,3$;after the second move they will be $1,1,5,5,5$, and so on.
$a)$ Show that, for every $n$ and every initial configuration, there will come a time after which the numbers will no longer be modified when using this move.
$b)$Find (as a function of $n$) the minimum value of $k$ such that, for any initial configuration, the moves made from move number $k$ will not change the numbers on the board.
Consider a regular $n$-gon $A_1A_2\ldots A_n$ with area $S$. Let us draw the lines $l_1,l_2,\ldots,l_n$ perpendicular to the plane of the $n$-gon at $A_1,A_2,\ldots,A_n$ respectively. Points $B_1,B_2,\ldots,B_n$ are selected on lines $l_1,l_2,\ldots,l_n$ respectively so that:
(i) $B_1,B_2,\ldots,B_n$ are all on the same side of the plane of the $n$-gon;
(ii) Points $B_1,B_2,\ldots,B_n$ lie on a single plane;
(iii) $A_1B_1=h_1,A_2B_2=h_2,\ldots,A_nB_n=h_n$.
Express the volume of polyhedron $A_1A_2\ldots A_nB_1B_2\ldots B_n$ as a function in $S,h_1,\ldots,h_n$.