Found problems: 85335
Find one complex value of $x$ that satisfies the equation $\sqrt{3}x^7+x^4+2=0$.
In a tennis club, each member has exactly $k > 0$ friends, and a tournament is organized in rounds such that each pair of friends faces each other in matches exactly once. Rounds are played in simultaneous matches, choosing pairs until they cannot choose any more (that is, among the unchosen people, there is not a pair of friends which has its match pending). Determine the maximum number of rounds the tournament can have, depending on $k$.
Find all functions $f \colon \mathbb{R} \to \mathbb{R}$ that satisfy the following property for all real numbers $x$ and all polynomials $P$ with real coefficients:
If $P(f(x)) = 0$, then $f(P(x)) = 0$.
For each integer $n>1$, let $p(n)$ denote the largest prime factor of $n$. Determine all triples $(x, y, z)$ of distinct positive integers satisfying [list] [*] $x, y, z$ are in arithmetic progression, [*] $p(xyz) \le 3$. [/list]
The losing team of each game is eliminated from the tournament. If sixteen teams compete, how many games will be played to determine the winner?
$\textbf{(A)} 4 \qquad\textbf{(B)} 7 \qquad\textbf{(C)} 8 \qquad\textbf{(D)} 15 \qquad\textbf{(E)} 16$
In the triangle $ABC$, the altitude at $A$, the bisector of $\angle B$ and the median at $C$ meet at a common point. Prove (or disprove?) that the triangle $ABC$ is equilateral.
Compute the sum of the digits of $1001^{10}$
Let $0 < a < \frac{\pi}{2}$ and $x_1,x_2,...,x_n$ be real numbers such that $\sin x_1 + \sin x_2 +... + \sin x_n \ge n \cdot sin a $. Prove that $\sin (x_1 - a) + \sin (x_2 - a) + ... + \sin (x_n - a) \ge 0$ .
A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$.
(a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set?
(b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?
Find all $l,m,n \in\mathbb{N}$ that satisfies the equation $5^l43^m+1=n^3$
For any positive integer $ k$, let $ f_k$ be the number of elements in the set $ \{ k \plus{} 1, k \plus{} 2, \ldots, 2k\}$ whose base 2 representation contains exactly three 1s.
(a) Prove that for any positive integer $ m$, there exists at least one positive integer $ k$ such that $ f(k) \equal{} m$.
(b) Determine all positive integers $ m$ for which there exists [i]exactly one[/i] $ k$ with $ f(k) \equal{} m$.
Find the smallest positive integer $n$ such that the number $2^n + 2^8 + 2^{11}$ is a perfect square.
(A): $8$, (B): $9$, (C): $11$, (D): $12$, (E) None of the above.
In $\triangle ABC$, $E\in AC$, $D\in AB$, $P=BE\cap CD$. Given that $S\triangle BPC=12$, while the areas of $\triangle BPD$, $\triangle CPE$ and quadrilateral $AEPD$ are all the same, which is $x$. Find the value of $x$.
A chess king tours an entire $8\times 8$ chess board, visiting each square exactly once and returning at last to his starting position. Prove that he made an even number of diagonal moves.
(V Proizvolov)
In a group of $n$ people each one has an Easter Egg. They exchange their eggs in the following way: On each exchange two people exchange the eggs they currently have. Each two exchange eggs between themselves at least once. After a certain amount of such exchanges it turned out that each one of the $n$ people had the same egg he had from the beginning. Determine the least amount of exchanges needed, if:
a) $n=5$;
b) $n=6$.
In the quadrilateral $ABCD$, $AB = BC$ . The point $E$ lies on the line $AB$ is such that $BD= BE$ and $AD \perp DE$. Prove that the perpendicular bisectors to segments $AD, CD$ and $CE$ intersect at one point.
In making Euclidean constructions in geometry it is permitted to use a ruler and a pair of compasses. In the constructions considered in this question no compasses are permitted, but the ruler is assumed to have two parallel edges, which can be used for constructing two parallel lines through two given points whose distance is at least equal to the breadth of the rule. Then the distance between the parallel lines is equal to the breadth of the ruler. Carry through the following constructions with such a ruler. Construct:
[b]a)[/b] The bisector of a given angle.
[b]b)[/b] The midpoint of a given rectilinear line segment.
[b]c)[/b] The center of a circle through three given non-collinear
points.
[b]d)[/b] A line through a given point parallel to a given line.
Let $n$ be a natural number. Prove that,
\[ \left\lfloor \frac{n}{1} \right\rfloor+ \left\lfloor \frac{n}{2} \right\rfloor + \cdots + \left\lfloor \frac{n}{n} \right\rfloor + \left\lfloor \sqrt{n} \right\rfloor \]
is even.
Find all three-digit numbers $ abc$ (with $ a \neq 0$) such that $ a^{2}+b^{2}+c^{2}$ is a divisor of 26.
In acute-angled triangle $ABC$ ($AC > AB$), point $H$ is the orthocenter and point $M$ is the midpoint of the segment $BC$. The median $AM$ intersects the circumcircle of triangle $ABC$ at $X$. The line $CH$ intersects the perpendicular bisector of $BC$ at $E$ and the circumcircle of the triangle $ABC$ again at $F$. Point $J$ lies on circle $\omega$, passing through $X, E,$ and $F$, such that $BCHJ$ is a trapezoid ($CB \parallel HJ$). Prove that $JB$ and $EM$ meet on $\omega$.
[i]Proposed by Alireza Dadgarnia[/i]
Let $a_1, \ldots, a_n$ be $n$ positive numbers and $0 < q < 1.$ Determine $n$ positive numbers $b_1, \ldots, b_n$ so that:
[i]a.)[/i] $ a_{k} < b_{k}$ for all $k = 1, \ldots, n,$
[i]b.)[/i] $q < \frac{b_{k+1}}{b_{k}} < \frac{1}{q}$ for all $k = 1, \ldots, n-1,$
[i]c.)[/i] $\sum \limits^n_{k=1} b_k < \frac{1+q}{1-q} \cdot \sum \limits^n_{k=1} a_k.$
On a chess tournament two teams $A$ and $B$ are playing between each other and each consists of $n$ participants. It was noticed that however they arranged them in pairs, there was at least one pair that already played a match. Prove that there can be chosen $a$ chess players from $A$ and $b$ chess players from $B$ so that $a+b>n$ and each from the first chosen group has played a match earlier with each from the second group.
Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of
$$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$
[i]Israel[/i]
Find all pairs $(a,b)$ of positive integers for which $\gcd(a,b)=1$, and $\frac{a}{b}=\overline{b.a}$. (For example, if $a=92$ and $b=13$, then $b/a=13.92$ )
Let $ABCD$ be a parallelogram. $P \in (CD), Q \in (AB)$, $M= AP \cap DQ$, $N=BP \cap CQ$, $ K=MN \cap AD$, $L= MN \cap BC$. Prove that $BL=DK$.