This paper introduces and proves the MokraBela Theorem (2026), a new algebraic characterization of odd prime numbers. The theorem states that an odd integer p > 1 is prime if and only if it cannot be expressed in the form: p = k (2n + k) for any odd integer k ≥ 3 and any non-negative integer n ≥ 0. The proof relies on the algebraic identity: k (2n + k) = (n + k) ² − n² which shows that the image of this function covers exactly the set of all odd composite numbers. The theorem provides an algebraic sieve alternative to the classical Sieve of Eratosthenes and is computationally verified for all odd integers up to 10, 000.
Ahmed Mokrane (Wed,) studied this question.