Found problems: 85335
Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$
We call a permutation $(a_1, a_2,\cdots , a_n)$ of the set $\{ 1,2,\cdots, n\}$ "good" if for any three natural numbers $i <j <k$, $n\nmid a_i+a_k-2a_j$ find all natural numbers $n\ge 3$ such that there exist a "good" permutation of a set $\{1,2,\cdots, n\}$.
Where $n$ is a positive integer, the sequence $a_n$ is determined by the formula $$a_{n+1}=\frac{1}{a_1 + a_2 +... + a_n} -\sqrt2, \,a_1 = 1.$$ Find the limit of the sequence $S_n$ defined by $S_n=a_1 + a_2 +... + a_n$.
There are $n$ points on a circle ($n>1$). Define an "interval" as an arc of a circle such that it's start and finish are from those points. Consider a family of intervals $F$ such that for every element of $F$ like $A$ there is almost one other element of $F$ like $B$ such that $A \subseteq B$ (in this case we call $A$ is sub-interval of $B$). We call an interval maximal if it is not a sub-interval of any other interval. If $m$ is the number of maximal elements of $F$ and $a$ is number of non-maximal elements of $F,$ prove that $n\geq m+\frac a2.$
Find the minimum positive integer $n\ge 3$, such that there exist $n$ points $A_1,A_2,\cdots, A_n$ satisfying no three points are collinear and for any $1\le i\le n$, there exist $1\le j \le n (j\neq i)$, segment $A_jA_{j+1}$ pass through the midpoint of segment $A_iA_{i+1}$, where $A_{n+1}=A_1$
Let $ABC$ be a triangle with $AB<AC<BC$.Let $O$ be the center of it's circumcircle and $D$ be the center
of minor arc $\overarc{AB}$.Line $AD$ intersects $BC$ at $E$ and the circumcircle of $BDE$ intersects $AB$ at
$Z$ ,($Z\not=B$).The circumcircle of $ADZ$ intersects $AC$ at $H$ ,($H\not=A$),prove that $BE=AH$.
Find all triangles that can be divided into congruent right-angled isosceles triangles with side lengths $1, 1, \sqrt{2}$.
Let $n \ge 1$ be a positive integer. An $n \times n$ matrix is called [i]good[/i] if each entry is a non-negative integer, the sum of entries in each row and each column is equal. A [i]permutation[/i] matrix is an $n \times n$ matrix consisting of $n$ ones and $n(n-1)$ zeroes such that each row and each column has exactly one non-zero entry.
Prove that any [i]good[/i] matrix is a sum of finitely many [i]permutation[/i] matrices.
Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$.
[i]Proposed by Mohammad Ahmadi[/i]
$2019$ point grasshoppers sit on a line. At each move one of the grasshoppers jumps over another one and lands at the point the same distance away from it. Jumping only to the right, the grasshoppers are able to position themselves so that some two of them are exactly $1$ mm apart. Prove that the grasshoppers can achieve the same, jumping only to the left and starting from the initial position.
(Sergey Dorichenko)
For any positive integer $n$ , Prove that there is not exist three odd integer $x,y,z$ satisfing the equation $(x+y)^n+(y+z)^n=(x+z)^n$.
Consider two positive real numbers $ a,b $ and the function $ f:(0,\infty )\longrightarrow\left( \sqrt{ab} ,\frac{a+b}{2} \right) $ defined as $ f(x)=-x+\sqrt{x^2+(a+b)x+ab}. $ Prove that it's bijective.
[i]D.M. Bătineți-Giurgiu[/i] and [i]Neculai Stanciu[/i]
The arithmetic, geometric and harmonic mean of two distinct positive integers are different numbers. Find the smallest possible value for the arithmetic mean.
Let $\mathcal{G}$ be a simple graph with $n$ vertices and $m$ edges such that no two cycles share an edge. Prove that $2m < 3n$.
[i]Note[/i]: A [i]simple graph[/i] is a graph with at most one edge between any two vertices and no edges from any vertex to itself. A [i]cycle[/i] is a sequence of distinct vertices $v_1, \dots, v_n$ such that there is an edge between any two consecutive vertices, and between $v_n$ and $v_1$.
[i]Proposed by Ethan Tan[/i]
On the sides $ AB, BC, CD$ and $ DA$ of the rhombus $ ABCD$, respectively, are chosen points $ E, F, G$ and $ H$ so, that $ EF$ and $ GH$ touch the incircle of the rhombus. Prove that the lines $ EH$ and $ FG$ are parallel.
Let $ABCDE$ be a convex pentagon with $AB\parallel CE$, $BC\parallel AD$, $AC\parallel DE$, $\angle ABC=120^\circ$, $AB=3$, $BC=5$, and $DE=15$. Given that the ratio between the area of triangle $ABC$ and the area of triangle $EBD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.
Determine all real numbers $a$ such that the equation:
$$x^8+ax^4+1=0$$
have four real roots that form an arithmetic progression.
Let be given a tetrahedron whose any two opposite edges are equal. A plane varies so that its intersection with the tetrahedron is a quadrilateral. Find the positions of the plane for which the perimeter of this quadrilateral is minimum, and find the locus of the centroid for those quadrilaterals with the minimum perimeter.
Let $k$ be a positive integer. Marco and Vera play a game on an infinite grid of square cells. At the beginning, only one cell is black and the rest are white.
A turn in this game consists of the following. Marco moves first, and for every move he must choose a cell which is black and which has more than two white neighbors. (Two cells are neighbors if they share an edge, so every cell has exactly four neighbors.) His move consists of making the chosen black cell white and turning all of its neighbors black if they are not already. Vera then performs the following action exactly $k$ times: she chooses two cells that are neighbors to each other and swaps their colors (she is allowed to swap the colors of two white or of two black cells, though doing so has no effect). This, in totality, is a single turn. If Vera leaves the board so that Marco cannot choose a cell that is black and has more than two white neighbors, then Vera wins; otherwise, another turn occurs.
Let $m$ be the minimal $k$ value such that Vera can guarantee that she wins no matter what Marco does. For $k=m$, let $t$ be the smallest positive integer such that Vera can guarantee, no matter what Marco does, that she wins after at most $t$ turns. Compute $100m + t$.
[i]Proposed by Ashwin Sah[/i]
There are $15$ people, including Petruk, Gareng, and Bagong, which will be partitioned into $6$ groups, randomly, that consists of $3, 3, 3, 2, 2$, and $2$ people (orders are ignored). Determine the probability that Petruk, Gareng, and Bagong are in a group.
How many 4-digit positive integers have four different digits, where the leading digit is not zero, the integer is a multiple of 5, and 5 is the largest digit?
$ \textbf{(A)}24\qquad\textbf{(B)}48\qquad\textbf{(C)}60\qquad\textbf{(D)}84\qquad\textbf{(E)}108 $
Sasha has $10$ cards with numbers $1, 2, 4, 8,\ldots, 512$. He writes the number $0$ on the board and invites Dima to play a game. Dima tells the integer $0 < p < 10, p$ can vary from round to round. Sasha chooses $p$ cards before which he puts a “$+$” sign, and before the other cards he puts a “$-$" sign. The obtained number is calculated and added to the number on the board. Find the greatest absolute value of the number on the board Dima can get on the board after several rounds regardless Sasha’s moves.
Amy has a $2 \times 10$ puzzle grid which she can use $1 \times 1$ and $1 \times 2$ (1 vertical, 2 horizontal) tiles to cover. How many ways can she exactly cover the grid without any tiles overlapping and without rotating the tiles?
Find all polynomials with degree $\leq n$ and nonnegative coefficients, such that $P(x)P(\frac{1}{x}) \leq P(1)^2$ for every positive $x$
What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm?
$\textbf{(A)}~\displaystyle\frac{3}{2}\qquad\textbf{(B)}~\displaystyle\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\displaystyle\frac{9}{4}\qquad\textbf{(E)}~3$