https://github.com/samdney/primescalc

Paper about prime numbers and how they can be calculated recursively.
https://github.com/samdney/primescalc

Last synced: 9 months ago
JSON representation

Paper about prime numbers and how they can be calculated recursively.

• Host: GitHub
• URL: https://github.com/samdney/primescalc
• Owner: Samdney
• License: other
• Created: 2017-04-18T02:46:34.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2020-02-22T13:47:39.000Z (over 6 years ago)
• Last Synced: 2024-05-02T05:04:44.921Z (about 2 years ago)
• Language: Python
• Homepage:
• Size: 3.3 MB
• Stars: 2
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# primescalc

Paper about prime numbers and how they can be calculated recursively.

## About the paper

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](https://github.com/Samdney/primescalc/blob/master/doc/primescalc.pdf)  

id: notes_0000

## Summary

### What are prime numbers?

> "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]

[Pri] [https://en.wikipedia.org/wiki/Prime_number](https://en.wikipedia.org/wiki/Prime_number)