The MokraBela Theorem (Version 2.0 — Corrected and Expanded) A New Algebraic Characterization of Prime Numbers via the Identity k(2n + k)

Version 2.0 (Corrected and Expanded) of the MokraBela Theorem paper. This version includes:• Full correction of all mathematical equations and notation (which were broken in Version 1)• 13 complete composite examples• 10 prime examples with full verification• 3-step practical primality testing method• Prime generation algorithm n² - n + p• Performance benchmarks on large numbers (up to 16 digits)• Verification of 2,613 discovered primes The original Version 1 has been intentionally left unchanged as the historical first upload. The MokraBela Theorem: An odd integer p > 1 is prime if and only if it cannot be expressed as k(2n + k) for any odd integer k ≥ 3 and any non-negative integer n ≥ 0.