This is a failed attempt of mine at creating a contest problem; the failure is in the fact that I wasn't able to solve it myself.
Let x1, x2, ..., xn be n reals. For any integer k, define a real fkleft(x1,x2,...,xnright) as the sum
sumlimitsTsubseteqleftlbrace1,2,...,nrightrbrace; left|Tright|=kleft|sumlimitstinTxt−sumlimitstinleftlbrace1,2,...,nrightrbracesetminusTxtright|.
We mostly care about the case of n even and k=fracn2; in this case, fkleft(x1,x2,...,xnright) is a kind of measure for the dispersion of the reals x1, x2, ..., xn (more precisely, of their fracn2-element sums).
Now my conjecture is that if n is even and k=fracn2, then
fkleft(x1,x2,...,xnright)geqfkleft(left|x1right|,left|x2right|,...,left|xnright|right)
for any reals x1, x2, ..., xn.
I think I have casebashed this for n=4 and maybe n=6; I don't remember anymore - it's too long ago. Sorry. I still have no idea what to do in the general case, although my attempts at big-n counterexamples weren't of much success either.
No comments:
Post a Comment