[/quote]
,
such that the equality 
holds for all pairs of real numbers 
.
is an obvious solution. Now, let 
.
or 
.
.
such that 
and 
.
be a given positive real and 
be the set of all positive reals. Find all functions 
such that ![\[f((c+1)x+f(y))=f(x+2y)+2cx \quad \textrm{for all } x,y \in \mathbb{R}_{>0}.\]](http://latex.artofproblemsolving.com/b/0/6/b069e7b7ec1e277f4a4ce85a99434fdb54eb02f3.png)
of the vertices of the regular polygon 
we write the number 
and in the remaining ones we write the number 
Let 
be the number written on the vertex 
A vertex is good if ![\[x_i+x_{i+1}+\cdots+x_j>0\quad\text{and}\quad x_i+x_{i-1}+\cdots+x_k>0,\]](http://latex.artofproblemsolving.com/b/f/4/bf4cf984af7f310c1eb90b6b37126bfca9181305.png)
for any integers 
and 
such that 
Note that the indices are taken modulo 
Determine the greatest possible value of 
satisfying ![$$(ab+bc+ca)\left[\frac{1}{(a+b)^{2}}+\frac{1}{(b+c)^{2}}+\frac{1}{(c+a)^{2}}\right]\ge \frac{9}{4}+k\cdot\frac{a(a-b)(a-c)+b(b-a)(b-c)+c(c-a)(c-b)}{(a+b+c)^{3}}$$](http://latex.artofproblemsolving.com/f/6/e/f6ed10f7fff1cc94edd8f451e75718a0916a8bfa.png)
holds for all 
be a scalene triangle, 
be the median through 
,
be the incircle. Let 
at point 
and segment 
meet 
.
be the triangle formed by lines 
be real numbers such that 
Prove that
Where 
Where 
are are the lengths of the sides of a 
g
then![$$(n-2)\left[\sum_{i=1}^{n}{\frac{a_i^2}{(1-a_i)^2}}-\frac n{(n-1)^2}\right]\geq(2n-1)\left(\sum_{i=1}^{n}{\frac{a_i}{1-a_i}}-\frac n{n-1}\right)^2.$$](http://latex.artofproblemsolving.com/9/3/e/93e5529518807b92cd9e0382f5fb07a293128b04.png)
and 
intersect at point 
and 
be a foot of the altitudes from 
and 
and let 
be the midpoint of 
.
cuts 
in half.
Y by anantmudgal09
Let 
be a positiv integer. Ana chooses the positive integers 
and for any non-empty subset 
she computes the sum ![\[s_A=\sum_{k
\in A}a_k.\]](//latex.artofproblemsolving.com/7/8/a/78afe6d1036a006b2252023d8f9619285fe0c6d5.png)
She orders these sums 
Prove that there exists a subset 
with 
elements such that, regardless of the integers chosen by Ana, these can be determined by only knowing the sums 
with 
be a positiv integer. Ana chooses the positive integers 
and for any non-empty subset 
she computes the sum ![\[s_A=\sum_{k
\in A}a_k.\]](http://latex.artofproblemsolving.com/7/8/a/78afe6d1036a006b2252023d8f9619285fe0c6d5.png)
She orders these sums 
Prove that there exists a subset 
with 
elements such that, regardless of the integers chosen by Ana, these can be determined by only knowing the sums 
with 
This post has been edited 1 time. Last edited by oVlad, Apr 12, 2025, 9:45 AM
and 
denotes the 
-
.
and 
are rather small, but all other 
'
not 
so it's useless information.
