Skip to main content

A primer for prime numbers

Project description

Brute force functions for teaching purposes. Not performant.

To use as a package:

>>> import primer
>>> primer.primes(10)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
>>> primer.prime(10)
29
>>> primer.primorial(10)
6469693230
>>> pg = primer.pgf()
>>> pg.next()
2
>>> pg.next()
3
>>> pg.next()
5
>>>

To use as a script:

$ python -m primer [-h] [-t] [N]

Display the first N primes.

positional arguments:

N Number of primes to generate (default: 100)

optional arguments:
-h, --help

show this help message and exit

-t

Display elapsed time (default: False)

Version 1.1.1 2015-03-25

  • Update README.

Version 1.1 2015-03-25

  • Add primorial function.

Version 1.0.2 2015-03-25

  • Fix keywords.

Version 1.0.1 2015-03-25

  • Release testing.

Version 1.0 2015-03-23

  • Initial release.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

primer-1.1.1.zip (14.3 kB view details)

Uploaded Source

File details

Details for the file primer-1.1.1.zip.

File metadata

  • Download URL: primer-1.1.1.zip
  • Upload date:
  • Size: 14.3 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for primer-1.1.1.zip
Algorithm Hash digest
SHA256 145110d321cea969ecac57729b138105e7447ed4f8ff4cb3e99f5c02323d3d50
MD5 4fecfc730af33c94074f82fdd8daeb52
BLAKE2b-256 da5a2c32c5d30a73405ad6e25b85112c0bd3bb185296c5737e31fb694f856d95

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page