Skip to main content

A simple version of the Sieve of Eratosthenes. Developed during "Python for Scientific Computing" course at CINECA

Project description

colanderpy

A simple version of the Sieve of Eratosthenes.

Developed during "Python for Scientific Computing" course at CINECA

Install from source

Clone repository

gt clone https://gitlab.hpc.cineca.it/scai-training-rome/pycolander

and install

$ cd pycolander
$ python setup.py install

Install from Python Package Index (PyPI)

pip install pycolander

Usage

Prime number generator

$ sieve -n 42
2 3 5 7 11 13 17 19 23 29 31 37 41
$ sieve -h
usage: sieve [-h] [-n LIMIT]

The Sieve of Eratosthenes.

Returns the list of prime numbers up to a maximum integer.

optional arguments:
  -h, --help            show this help message and exit
  -n LIMIT, --limit LIMIT
                        maximum integer up to which the prime numbers are searched. (default 100)

Prime-counting function

$ prime-counting -n 42
13
$ prime-counting -h
usage: prime-counting [-h] [-n LIMIT]

Prime-counting function

Counts the number of prime numbers less than or equal to an integer number.

optional arguments:
  -h, --help            show this help message and exit
  -n LIMIT, --limit LIMIT
                        maximum integer up to which the prime numbers are counted. (default 100)

Project details


Download files

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

Files for colanderpy, version 0.4.1
Filename, size File type Python version Upload date Hashes
Filename, size colanderpy-0.4.1.tar.gz (2.5 kB) File type Source Python version None Upload date Hashes View hashes

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page