Skip to main content

A primer for prime numbers

Project description

To use as a package:

>>> import primer
>>> primer.primes(10)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
>>> primer.prime(10)
29
>>> 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 2015-03-25

  • Fix 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.zip (14.0 kB view details)

Uploaded Source

File details

Details for the file primer-1.1.zip.

File metadata

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

File hashes

Hashes for primer-1.1.zip
Algorithm Hash digest
SHA256 a5f901672abcc6c758416e07f758e4c22f4666f41cdd29c2fc60ad3cc7ad4e26
MD5 d2c5db3c71047dc5ec87f91108ef8654
BLAKE2b-256 b2f15f6ed3cd4312f0b413839d9b5448ed82882dc41fc092e9916a7aa421d7e4

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