For each positive integer $n$, show that the polynomial: $$P_n(x)=\sum _{k=0}^n2^k\binom{2n}{2k}x^k(x-1)^{n-k}$$ has $n$ real roots.

p1. Among the numbers $\frac15$ and $\frac14$ there are infinitely many fractional numbers. Find $999$ decimal numbers between $\frac15$ and $\frac14$ so that the difference between the next fractional number with the previous fraction constant. (i.e. If $x_1, x_2, x_3, x_4,..., x_{999}$ is a fraction that meant, then $x_2 - x_1= x_3 - x_3= ...= x_n - x_{n-1}=...=x_{999}-x_{998}$) p2. The pattern in the image below is: "Next image obtained by adding an image of a black equilateral triangle connecting midpoints of the sides of each white triangle that is left in the previous image." The pattern is continuous to infinity. [img]https://cdn.artofproblemsolving.com/attachments/e/f/81a6b4d20607c7508169c00391541248b8f31e.png[/img] It is known that the area of ​​the triangle in Figure $ 1$ is $ 1$ unit area. Find the total area of ​​the area formed by the black triangles in figure $5$. Also find the total area of the area formed by the black triangles in the $20$th figure. p3. For each pair of natural numbers $a$ and $b$, we define $a*b = ab + a - b$. The natural number $x$ is said to be the [i]constituent [/i] of the natural number $n$ if there is a natural number $y$ that satisfies $x*y = n$. For example, $2$ is a constituent of $6$ because there is a natural number 4 so that $2*4 = 2\cdot 4 + 2 - 4 = 8 + 2 - 4 = 6$. Find all constituent of $2005$. p4. Three people want to eat at a restaurant. To find who pays them to make a game. Each tossing one coin at a time. If the result is all heads or all tails, then they toss again. If not, then "odd person" (i.e. the person whose coin appears different from the two other's coins) who pay. Determine the number of all possible outcomes, if the game ends in tossing: a. First. b. Second. c. Third. d. Tenth. p5. Given the equation $x^2 + 3y^2 = n$, where $x$ and $y$ are integers. If $n < 20$ what number is $n$, and which is the respective pair $(x,y)$ ? Show that it is impossible to solve $x^2 + 3y^2 = 8$ in integers.

For $n\ge 1$ let $d_n$ be the $\gcd$ of the entries of $A^n-\mathcal{I}_2$ where \[ A=\begin{pmatrix} 3&2\\ 4&3\end{pmatrix}\quad \text{ and }\quad \mathcal{I}_2=\begin{pmatrix}1&0\\ 0&1\\\end{pmatrix}\] Show that $\lim_{n\to \infty}d_n=\infty$.

Jimmy’s garden has right angled triangle shape that lies on island of circular shape in such a way that the corners of the triangle are on the shore of the island. When he made fences along the garden he realized that the length of the shortest side is $36$ meter shorter than the longest side, and third side required $48$ meter long fence. In the middle of the garden he built a house of circular shape that has the largest possible size. Jimmy measured the distance between the center of his house and the center of the island. What is the square of this distance?

Let $ABC$ be an isosceles triangle with base $BC$ and $\angle BAC = 20^o$. Let $D$ a point on side $AB$ such that $AD = BC$. Determine $\angle DCA$.

There are 6 lines in space, of which no 3 are parallel, no 3 pass through the same point, and no 3 are contained in the same plane. Prove that among these 6 lines there are 3 mutually oblique lines.

Show that for each natural number $k$ there exist only finitely many triples $(p, q, r)$ of distinct primes for which $p$ divides $qr-k$, $q$ divides $pr-k$, and $r$ divides $pq - k$.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that $1+L_{2^{j}}\equiv 0 \pmod{2^{j+1}}$ for $j \geq 0$.

Let $ R$ be a finite commutative ring. Prove that $ R$ has a multiplicative identity element $ (1)$ if and only if the annihilator of $ R$ is $ 0$ (that is, $ aR\equal{}0, \;a\in R $ imply $ a\equal{}0$).

Let $n$ be a positive integer. Prove that the number $2^n + 1$ has no prime divisor of the form $8 \cdot k - 1$, where $k$ is a positive integer.

Two players write alternatively some integers on the blackboard. The rules are the following : - The first player write $1$. - At each of the other turns, the player has to write $a+1$ or $2a$ where $a$ is any number already wrote in the blackboard and $2a \leq 1000.$ - One cannot write a number which has already been written, and no number is erased. - The player who writes $1000$ is the winner. Determine which player has a winning strategy. Pierre.

If $0<\theta<\pi$, then the maximum value of $\sin\frac{\theta}{2}(1+\cos\theta)$ is________.

We call natural number $m$ [b]ziba[/b], iff every natural number $n$ with the condition $1\le n\le m$ can be shown as sum of [some of] positive and [u]distinct[/u] divisors of $m$. Prove that infinitely ziba numbers in the form of $(k\in\mathbb{N})k^2+k+2022$ exist.

$ n $ lines meet at a point. Each one of the $ 2n $ disjoint angles formed around this point by these lines has either $ 7^{\circ} $ or $ 17^{\circ} . $ [b]a)[/b] Find $ n. $ [b]b)[/b] Prove that among these lines there are at least two perpendicular ones.

Let $a,b,c \in \left[ \frac 12, 1 \right]$. Prove that \[ 2 \leq \frac{ a+b}{1+c} + \frac{ b+c}{1+a} + \frac{ c+a}{1+b} \leq 3 . \] [i]selected by Mircea Lascu[/i]

Let $n>3$ be an integer. If $x_1<x_2<\ldots<x_{n+2}$ are reals with $x_1=0$, $x_2=1$ and $x_3>2$, what is the maximal value of $$(\frac{x_{n+1}+x_{n+2}-1}{x_{n+1}(x_{n+2}-1)})\cdot (\sum_{i=1}^{n}\frac{(x_{i+2}-x_{i+1})(x_{i+1}-x_i)}{x_{i+2}-x_i})?$$

The ratio of the length to the width of a rectangle is $4:3$. If the rectangle has diagonal of length $d$, then the area may be expressed as $kd^2$ for some constant $k$. What is $k$? $\textbf{(A) }\dfrac27\qquad\textbf{(B) }\dfrac37\qquad\textbf{(C) }\dfrac{12}{25}\qquad\textbf{(D) }\dfrac{16}{25}\qquad\textbf{(E) }\dfrac34$

Prove that the product of the sines of two opposite dihedrals in a tetrahedron is proportional to the product of the lengths of the edges of these dihedrals.

The right triangles $ABC$ and $AB_1C_1$ are similar and have opposite orientation. The right angles are at $C$ and $C_1$, and we also have $ \angle CAB = \angle C_1AB_1$. Let $M$ be the point of intersection of the lines $BC_1$ and $B_1C$. Prove that if the lines $AM$ and $CC_1$ exist, they are perpendicular.

Statement $P$: solution set to inequalities $a_1x^2+b_1x+c_1>0$ and $a_2x^2+b_2x+c_2>0$ are the same; statement $Q$: $\frac{a_1}{a_2}=\frac{b_1}{b_2}=\frac{c_1}{c_2}$. $\text{(A)}$ $Q$ is sufficient and necessary condition of $P$. $\text{(B)}$ $Q$ is sufficient but unnecessary condition of $P$. $\text{(C)}$ $Q$ is insufficient but necessary condition of $P$. $\text{(D)}$ $Q$ is insufficient and unnecessary condition of $P$.

A 0-1 sequence of length $2^k$ is given. Alice can pick a member from the sequence, and reveal it (its place and its value) to Bob. Find the largest number $s$ for which Bob can always pick $s$ members of the sequence, and guess all their values correctly. Alice and Bob can discuss a strategy before the game with the aim of maximizing the number of correct guesses of Bob. The only information Bob has is the length of the sequence and the member of the sequence picked by Alice.

$a)$ Let $n$ a positive integer. Prove that $gcd(n, \lfloor n\sqrt{2} \rfloor)<\sqrt[4]{8}\sqrt{n}$. $b)$ Prove that there are infinitely many positive integers $n$ such that $gcd(n, \lfloor n\sqrt{2} \rfloor)>\sqrt[4]{7.99}\sqrt{n}$.

Let $n$ be a positive integer, and let $s$ be the sum of the digits of the base-four representation of $2^n-1.$ If $s=2023$ (in base ten), compute $n$ (in base ten).

Let $ABC$ be a right triangle with$ \angle A = 90^o$. Point $D$ lies on side $BC$ such that $\angle BAD = \angle CAD$. Point $I_a$ is the excenter of the triangle opposite $A$. Prove that $\frac{AD}{DI_a } \le \sqrt{2} -1$

Let $ \mathbb{N}$ denote the set of all positive integers. Prove that there exists a unique function $ f: \mathbb{N} \mapsto \mathbb{N}$ satisfying \[ f(m \plus{} f(n)) \equal{} n \plus{} f(m \plus{} 95) \] for all $ m$ and $ n$ in $ \mathbb{N}.$ What is the value of $ \sum^{19}_{k \equal{} 1} f(k)?$