Then sum of even divisors is total minus odd:

["# Understanding the Sum of Even Divisors Compared to Total Divisors: A Complete Guide", "When exploring the properties of integers, one fascinating concept is the relationship between even divisors, odd divisors, and how their sums compare. This article delves into a key mathematical observation: the sum of even divisors of a number is equal to the total sum of all divisors minus the sum of its odd divisors. We’ll break down this principle, explain why it matters, and show how to calculate it efficiently — a valuable insight for number theorists, students, and programming enthusiasts alike.", "---", "## What Are Divisors and Why Split Them?", "Divisors of a number reveal essential information about its factors and structure. For any positive integer ( n ), a divisor is any integer ( d ) such that ( n \div d ) is also an integer. These divisors can be categorized as even or odd, depending on their parity.", "Breaking down divisors by parity helps uncover deeper number-theoretic patterns and aids in solving sum-related problems, especially in competitive programming and mathematical analysis.", "---", "## The Core Principle: Total Sum = Sum of Even + Sum of Odd Divisors", "For any positive integer ( n ), the sum of all positive divisors is denoted ( \sigma(n) ), sometimes expressed as ( \sigma(n) = \sum_{d|n} d ).", "A key identity emerges:", "> Sum of all divisors = Sum of even divisors + Sum of odd divisors", "Mathematically,\n[\n\sigma(n) = \left( \sum_{\substack{d|n \ d \ ext{ even}}} d \right) + \left( \sum_{\substack{d|n \ d \ ext{ odd}}} d \right)\n]", "This identity holds because every divisor is either even or odd (no number is both), and they partition the full set of divisors.", "---", "## Why the Property Matters", "Understanding this relationship simplifies computations and sheds light on divisor behavior:", "- Efficiency in Programming: When calculating ( \sigma(n) ), splitting into even and odd components can optimize algorithms, especially for large numbers or in programming contests.", "- Parity-Based Analysis: Helps determine special numbers — for example, perfect numbers or highly composite numbers — by examining divisor parity distributions.", "- Theoretical Insight: Plays a role in number theory problems involving divisibility, factorization patterns, and even-odd sum relations.", "---", "## How to Compute Sum of Even vs Total or Odd Divisors", "### Step 1: Factorize ( n )", "Begin with the prime factorization of ( n ):\n[\nn = 2^k \cdot m\n]\nwhere ( m ) is odd and ( k \geq 0 ). This decomposition isolates the even part from the odd part.", "### Step 2: Sum of All Divisors", "The sum of all divisors of ( n ) is computed using the divisor sum formula:\n[\n\sigma(n) = \sigma(2^k) \cdot \sigma(m)\n]\nSince ( \sigma(2^k) = 1 + 2 + 4 + \dots + 2^k = 2^{k+1} - 1 ), and ( \sigma(m) ) is computed normally for the odd part ( m ).", "### Step 3: Sum of Odd Divisors", "Because only the odd divisors come from the odd factor ( m ):\n[\n\ ext{Sum of odd divisors} = \sigma(m)\n]", "### Step 4: Sum of Even Divisors", "Then the sum of even divisors follows:\n[\n\ ext{Sum of even divisors} = \sigma(n) - \sigma(m) = \left( (2^{k+1} - 1) \cdot \sigma(m) \right) - \sigma(m) = (2^{k+1} - 2) \cdot \sigma(m)\n]\nAlternatively, factoring gives:\n[\n\ ext{Sum of even divisors} = 2(2^k - 1) \cdot \sigma(m)\n]", "This confirms:\n[\n\sigma(n) = \underbrace{(2^{k+1} - 1){\ ext{sum of all divisors}}} = \underbrace{(2^{k+1} - 2)}}} + \underbrace{\sigma(m)_{\ ext{odd divisors}}\n]", "---", "## Example: Let ( n = 12 )", "- Prime factorization: ( 12 = 2^2 \cdot 3 ), so ( k = 2 ), ( m = 3 )\n- ( \sigma(12) = \sigma(2^2) \cdot \sigma(3) = (1+2+4)(1+3) = 7 \cdot 4 = 28 )\n- Sum of odd divisors: divisors of 3 → ( 1 + 3 = 4 )\n- Sum of even divisors: ( 28 - 4 = 24 )\n- Check: even divisors of 12 are 2, 4, 6, 12 → sum = 2 + 4 + 6 + 12 = 24 ✅", "---", "## When Does This Property Simplify Problems?", "Suppose you’re asked: “What is the sum of even divisors of 36?” Instead of listing all 9 divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, compute:", "- ( n = 36 = 2^2 \cdot 9 ), so ( k = 2 ), ( m = 9 )\n- ( \sigma(36) = (1+2+4)(1+3+9) = 7 \cdot 13 = 91 )\n- ( \sigma(9) = 1 + 3 + 9 = 13 )\n- Sum of even divisors = ( 91 - 13 = 78 )", "Indeed, even divisors: 2, 4, 6, 12, 18, 36 → sum = 78 ✅", "---", "## Final Thoughts", "The identity — sum of even divisors equals total divisors minus odd divisors — is a cornerstone of divisor analysis. It bridges basic number properties with practical computation, making it essential in both theoretical and applied contexts. Whether solving math competitions, optimizing algorithms, or studying divisor behavior, understanding this sum relationship empowers deeper insight and efficiency.", "Let’s remember: in the world of integers, every divisor has its role — and subtracting the odd with totals reveals the even’s hidden strength.", "---", "## Key Takeaways", "- Every positive divisor is either even or odd, so their sums fully partition ( \sigma(n) )\n- Separating powers of 2 from odd prime factors enables efficient computation\n- The identity ( \sigma(n) = \ ext{even sum} + \ ext{odd sum} ) is foundational in number theory\n- Practical applications span programming, algorithm design, and mathematical research", "---", "## Further Reading & Resources", "- Divisor function properties in number theory\n- Fast computation of ( \sigma(n) ) using prime factorization\n- Perfect, amicable, and quasi-perfect numbers\n- Competitive programming problem #numberdivisorSum (leetcode, Codeforces)", "---", "Explore more about divisor functions, parity analysis, and integer properties — the deeper you go, the clearer the patterns shine!"]