Paper about prime numbers and how they can be calculated recursively.
The content of this repository is a draft (working) paper about how prime numbers can be calculated recursively. It's an on-going documentation of my private research work, hence it can contain mistakes or switching of notations, etc..
Main document: https://github.com/Samdney/primescalc/blob/master/doc/primescalc.pdf
id: notes_0000
"A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number." [Pri]