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

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.2.1 2015-03-25

  • Update README.

Version 1.2 2015-03-25

  • Mark prime generator function private.

  • Update docstrings.

  • Fix test module name.

  • Rename test data.

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.2.1.zip (14.4 kB view details)

Uploaded Source

File details

Details for the file primer-1.2.1.zip.

File metadata

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

File hashes

Hashes for primer-1.2.1.zip
Algorithm Hash digest
SHA256 84baa559afbefcf1f55dd29c734f1df19e205a23dc03a91af5605cea9bd39546
MD5 2d460a8c77a696084f98051f064d256d
BLAKE2b-256 cbfaeab56cedde5ec963aa4dfa0f2c6388d2f5340f37625a11e62dc53e6b1901

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