Generates partitions of a positive integer
Project description
partitions
In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers.
For example, the partitions of 5:
5
4 + 1
3 + 1 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 + 1
2 + 2 + 1
3 + 2
Setup and run
pip3 install partitions
To run on the command-line:
$ partitions 11
11
10 + 1
9 + 1 + 1
8 + 1 + 1 + 1
7 + 1 + 1 + 1 + 1
...
You can also use this in code:
from partitions import partitions
list(partitions(5)) # returns [(5,), (4, 1), (3, 1, 1), (2, 1, 1, 1), (1, 1, 1, 1, 1), (2, 2, 1), (3, 2)]
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
partitions-1.0.0.tar.gz
(2.4 kB
view hashes)
Built Distribution
Close
Hashes for partitions-1.0.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0c8f148191e333b3d97f176f94ed8cadc88c664122d7f3a82528fadcfe1c7d17 |
|
MD5 | 079f2fffa5e918f4c32e3376869f531d |
|
BLAKE2b-256 | 0dd9523cd8498f01a9b638c0b139ca61dd762d8befd5a42c41b2034696ecc189 |