Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In the problem, we are given a set of clauses, and we want to find an assignment that satisfies as many of them as possible.

share|cite|improve this question

You can expand the brackets that will give you $m - \sum_{j=1}^{m}(\frac{1}{2})^{k_j}$. Now using the fact that $k_j \geq 1$ you can show that $(\frac{1}{2})^{k_j} \leq \frac{1}{2}$. Upper bound each term in the sum and you will obtain the desired inequality.

share|cite|improve this answer
what do you mean upper bound each term? – skill sim Dec 3 '12 at 0:43
well, since each $(\frac{1}{2})^{k_j} \leq \frac{1}{2}$ then $\sum_{j=1}^{m}(\frac{1}{2})^{k_j} \leq \sum_{j=1}^{m}\frac{1}{2} \leq \frac{m}{2}$ – Alexander Zimin Dec 3 '12 at 0:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.