Found problems: 85335
Let be a natural number $ n $ and $ 2n $ real numbers $ b_1,b_2,\ldots ,b_n,a_1<a_2<\cdots <a_n. $ Show that
[b]a)[/b] if $ b_1,b_2,\ldots ,b_n>0, $ then there exists a polynomial $ f\in\mathbb{R}[X] $ irreducible in $ \mathbb{R}[X] $ such that $$ f\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$
[b]b)[/b] there exists a polynom $ g\in\mathbb{R} [X] $ of degree at least $ 1 $ which has only real roots and such that
$$ g\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$
$AB,AC$ are tangent to $\Omega$ at $B$ and $C$, respectively. $D,E,F$ lie on segments $BC,CA,AB$ such that $AF<AE$ and $\angle FDB= \angle EDC$. The circumcircle of $\triangle FEC$ intersects $\Omega$ at $G$ and $C$. Show that $ \angle AEF= \angle BGD$
Each vertex of a convex hexagon is the center of a circle whose radius is equal to the shorter side of the hexagon that contains the vertex. Show that if the intersection of all six circles (including their boundaries) is not empty, then the hexagon is regular.
An $(n^2+n+1) \times (n^2+n+1)$ matrix of zeros and ones is given. If no four ones are vertices of a rectangle, prove that the number of ones does not exceed $(n + 1)(n^2 + n + 1).$
Let $n$ be a positive integer. A square $ABCD$ is divided into $n^2$ identical small squares by drawing $(n-1)$ equally spaced lines parallel to the side $AB$ and another $(n- 1)$ equally spaced lines parallel to $BC$, thus giving rise to $(n+1)^2$ intersection points. The points $A, C$ are coloured red and the points $B, D$ are coloured blue. The rest of the intersection points are coloured either red or blue. Prove that the number of small squares having exactly $3$ vertices of the same colour is even.
In triangle $ABC$, points $P$, $Q$, and $R$ are marked on the sides $AB$, $BC$, and $AC$ respectively. The lengths of the sides of triangle $PQR$ are known to be 7, 8, and 9 centimeters. Find the radii of the circles inscribed in triangles $APR$, $BPQ$, and $CQR$ given that all three circles are tangent to the incircle of triangle $PQR$.
[i]Proposed by Giorgi Arabidze, Georgia[/i]
Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.
Find all functions $f:R\rightarrow R$ such that \[ f(x^3)+f(y^3)=(x+y)(f(x^2)+f(y^2)-f(xy)) \] for all $x,y\in R$.
(1) Prove that $\sqrt[3]{2}$ is irrational.
(2) Let $P(x)$ be a polynomoal with rational coefficients such that $P(\sqrt[3]{2})=0$. Prove that $P(x)$ is divisible by $x^3-2$.
35 points
Prove that there are no positive integers $x, y$ such that: $(x + 1)^2 + (x + 2)^2 +...+ (x + 9)^2 = y^2$
Find all non-negative integer numbers $n$ for which there exists integers $a$ and $b$ such that $n^2=a+b$ and $n^3=a^2+b^2.$
Say a positive integer $n>1$ is $d$-coverable if for each non-empty subset $S\subseteq \{0, 1, \ldots, n-1\}$, there exists a polynomial $P$ with integer coefficients and degree at most $d$ such that $S$ is exactly the set of residues modulo $n$ that $P$ attains as it ranges over the integers. For each $n$, find the smallest $d$ such that $n$ is $d$-coverable, or prove no such $d$ exists.
[i]Proposed by Carl Schildkraut[/i]
Consider the following one-person game: A player starts with score $0$ and writes the number $20$ on an
empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers
(call them $b$ and $c$) such that $b + c = a$. The player then adds $b\times c$ to her score. She repeats the step
several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is
calculated. Let $M, m$ be the maximum and minimum final score that can be possibly obtained respectively.
Find $M-m$.
Let $a, b$ and $c$ be pairwise different natural numbers. Prove $\frac{a^3 + b^3 + c^3}{3} \ge abc + a + b + c$.
When does equality holds?
(Karl Czakler)
Right triangle $ABC$ with $\angle ABC = 90^o$ is inscribed in a circle $\omega_1$ with radius $3$. A circle $\omega_2$ tangent to $AB$, $BC$, and $\omega_1$ has radius $2$. Compute the area of $\vartriangle ABC$.
Let $ABCD$ be a rectangle with $AB=10$ and $BC=26$. Let $\omega_1$ be the circle with diameter $\overline{AB}$ and $\omega_2$ be the circle with diameter $\overline{CD}$. Suppose $\ell$ is a common internal tangent to $\omega_1$ and $\omega_2$ and that $\ell$ intersects $AD$ and $BC$ at $E$ and $F$ respectively. What is $EF$?
[asy]
size(10cm);
draw((0,0)--(26,0)--(26,10)--(0,10)--cycle);
draw((1,0)--(25,10));
draw(circle((0,5),5));
draw(circle((26,5),5));
dot((1,0));
dot((25,10));
label("$E$",(1,0),SE);
label("$F$",(25,10),NW);
label("$A$", (0,0), SW);
label("$B$", (0,10), NW);
label("$C$", (26,10), NE);
label("$D$", (26,0), SE);
dot((0,0));
dot((0,10));
dot((26,0));
dot((26,10));
[/asy]
[i]Proposed by Nathan Xiong[/i]
Let the sequence $\{a_n\}$ , $n \ge 0$ satisfy the recurrence relation
$$a_{n + 2} =4a_{n + 1}-3a_n, \ \ (1) $$
Let us define the sequence $\{b_n\}$ , $n \ge 1$ by the relation
$$b_n= \left[ \frac{a_{n+1}}{a_{n-1}} \right]$$
where we put $b_n =1$ for $a_{n-1}=0$. Prove that, starting from a certain term, the sequence also satisfies the recurrence relation (1).
Note: $[x]$ indicates the whole part of the number $x$.
Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$
Let $ABC$ be a triangle with orthocenter $H$; suppose $AB=13$, $BC=14$, $CA=15$. Let $G_A$ be the centroid of triangle $HBC$, and define $G_B$, $G_C$ similarly. Determine the area of triangle $G_AG_BG_C$.
Find all functions $f:\mathbb{R}^+ \to \mathbb{R}$ such that for all $x,y,z>0$
$$
3(x^3+y^3+z^3)\geq f(x+y+z)\cdot f(xy+yz+xz) \geq (x+y+z)(xy+yz+xz).
$$
If $a>1,b>1,\lg(a+b)=\lg a+\lg b$, then the value of $\lg(a-1)+\lg(b-1)$ is
$\text{(A)}\lg2\qquad\text{(B)}1\qquad\text{(C)}0\qquad\text{(D)}$ not sure
For positive integers $x$, $y$ and $z$ holds $\frac{1}{x^2}+\frac{1}{y^2}=\frac{1}{z^2}$.
Prove that $xyz\geq 3600$
Inside a $2\times 2$ square, lines parallel to a side of the square (both horizontal and vertical) are drawn thereby dividing the square into rectangles. The rectangles are alternately colored black and white like a chessboard. Prove that if the total area of the white rectangles is equal to the total area of the black rectangles, then one can cut out the black rectangles and reassemble them into a $1\times 2$ rectangle.
Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that \[f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1\] for all $x,y,z >0$ with $xyz =1$.
Let $n$ be a fixed positive integer. How many ways are there to write $n$ as a sum of positive integers,
\[n = a_1 + a_2 + \cdots a_k\]
with $k$ an arbitrary positive integer and $a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1$? For example, with $n = 4$, there are four ways: $4$, $2 + 2$, $1 + 1 + 2$, $1 + 1 + 1 + 1$.