,
to be the least positive integer for which the following holds:
into 
disjoint subsets 
,
.
for which![\[\deg(P_i(x)-P_j(x))\geq \frac{n}{k}-f(n)\]](http://latex.artofproblemsolving.com/2/0/9/2092eb944c746d1449e7865f9da4e0065b75bdef.png)
so that 
for all 
.
be an acute triangle with orthocenter 
and circumcircle 
.
and 
at 
and 
,
be the circumcenter of 
,
intersects 
.
and the line through 
meet on 
and the domain 
passing through the origin touch 
be a mobile point on the parabola 
the distances between the point 
on a coordinate plane such that for all points 
over the domain 
holds.
be the open unit disk in the complex plane and let 
be a holomorphic function such that 
.
be 
.
.
we have the inequality 
,
,
(where the sum has 
is the order of the quotient group 
(the index of the subgroup 
)
![$\{x_n\} \subseteq [0,1]$](http://latex.artofproblemsolving.com/8/e/4/8e4206325387485d73765c9d7070ecb1ce18ff60.png)
,
,
and 
could be chosen to satisfy 
and 
.
Such That 
is even?
Then 
But I am stuck. I came across this functional equation by trying to find a limit of a sequence, I can show that if it is helpful. 
has solutio
satisfy 
for all 
.
be a fixed circle, and let 
be a point outside 
.
and 
,
is cyclic, where 
are fixed points on the circle.
,
,
is the tangent from 
is the point of tangency.
,
,
is perpendicular to chord 
.
and 
lie on a circle, their cross-ratio is harmonic:![\[
(ANMB) = -1.
\]](http://latex.artofproblemsolving.com/b/d/5/bd5301ba76f493aec0821c454dffc46dea93c0f2.png)
- The intersection points 
,
![\[y''+by'+cy=g(t)\]](http://latex.artofproblemsolving.com/7/8/8/7882dc954ab6dba2445b68d370d630ce1c66a6db.png)
with 
,
are constants has the form ![\[y(t)=\int^{t}_{t_0}K(t-s)g(s)ds\,\]](http://latex.artofproblemsolving.com/6/3/c/63c34df1c0013bf659bc76506a93873a5f879070.png)
and use variation of parameters in each case to find the solution. Is there any short way to calculate solution?
that exist function 
such 
and discontinuous on 
Y by NO_SQUARES
A 
-sequence is a sequence of 
numbers 
each equal to either 
or 
. Determine the largest 
so that, for any -sequence, there exists an integer 
and indices 
so that 
for all 
, and 
-sequence is a sequence of 
numbers 
each equal to either 
or 
. Determine the largest 
so that, for any -sequence, there exists an integer 
and indices 
so that 
for all 
, and 
This post has been edited 7 times. Last edited by ike.chen, Aug 6, 2023, 10:00 PM
Reason: Typo
Reason: Typo
.
.
,
of the 
blocks with entries 
entries 
.
,
entries 
.
positive numbers in the initial sequence. We then choose all entries 
.
then one of the two adjacent 
must be landed on, therefore at least half a kind must be landed on, so with 
buckets in a string of length 
red buckets and 
,
,
.
ones. We will choose the 
as follows: divide the sequence into blocks of 
'
of the 
,
doesn't work, we will take the sequence 
,
and 
.
.
.
.
(since we have an unit block).
,
.
,
in a gap(so say if we have 
we go through indices 
)
be the number of 
![\[C\le \text{max}\left(x-\frac{2022-x}{2},2022-x-\frac{x}{2}\right) = \text{max}\left(\frac{3x-2022}{2},\frac{4044-3x}{2}\right).\]](http://latex.artofproblemsolving.com/6/a/5/6a5f591b76bc00b336a54b13be6c0f53529a63fd.png)
This is the maximum of two numbers that sum up to 
,
,
is repeated 
is added to it. Notice the maximal sum we can get in each block of 
is 
is 
.
is 
,
.
numbers 
,
numbers 
In a block of 
numbers. Therefore, sum of 
So for every 
.
.
denote the number of 1s and -1s respectively. For each block of 
of them. Then the problem follows since![\[
c(1) - \sum_{\text{block of } x} \left\lfloor \frac x2 \right\rfloor \geq 1011 - \left\lfloor \frac{1011}{2} \right\rfloor = 506,
\]](http://latex.artofproblemsolving.com/c/f/e/cfea26dd28791bf66b1bd3133071a94e083c9bff.png)
as desired.
.
,
We will first prove a crucial lemma.
that satisfy the condition in the problems. Then, for any positive integer 
,
is in 
,
.
,
.
,
,
.
a contradiction. 
is maximized. Clearly 
,
gives the absolute value of the sum to be 
,
.
and 
as 
,
in the sequence of indices (i.e. making the new sequence of indices 
)
increase by 
over all 
,
which will make the absolute value of the sum bigger, contradicting the maximality of it. So we must have 
.
,
for which 
,
since 
since 
is 
and 
by the minimality of 
must be in 
.
is positive, so its absolute value is at least that of 
,
is maximal as well, so we may assume that 
,
and get a maximal 
,
.
for all 
.
,
,
are in 
'
has 
if 
if 
for some 
.
is at most 
,
,
of them. By the lemma, we have that for each odd 
,
,
,
.
,
of 
as desired.
.
for all 
,
so 
Now, note that 
is a valid sequence since 
,
for all 
,
Thus, we have that 
as desired.
so for any 
.
.
which would have at least as many 
,
for some 
for the same 
.
'
.
in order, where 
is the set of all 
.
,
,
'
odd numbers in 
,
so since all the 
'
Thus, we have that 
as desired.
works, so we're done. 
denote the sum in question; we seek the minimum of 
over all sequences 
.
,
terms; by symmetry, we can maximize the raw value of 
are among the chosen 
,
adjacent to but not among the chosen terms, we can include the terms 
whilst preserving conditions and incrementing 
.
,![\[S\le1-1+1+1-1+1+1-\dots-1+1+1=506,\]](http://latex.artofproblemsolving.com/a/4/e/a4edb6655d8673f0313b3ee5cb49f401abc79c1e.png)
as claimed.
denote the lengths of contiguous blocks of consecutive 
similarly. To maximize the magnitude of 
.
.![\[|S|_1=\sum_{i=1}^mr_i-\sum_{i=1}^n\left\lfloor\frac{b_i}{2}\right\rfloor\quad\text{and}\quad|S|_2=\sum_{i=1}^nb_i-\sum_{i=1}^m\left\lfloor\frac{r_i}{2}\right\rfloor\]](http://latex.artofproblemsolving.com/9/e/e/9eee5587035a47838e0dd5531df0dc0070f75850.png)
are both attainable. Summing, we have![\[|S|_1+|S|_2=\left(\sum_{i=1}^mr_i+\sum_{i=1}^nb_i\right)-\left(\sum_{i=1}^n\left\lfloor\frac{b_i}{2}\right\rfloor+\sum_{i=1}^m\left\lfloor\frac{r_i}{2}\right\rfloor\right)\ge2022-1011=1011,\]](http://latex.artofproblemsolving.com/5/1/2/51203d84ec9ce9aa552193e894e9702c98107368.png)
whence one of 
are 
,
By a straightforward check the exact bound is obtained for the sequence 
numbers respectively 
probably 
or 
equal to 
)
As a strategy lets pick all 
and in each block of 
instead of 
in the sigma notation?![\[\left| \sum_{i=1}^{k} a_{t_i} \right| \geqslant C.\]](http://latex.artofproblemsolving.com/7/7/b/77b6ddf8f9cbcab9c87ada489f8de339cf90f594.png)
in addition. In each 
we can get at most 
.
are the number of 
total then we have on a fixed sequence:
,
.
of the 
of the 
.
.
and the minimum is 
.![\[M+(-m)=\left \lceil \frac{a}{2}\right \rceil + \left \lceil \frac{b}{2}\right \rceil\]](http://latex.artofproblemsolving.com/b/0/c/b0c4a1ab52e28530605566f241d3e6381d38ed29.png)
which is equal to 
.
Here 
which on summing would give 
where 
are the sequence of 
are the sequences of 
,![\[ \sum \left\lfloor x_i/2 \right\rfloor \le \left\lfloor (x_1+x_2+\dots)/2 \right\rfloor \le 505, \]](http://latex.artofproblemsolving.com/b/a/d/badff2a6857ed7f674c8e55113ee4bccc04a9f71.png)
so adding in all of the positive terms yields that 
![\[\underbrace{+1, \, +1, \, \ldots, \, +1}_{1011}, \, \underbrace{-1, \, -1, \, \ldots, \, -1}_{1011}.\]](http://latex.artofproblemsolving.com/1/6/5/165b995f3f164decf633b4aeced6b2bc9c2edf1f.png)
Then our subsequence 
;
.
,
,
Clearly it is optimal for Sally to begin on a ``block" of red buckets as if she begins on blue, she may just shift one ``block" back. Thus say she attempts to maximize 
.
,
,
and blocks of blue buckets 
,
,
.
to begin at, and a block 
to end at.
.
Then we guarantee at least,
and hence we are done. 
for subsequence 
to be the sum of the lengths of consecutive subsequences of 
in subsequence 
is the number of 
,
.
,
.
satisfies the conditions. Observe that both 
and 
are equal to 
followed by 
negative ones. Then, in each consecutive group of negative ones we can eliminate at least half of them so there are at most 
negative ones left. Hence, the sum is at least 
,
of them. So there exists a sequence with at least 
.
Now for the lower bound, suppose the number of 
through 
and similarly the number of 
.
and thus,
.
.
.
and 
pick 
and if 
pick 
.
.
.
so by repeating the same algorithm from the start (without forgetting about the last number) we can choose every positive number and skip at least 
negative numbers so the sum will be at least 
.
with 
.
of these 
.
of these 
of 
of them and hence 
,
.
,
we have we can guarantee a sum at least 
é 
o 
e 
o 
-
e 
alternadamente entre os termos de 
começando com 
.
e, para cada 
Como queríamos mostrar.
?
,
of the 
is at least 
.
,
In particular, consider the sequence
Where the first term is 
somehow (if we can find 
,
)
,
.
WLOG.
.
.
.![$[a_1, a_{t_k}]$](http://latex.artofproblemsolving.com/2/d/8/2d83cb5e1158d65c0ff5d94068275011262f7565.png)
;
,
.
But note that 
,
.
.
(the leftmost group of plusses aren't countable in the range), so 
yet again as desired.
Consider the following algorithm 
with 
.
is positive, let 
,
.
.
groups of length 
respectively.
while the other one gives us 
. Therefore, the average value of 
Since the average of 
,
and 
respectively. WLOG assume 
.
.
Here there are 
Similar work holds if we let the number of 
ones in our sequence, so that there are 
negative ones. As before, we choose our sequence 
where 
In a run of 
of them, requiring us to choose 
of them. Therefore, when we choose the sequence which satisfies this, we get our sum is 
Since the sum is an integer, it is at least 
showing sufficiency.
as claimed.
Consider all the 
)
It is easy to check that the maximum possible sum in this case is 506.
