Found problems: 85335
A polynomial $w$ of degree $n > 1$ has $n$ distinct zeros $x_1,x_2,...,x_n$. Prove that:
$$\frac{1}{w'(x_1)}+\frac{1}{w'(x_2)}+...···+\frac{1}{w'(x_n)}= 0.$$
Let $f:\mathbb{R}\longrightarrow \mathbb{R}$ be a function such that $f(x+y+xy)=f(x)+f(y)+f(xy)$ for all $x, y\in\mathbb{R}$. Prove that $f$ satisfies $f(x+y)=f(x)+f(y)$ for all $x, y\in\mathbb{R}$.
Find all injective $f:\mathbb{Z}\ge0 \to \mathbb{Z}\ge0 $ that for every natural number $n$ and real numbers $a_0,a_1,...,a_n$ (not everyone equal to $0$), polynomial $\sum_{i=0}^{n}{a_i x^i}$ have real root if and only if $\sum_{i=0}^{n}{a_i x^{f(i)}}$ have real root.
[i]Proposed by Hesam Rajabzadeh [/i]
Alex dissects a paper triangle into two triangles. Each minute after this he dissects one of obtained triangles into two triangles. After some time (at least one hour) it appeared that all obtained triangles were congruent. Find all initial triangles for which this is possible.
The positive integers $p$, $q$ are such that for each real number $x$
$(x+1)^p (x-3)^q=x^n+a_1 x^{n-1}+a_2 x^{n-2}+\dots +a_{n-1} x+a_n$
where $n=p+q$ and $a_1,\dots ,a_n$ are real numbers. Prove that there exists infinitely many pairs $(p,q)$ for which $a_1=a_2$.
Let the functions $f(\alpha,x)$ and $g(\alpha)$ be defined as \[f(\alpha,x)=\dfrac{(\frac{x}{2})^\alpha}{x-1}\qquad\qquad\qquad g(\alpha)=\,\dfrac{d^4f}{dx^4}|_{x=2}\] Then $g(\alpha)$ is a polynomial is $\alpha$. Find the leading coefficient of $g(\alpha)$.
Two distinct positive even integers sum to $8$. Find the larger of the two integers.
Call a positive integer [i]descending[/i] if, reading left to right, each of its digits (other than its leftmost) is less than or equal to the previous digit. For example, $4221$ and $751$ are descending while $476$ and $455$ are not descending. Determine whether there exists a positive integer $n$ for which $16^n$ is descending.
If in $\bigtriangleup ABC$, $AD$ is the altitude and $AE$ is the diameter of the circumcircle through $A$, then prove that $AB\cdot AC = AD \cdot AE$. Use this result to show that if $ABCD$ is a cyclic quadrilateral then show that $AC \cdot (AB \cdot BC + CD \cdot DA) = BD\cdot (DA\cdot AB + BC \cdot CD)$.
Let $n$ and $k$ be positive integers and $G$ be a complete graph on $n$ vertices. Each edge of $G$ is colored one of $k$ colors such that every triangle consists of either three edges of the same color or three edges of three different colors. Furthermore, there exist two different-colored edges. Prove that $n\le(k-1)^2$.
[i]Linus Tang[/i]
Real numbers $a, b, c$ satisfy $(2b - a)^2 + (2b - c)^2 = 2(2b^2 - ac)$. Prove that $a + c = 2b$.
Define the sequence $a_n$ by the rule $$a_{n+1} =\left \lfloor \frac{a_n} 2 \right \rfloor + \left \lfloor \frac{a_n}3 \right \rfloor$$ for $n \in \{1, 2, 3, 4, 5, 6, 7\}$, where $\lfloor x \rfloor$ denotes the greatest integer not greater than $x$. If $a_8=8$, how many possible values are there for $a_1$ given that it is a positive integer?
[i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 10)[/i]
For any given $k$ points in a plane, we define the diameter of the points as the maximum distance between any two points among the given points. Suppose $n$ points are there in a plane with diameter $d$. Show that we can always find a circle with radius $\frac{\sqrt{3}}{2}d$ such that all points lie inside the circle.
Is the number \[
\left( 1 + \frac12 \right) \left( 1 + \frac14 \right) \left( 1 + \frac16 \right)\cdots\left( 1 + \frac{1}{2018} \right)
\] greater than, less than, or equal to $50$?
Let $ABC$ be an acute triangle, and $H$ its orthocenter. The distance from $H$ to rays $BC$, $CA$, and $AB$ is denoted by $d_a$, $d_b$, and $d_c$, respectively. Let $R$ be the radius of circumcenter of $\triangle ABC$ and $r$ be the radius of incenter of $\triangle ABC$. Prove the following inequality:
$$d_a+d_b+d_c \le \frac{3R^2}{4r}$$.
Prove that for any natural number $k{}$ there is a natural number $n{}$ such that $\mathrm{lcm}(1,2,\ldots,n)=\mathrm{lcm}(1,2,\ldots,n+k).$
[i]From the folklore[/i]
Find all ordered triples $(a,b,c)$ of real numbers such that
\[\begin{cases}
a+b=c,\\
a^2+b^2=c^2-c-6,\\
a^3+b^3 = c^3-2c^2-5c. \\
\end{cases}\]
[i]Proposed by Evan Fang
Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.
Let $a_1,a_2,...,a_n$ be $n$ different positive integers where $n\ge 1$. Show that $$\sum_{i=1}^n a_i^3 \ge \left(\sum_{i=1}^n a_i\right)^2$$
Let $[n]=\{1,2,...,n\}$.Let $p$ be any prime number.
Find how many finite non-empty sets $S\in [p] \times [p]$ are such that $$\displaystyle \large p | \sum_{(x,y) \in S}{x},p | \sum_{(x,y) \in S}{y}$$
A quadrilateral is cut from a piece of gift wrapping paper, which has equally wide white and gray stripes.
The grey stripes in the quadrilateral have a combined area of $10$. Determine the area of the quadrilateral.
[img]https://1.bp.blogspot.com/-ia13b4RsNs0/XzP0cepAcEI/AAAAAAAAMT8/0UuCogTRyj4yMJPhfSK3OQihRqfUT7uSgCLcBGAsYHQ/s0/2020%2Bmohr%2Bp2.png[/img]
An integer $n $ is called silesian if there exist positive integers $a,b$ and $c$ such that $$n=\frac{a^2+b^2+c^2}{ab+bc+ca}.$$
$(a)$ prove that there are infinitely many silesian integers.
$(b)$ prove that not every positive integer is silesian.
A permutation of $\{1, 2, \dots, 7\}$ is chosen uniformly at random. A partition of the permutation into contiguous blocks is correct if, when each block is sorted independently, the entire permutation becomes sorted. For example, the permutation $(3, 4, 2, 1, 6, 5, 7)$ can be partitioned correctly into the blocks $[3, 4, 2, 1]$ and $[6, 5, 7]$, since when these blocks are sorted, the permutation becomes $(1, 2, 3, 4, 5, 6, 7)$. Find the expected value of the maximum number of blocks into which the permutation can be partioned correctly.
Determine all functions $f : \mathbb R \to \mathbb R$ such that $$f(f(x)- f(y)) = f(f(x)) - 2x^2f(y) + f\left(y^2\right),$$ for all reals $x, y$.
Prove that if the integers $a_{1}$, $a_{2}$, $\cdots$, $a_{n}$ are all distinct, then the polynomial \[(x-a_{1})^{2}(x-a_{2})^{2}\cdots (x-a_{n})^{2}+1\] cannot be expressed as the product of two nonconstant polynomials with integer coefficients.