Hi all,

I would appreciate if someone could help me with this question.

How I can ,using Chebyshev inequality, prove that a least of all bitstrings of length n have hamming weight that could satisfy the following relation . wt(x) is hamming wieght.

Thanks in advance

Regards,