A commons library for Project Euler problems.
Project description
Leonhard
A commons library for Project Euler problems.
Installation
pip install leonhard
Usage
>>> from leonhard import leonhard
>>> print(leonhard.get_factors_of_positive_integer(10))
[1, 2, 5, 10]
Functionalities
get_factors_of_positive_integer
: Gets the factors of a given positive integergenerate_fibonacci_sequence
: Generates a Fibonacci sequenceis_prime
: Checks if a number is prime or notis_pythagorean_triplet
: Checks if a^2 + b^2 = c^2 where a < b < ccount_digits
: Counts the number of digits of a given numbergenerate_collatz_sequence
: Generates a collatz sequence
Samples
Sample files are found in samples/
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
leonhard-1.4.0.tar.gz
(6.4 kB
view hashes)