Found problems: 85335
Let $a,b,c,d $-reals positive numbers. Prove inequality:
$\frac{a^2+b^2+c^2}{ab+bc+cd}+\frac{b^2+c^2+d^2}{bc+cd+ad}+\frac{a^2+c^2+d^2}{ab+ad+cd}+\frac{a^2+b^2+d^2}{ab+ad+bc} \geq 4$
If the positive integers $x$ and $y$ are such that $3x + 4y$ and $4x + 3y$ are both perfect squares, prove that both $x$ and $y$ are both divisible with $7$.
For some positive integer $n>m$, it turns out that it is representable as sum of $2021$ non-negative integer powers of $m$, and that it is representable as sum of $2021$ non-negative integer powers of $m+1$. Find the maximal value of the positive integer $m$.
Points $X$ and $Y$ are on a parabola of the form $y=\frac{x^2}{a^2}$ and $A$ is the point $(x, y) = (0, a)$. Assume $XY$ passes through $A$ and hits the line $y=-a$ at a point $B$. Let $\omega$ be the circle passing through $(0, -a)$, $A$, and $B$. A point $P$ is chosen on $\omega$ such that $PA = 8$. Given that $X$ is between $A$ and $B$, $AX=2$, and $XB=10$, find $PX \cdot PY$.
[i]Proposed by Kevin Zhao[/i]
Prove that \[ \lim_{n \to \infty} n \left( \frac{\pi}{4} - n \int_0^1 \frac{x^n}{1+x^{2n}} \, dx \right) = \int_0^1 f(x) \, dx , \] where $f(x) = \frac{\arctan x}{x}$ if $x \in \left( 0,1 \right]$ and $f(0)=1$.
[i]Dorin Andrica, Mihai Piticari[/i]
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.
Prove that the sum of all numbers representable as $\frac{1}{mn}$, where $m,n$ -- natural numbers, $1 \le m < n \le1986$, is not an integer.
There are $n$ pieces on the squares of a $5 \times 9$ board, at most one on each square at any time during the game. A move in the game consists of simultaneously moving each piece to a neighboring square by side, under the restriction that a piece having been moved horizontally in the previous move must be moved vertically and vice versa. Find the greatest value of $n$ for which there exists an initial position starting at which the game can be continued until the end of the world.
Let $x,y,z \in\mathbb{Q}$,such that $(x+y+z)^3=9(x^2y+y^2z+z^2x).$ Prove that $x=y=z$
Show that the expression $(a + b + 1) (a + b - 1) (a - b + 1) (- a + b + 1)$, where $a =\sqrt{1 + x^2}$, $b =\sqrt{1 + y^2}$ and $x + y = 1$ is constant ¸and be calculated that constant value.
Let $ABCDEF$ be a convex hexagon and denote by $A',B',C',D',E',F'$ the middle points of the sides $AB$, $BC$, $CD$, $DE$, $EF$ and $FA$ respectively. Given are the areas of the triangles $ABC'$, $BCD'$, $CDE'$, $DEF'$, $EFA'$ and $FAB'$. Find the area of the hexagon.
[i]Kvant Magazine[/i]
Marisa has a collection of $2^8-1=255$ distinct nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8\}$. For each step she takes two subsets chosen uniformly at random from the collection, and replaces them with either their union or their intersection, chosen randomly with equal probability. (The collection is allowed to contain repeated sets.) She repeats this process $2^8-2=254$ times until there is only one set left in the collection. What is the expected size of this set?
Outside the parallelogram $ABCD$ on its sides $AB$ and $BC$ are constructed equilateral triangles $ABK$, and $BCM$. Prove that the triangle $KMD$ is equilateral.
Each side of an arbitrarly triangle is divided into $ 2002$ congruent segments. After that, each vertex is joined with all "division" points on the opposite side.
Prove that the number of the regions formed, in which the triangle is divided, is divisible by $ 6$.
[i]Proposer[/i]: [b]Dorian Croitoru[/b]
In May, the traffic police wants to select 10 days to patrol, but no two consecutive days can be selected. How many ways are there for the traffic police to select patrol days?
Let $d(k)$ denote the number of positive divisors of a positive integer $k$. Prove that there exist in finitely many positive integers $M$ that cannot be written as
\[M=\left(\frac{2\sqrt{n}}{d(n)}\right)^2\]
for any positive integer $n$.
The number $17^6$ when written out in base $10$ contains $8$ distinct digits from $1,2,\ldots,9,$ with no repeated digits or zeroes. Compute the missing nonzero digit.
In a matrix $2n \times 2n$, $n \in N$, are $4n^2$ real numbers with a sum equal zero. The absolute value of each of these numbers is not greater than $1$. Prove that the absolute value of a sum of all the numbers from one column or a row doesn't exceed $n$.
A token is placed at each vertex of a regular $2n$-gon. A [i]move[/i] consists in choosing an edge of the $2n$-gon and swapping the two tokens placed at the endpoints of that edge. After a finite number of moves have been performed, it turns out that every two tokens have been swapped exactly once. Prove that some edge has never been chosen.
Let $S_1$ be the area of the regular pentagon $ABCDE$. And let $S_2$ be the area of the regular pentagon whose sides lie on the lines $AC, CE, EB, BD, DA$. What is values of $\frac{S_1}{S_2}$ ?
$\textbf{(A)}\ \frac{41}{6} \qquad\textbf{(B)}\ \frac{3+5\sqrt5}{2} \qquad\textbf{(C)}\ 4+\sqrt5 \qquad\textbf{(D)}\ \frac{7+3\sqrt5}2 \qquad\textbf{(E)}\ \text{None}$
A group of $101$ Dalmathians participate in an election, where they each vote independently on either candidate $A$ or $B$ with equal probability. If $X$ Dalmathians voted for the winning candidate, the expected value of $X^2$ can be expressed as $\tfrac{a}{b}$ for positive integers $a,b$ with $\gcd(a,b) = 1.$ Find the unique positive integer $k \le 103$ such that $103 | a-bk.$
Endre wrote $n$ (not necessarily distinct) integers on a paper. Then for each of the $2^n$ subsets, Kelemen wrote their sum on the blackboard.
a) For which values of $n$ is it possible that two different $n$-tuples give the same numbers on the blackboard?
b) Prove that if Endre only wrote positive integers on the paper and Ferenc only sees the numbers on the blackboard, then he can determine which integers are on the paper.
There are $169$ non-zero digits written around a circle. Prove that they can be split into $14$ non-empty blocks of consecutive digits so that among the $14$ natural numbers formed by the digits in those blocks, at least $13$ of them are divisible by $13$ (the digits in each block are read in clockwise direction).
There are 15 people at a party; each person has 10 friends. To greet each other each person hugs all their friends. How many hugs are exchanged at this party?
A given sequence $r_1, r_2, \dots, r_n$ of distinct real numbers can be put in ascending order by means of one or more ``bubble passes''. A bubble pass through a given sequence consists of comparing the second term with the first term, and exchanging them if and only if the second term is smaller, then comparing the third term with the second term and exchanging them if and only if the third term is smaller, and so on in order, through comparing the last term, $r_n$, with its current predecessor and exchanging them if and only if the last term is smaller.
The example below shows how the sequence 1, 9, 8, 7 is transformed into the sequence 1, 8, 7, 9 by one bubble pass. The numbers compared at each step are underlined.
\[ \begin{array}{c} \underline{1 \quad 9} \quad 8 \quad 7 \\ 1 \quad \underline{9 \quad 8} \quad 7 \\ 1 \quad 8 \quad \underline{9 \quad 7} \\ 1 \quad 8 \quad 7 \quad 9 \end{array} \]
Suppose that $n = 40$, and that the terms of the initial sequence $r_1, r_2, \dots, r_{40}$ are distinct from one another and are in random order. Let $p/q$, in lowest terms, be the probability that the number that begins as $r_{20}$ will end up, after one bubble pass, in the $30^{\text{th}}$ place. Find $p + q$.