Restricted Integer Partition Workbench
Count unordered integer partitions with part-size, distinctness and exact-length constraints, then inspect a bounded example list.
Loading tool…
How to use Restricted Integer Partition Workbench
A two-dimensional exact dynamic program counts each allowed part size and number of parts. Repeated parts and distinct parts use different update orders. A separate bounded traversal lists nondecreasing examples without treating their order as a new partition.
- Enter integer target, largest allowed part, exact k (used only in exact mode).
- Choose the stated convention and check the units and supported model.
- Calculate, inspect the result, then copy or download it.
Good to know
- Target 0–200, largest part 1–200, and optional exact number of parts 0–200. Counts use exact integers. Examples stop at 50 solutions or 20000 traversal visits; the truncation flag compares the list with the exact count. The empty partition is one solution for target zero with zero parts. These are unordered positive-integer partitions, not ordered compositions or subset selections from a supplied set.
- Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.
Common questions
Are 1+2 and 2+1 separate answers?
No. A partition ignores ordering. The example list uses nondecreasing parts to represent each answer once; distinct-parts mode additionally forbids using the same part value twice.
Is the input uploaded or saved?
No. The tool calculates inside this browser tab and provides a local download; it does not persist your input.
Keep going with related tools
All education →Combinations and Permutations Calculator
Count selections and ordered arrangements without repetition using exact integer arithmetic.
EducationCombination and Ordered Selection Ranking
Rank or recover a combination or ordered selection by exact zero-based lexicographic index without enumerating all objects.
EducationExact Linear Recurrence Workbench
Generate an integer sequence from your own finite-order recurrence and inspect exact indexed terms without expression evaluation.