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.0.1 2015-03-25
Release testing.
Version 1.0 2015-03-23
Initial release.
Project details
Release history Release notifications | RSS feed
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.0.1.zip
(13.6 kB
view details)
File details
Details for the file primer-1.0.1.zip.
File metadata
- Download URL: primer-1.0.1.zip
- Upload date:
- Size: 13.6 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
a05278c55a25c5abecb55db6743a7cbfbcf917e9b710705d0e68308bca6156ea
|
|
| MD5 |
293886d38ce54fcf90724716277d9eaf
|
|
| BLAKE2b-256 |
ab856403bc4edb115030e06890b9a8f474fdcbdebd19dfe452eafbae402a00e6
|