Practical implementation and numerical results of original theorems for primality in specific intervals

This paper demonstrates the practical application of original theorems developed for determining the primality of numbers within defined intervals. Following the theoretical proof, we focus on the numerical realization of these findings. By applying the proposed mathematical framework, we provide concrete computational results that validate the theorems' efficiency. Unlike standard primality tests, this approach relies on the specific properties established in the author’s theoretical work, offering a new perspective on the behavior of prime numbers in restricted ranges.