title: compute parity by unsetting right most bit
body: <p>The first approach to computing parity is doing xor operation on every bit. - This was simple to understand.
  An enhancement to that is to drop the lower bit and keep inverting parity till the number becomes 0
  ie</p>
  
  <pre><code>While loop till number is greater than 0
  1) parity = parity^1
  2) number = number &amp; (number-1)
  </code></pre>
  
  <p>How does this work? It is a little more difficult to grasp the idea  of this method I guess.</p>