How does the tool handle repeated elements?

It treats repeated elements as a multiset, using deduplication algorithms to ensure each permutation, combination, or subset appears only once.

What is the maximum input size?

The generator accepts up to 12 items per run.

Why is the displayed output limited to 200 entries?

The display is capped at 200 rows to maintain browser performance, but the calculated count always reflects the exact mathematical total.

When is parameter k used?

Parameter k is required only for Combinations mode to define how many items to choose per group; it is ignored in Permutations and Subsets modes.

Does subset generation include the empty set?

Yes, the subset mode generates the complete power set of the multiset, starting with the empty set (∅).

Elysia Tools

Navigation

Math & Numbers

Permutation / Combination / Subset Generator (With Repeats)

Deduplicated, lexicographic permutations / combinations / subsets of up to 12 items with exact multiset counts; display capped at 200 entries.

Execution

Run this tool

Fill in the form, run the tool, and review the result in one place.

Prepared example runs

Click an example to fill the form automatically. File inputs still need an upload.

2 examples

Permutations of A, B, C → 6 orderings from A B C to C B A

All items distinct, so the count is the plain factorial 3! = 6; next_permutation walks them in lexicographic order starting at A B C and ending at C B A. With repeated items the same machinery deduplicates automatically — e.g. [A, A, B] gives only 3!/2! = 3 rows.

Combinatorial generation — permutations Items: [A, B, C] (3 distinct items, no repeats) Count: 3! = 6 1. A B C 2. A C B 3. B A C 4. B C A 5. C A B 6. C B A Showing all 6 results.

Subsets of A, A, B → 6 sub-multisets, count (2+1)(1+1) = 6

Repeated items collapse the power set: A appears at most twice and B at most once, so the exact count is (2+1)(1+1) = 6 sub-multisets including the empty set — {∅, A, A A, A A B, A B, B} — listed in lexicographic order rather than the 2³ = 8 subsets distinct items would give.

Combinatorial generation — subsets Items: [A, A, B] (multiset: A×2, B×1) Count: (2+1)·(1+1) = 6 distinct sub-multisets (including the empty set) 1. (empty) 2. A 3. A A 4. A A B 5. A B 6. B Showing all 6 results.

Inputs

Set the required fields, then run the tool.

4 options

ContentPaste or type the main input values.1

Items (may repeat)textRequired1–12 items separated by commas or spaces; duplicates like 'A, A, B' are supported and only distinct results are generated.

SettingsAdjust formats, ranges, numbers, and modes.3

Generation modeselectRequiredSize k (combinations only)numberOptionalHow many items each combination holds; ignored in the permutations and subsets modes.Decimal PlacesnumberOptional

Result

Ready for a run

Run the tool to preview files, text, structured data, or streamed output here.

Samples

Permutation / Combination / Subset Generator (With Repeats)

Run this tool

Prepared example runs

Inputs

Result

Examples that match this tool

Continue with connected tools and hubs

Prepared example runs

Inputs

Result

Learn when to use this tool, what it supports, and how real users apply it.

Key facts

Overview

When to use

How it works

Use cases

Examples

1. Generating Unique Anagram Orderings with Repeated Letters

2. Selecting 2-Item Subsets from an Inventory with Duplicates

FAQ

Copyright-Free FLAC Audio Samples

Copyright-Free WAV Audio Samples

Web Image Processing Python Samples

Android Image Processing Java Samples

Three-Phase Short-Circuit Current Calculator (IEC 60909)

Zero-Sum Game Solver (Saddle Point / Linear Programming)

Inverse Laplace Transform Calculator (Partial Fractions)

Laplace Transform Calculator (Table Lookup)

Audio Encoding and Format Conversion Tools

Image Format Conversion and Animated Export Tools

JSON Interchange and Format Translation Tools

Color Space Conversion Tools for Web and Print