[/quote]
,
reals, and 
.
?
be positive real numbers such that 
.
knowing that the denominators are positive real numbers.
equals to a positive integer power of 
.
be an acute-angled triangle with 
A circle passes through 
and 
and crosses the segments 
and 
again at 
and 
respectively. The circumcircles of 
and 
and 
The segments 
and 
intersect at 
Let 
and 
be the reflections of 
in the lines 
and 
respectively. Prove that the points 
and 
are concyclic.
be positive real numbers such that 
.
When is the equality valid?
be a center of circle which passes through vertices of quadrilateral 
,
of positive integers such that ![\[ k!=(2^n-1)(2^n-2)(2^n-4)\cdots(2^n-2^{n-1}). \]](http://latex.artofproblemsolving.com/3/5/3/353bbb15bac205053c26208af8cac7c32a296f55.png)
Proposed by Gabriel Chicas Reyes, El Salvador
cards on the table, and each card has a positive integer written on it. An odd number is written on exactly 
cards. Every minute, the following operation is performed: for all possible sets of 
cards on the table, the product of the numbers on these three cards is calculated, all the obtained results are summed, and this sum is written on a new card and placed on the table. A day later, it turns out that there is a card on the table, the number written on this card is divisible by 
Prove that one hour after the start of the process, there was a card on the table that the number written on that card is divisible by 
on the board. Charlotte has two operations available: the GCD operation and the LCM operation.
and 
written on the board, erasing them, and writing the integer 
.
.
is called a winning number if there exists a sequence of operations such that, at the end, the only integer left on the board is 
and, for each of them, determine the minimum number of GCD operations Charlotte must use.
Y by MathRook7817, NaturalSelection, LostDreams, NO_SQUARES
Let 
and 
be positive integers with 
. Let 
be a polynomial of degree with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers 
such that the polynomial 
divides , the product 
is zero. Prove that has a nonreal root.
and 
be positive integers with 
. Let 
be a polynomial of degree with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers 
such that the polynomial 
divides , the product 
is zero. Prove that has a nonreal root.
so let 
.
,
and deal with 
for 
has a coefficient equal to 
.
for all 
,
choices. By pigeonhole, there exists 
such that 
and 
have no 
term, for some 
.
and 
.
Then 
has no 
has no 
.
has no 
has no 
term.
distinct real roots.
,
t
distinct real roots for all 
.
trivial.
consecutive real roots there exists a local extremum, where 
is 
pairs of consecutive real roots so 
distinct real roots, completing the induction step.
has no 
or 
term, so 
are distinct real numbers. Thus 
will still satisfy the problem condition, hence we may WLOG assume 
.
-
.
satisfy the following property: for each subset 
of size 
,
such that 
.
such subsets, by pigeonhole there are two distinct subsets 
and 
with 
.
and 
,
;![\[ p_d (S_1) = p_d (S_2) \implies (r_{k+1}-r_1)p_{d-1}(S_3) = 0 \implies p_{d-1}(S_3) =0 \]](http://latex.artofproblemsolving.com/c/b/b/cbbfb2d692b621810dffe3634cb1fea24c482b11.png)
since 
by assumption. Furthermore, we have![\[ 0 = p_d(S_1) = r_1 p_{d-1}(S_3) + p_d(S_3) \implies p_d(S_3) = 0.\]](http://latex.artofproblemsolving.com/d/6/4/d64110f93f2e662ec5487dffd1379a6a2e4b941c.png)
But it turns out to be impossible to have 
:
If 
we just need to consider a subset of these roots in the 
case to get our contradiction. Thus assume 
we define 
to be the degree 
for all 
Also let 
Then by Vieta's Formulas, we are given that for all 
Suppose WLOG that 
Some algebraic manipulation gives 
This means that the polynomial 
has two consecutive coefficients equal to 
has 
distinct real roots as well, along with two consecutive coefficients which are equal to 
contradiction as there can be no double roots.
roots of 
The set of degree 
Say an equation is \textbf{\emph{type} 
of set 
}![\[\sum_{\stackrel{S\subseteq \{r_1, \dots, r_m\}}{|S| = \ell}}\prod_{r\in S}r = 0\]](http://latex.artofproblemsolving.com/7/3/b/73bcca1583fcb59b43b2f5a551101da8ffaa0f74.png)
In other words, it is a cyclic sum of degree 
if 
is type 
equations. However, there are only 
(
are missing from the first and second equations, respectively. Also assume the degree is 
This gives:
equation of 
must be 0(since otherwise, 
)
we get that the type 
is 0, or:
we are done. The base case is obvious.
denote the degree 
.
for some 
.
elements.
is a family of 
.
in 
sets outside of 
not in 
sets in 
to be the family of 
vanishes. Then there are 
.
such that![\[e_i(r_1,r_2,\dotsc,r_k)=e_i(r_1,r_2,\dotsc,r_{k-1},r_k')=0.\]](http://latex.artofproblemsolving.com/6/5/4/65493474ee6be306e68267a4525f9eb71a6fde6a.png)
Now we expand these by writing![\[e_i(r_1,r_2,\dotsc,r_{k-1})+r_ke_{i-1}(r_1,r_2,\dotsc,r_{k-1})=e_i(r_1,r_2,\dotsc,r_{k-1})+r_k'e_{i-1}(r_1,r_2,\dotsc,r_{k-1})=0,\]](http://latex.artofproblemsolving.com/7/7/1/771984e5e44c4450813a08f2be0f9286a3fe4048.png)
and since 
,![\[e_i(r_1,r_2,\dotsc,r_{k-1})=e_{i-1}(r_1,r_2,\dotsc,r_{k-1})=0.\]](http://latex.artofproblemsolving.com/f/4/e/f4e4ba4a4715fe022fdcae81c899b256d7652b1c.png)
is a set of real numbers such that 
for some ![\[e_i(r_1,r_2,\dotsc,r_{k-2})+r_{k-1}e_{i-1}(r_1,r_2,\dotsc,r_{k-2})=e_{i-1}(r_1,r_2,\dotsc,r_{k-2})+r_{k-1}e_{i-2}(r_1,r_2,\dotsc,r_{k-2})=0,\]](http://latex.artofproblemsolving.com/9/f/9/9f9551c3271e058203e79e08edc1d748776bb41f.png)
from which we may deduce that![\[e_i(r_1,r_2,\dotsc,r_{k-2})e_{i-2}(r_1,r_2,\dotsc,r_{k-2})=e_{i-1}(r_1,r_2,\dotsc,r_{k-2})^2.\]](http://latex.artofproblemsolving.com/c/7/9/c79d3854db78998729783daadb389328df034cb6.png)
,
can vanish, for then two consecutive elementary symmetric polynomials must vanish. By "On the nonnegativity of generalized discriminants of quadratics",![\[e_{i-1}(r_1,r_2,\dotsc,r_{k-2})^2\ge \frac{i(k-i)}{(i-1)(k-i-1)}e_i(r_1,r_2,\dotsc,r_{k-2})e_{i-2}(r_1,r_2,\dotsc,r_{k-2}).\]](http://latex.artofproblemsolving.com/4/a/0/4a06b883523756f1888d66bf9610c302726d6780.png)
Since 
is strictly positive, we have a contradiction.
then it happens that all of 
happen to have one coefficient equal to 
such that 
are missing the same coefficient 
for 
(this is because none of the roots are equal and none can be zero), let these be called 
respectively and let 
be 
(it doesn't matter anyway lmao), then we have that 
and 
which the means that 
is missing the 
is missing the 
then we do in fact have that 
is missing both the 
coefficient. (Now we can wlog say 
then it has 
but also it has two consecutive missing coefficients so write it as 
(essy to check that if 
this is trivial and if 
then you have cuadratics of the form 
which shows pairwise sum of roots is zero and thus all are zero, a contradiction!), so for 
notice that 
and that you can set it so that least degree term on 
is greater than 
.
-
but also 
and these polynomials must have all of their roots real by chaining the fact that 
has a non-zero leading coefficient and thus if it were the zero polynomial we are done by the same argument as if it weren't which we will see now.
,
,
and thus by taking derivative w.r.t. 
it happens that 
for all 
for 
,
we have LHS is zero while RHS isn't, contradiction!.
.
.
is a polynomial which must have only real distinct roots, but it is divisible by 
,
.
.
.
.
,
.
for some distinct nonzero roots 
,
,
,
.
be 
,
,
,
and 
)
coefficient.
be 
.
both of which have zero as an 
coefficients. We now prove the following claim, which finishes the problem:
be a polynomial with distinct nonzero real roots. Then 
be a polynomial with 
distinct roots. Then, 
has 
distinct roots because between each two roots of 
distinct roots. But since there are two consecutive zero coefficients, eventually some multiple derivative of 
and the 
does too, as each root of 
)
.
and WLOG only consider monic degree
.
have,![\[\frac{P(x)}{x - r_1}, \frac{P(x)}{x - r_2}, \dots, \frac{P(x)}{x - r_n}\]](http://latex.artofproblemsolving.com/9/8/3/983dacf92dca7918dca07299be47f5af89277b30.png)
both have a coefficient of zero for 
.
be the 
.![\[\sigma (R - r_1, e) = \sigma (R - r_2, e) = 0\]](http://latex.artofproblemsolving.com/5/2/2/522bd58044f617a66ea8f8b90f0425ae0e8b19f2.png)
![\[\iff r_2 \sigma (R - r_1 - r_2, e - 1) + \sigma (R - r_1 - r_2, e) = r_1 \sigma (R - r_1 - r_2, e - 1) + \sigma (R - r_1 - r_2, e) = 0\]](http://latex.artofproblemsolving.com/6/0/f/60f8bfc9154e01db0bcc4ce2d89edade126804cf.png)
.
.
as well.
has two consecutive zero coefficients for 
for some 
) 
,
where the derivative is zero meaning there are 
instances where the derivative is zero. Therefore, since there cannot be additional roots by FToA, the derivative of the polynomial also has distinct real roots.
t
![\[S_k^2>S_{k-1}S_{k+1}\]](http://latex.artofproblemsolving.com/e/4/2/e421088351a0853730bc23fb7ef1ce1c9abae64d.png)
for non-zero 
,
is the normalized version of the elementary symmetric polynomials of 
