Goblin of Mathematics

<p>Parity is the mischievous goblin of mathematics.</p><p><br></p><p>It behaves so simply - numbers are even or odd - but it governs impossibly large structures with unnerving authority. When you spotted that “only the total sum matters,” you actually tapped into a deeper principle:</p><h3>Many problems live not in full arithmetic, but in <strong>arithmetic mod 2 </strong>(a two-element group often called 𝑍₂).</h3><p>In 𝑍₂, addition works like XOR:</p><ul><li>0 + 0 = 0</li><li>1 + 0 = 1</li><li>1 + 1 = 0 (wraps around)</li></ul><p>Even numbers are 0, odd numbers are 1.</p><p>Suddenly a whole array of integers collapses into something tiny. Instead of thinking about big sums, you think: sum of array mod 2 = parity of number of odd elements. That single bit controls everything.</p><h2>When you split an array, you aren’t splitting sums - you’re splitting that one bit.</h2><p>Let the total sum be: <code>T=left+right</code></p><p>Now in 𝑍₂: <code>left-right)%2 = (left+right)%2 = T mod 2</code></p><p>So the difference parity doesn’t know or care about:</p><ul><li>where you split</li><li>what the individual numbers are</li><li>how many partitions exist</li></ul><p>It only knows the <strong>parity of the entire array</strong>.</p><p>One bit rules them all.</p>