Abstract
A necessary and sufficient condition for a positive integer to be prime is explored in terms of its number-theoretic ramifications and its generalization to arithmetic progressions. A computer experiment is shown describing how the main results were conjectured. Several open problems are posed for readers.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have