Elysia Tools

Browse tools, examples, visual explainers, and topic guides from one clear workspace.

Top Categories

Hubs

Language
ZHDERUPTENFRES

Elysia Tools

Navigation

Math & Numbers

Permutation / Combination / Subset Generator (With Repeats)

· Last updated:2026-08-26

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.

Samples

Examples that match this tool

Related

Continue with connected tools and hubs

Written by the Elysia Tools team

Tool usage guide

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

Key facts

Category
Math & Numbers
Input types
select, text, number
Output type
text
Sample coverage
4
API ready
Yes

Overview

The Permutation, Combination, and Subset Generator calculates and enumerates unique lexicographic arrangements, selections, and sub-multisets for up to 12 items. It automatically deduplicates inputs containing repeated elements and provides exact mathematical counts alongside up to 200 generated entries.

When to use

  • You need to list every unique anagram or ordering from a set of characters or words containing duplicate elements.
  • You want to find all distinct combinations of size k chosen from an inventory with repeated item types.
  • You are exploring discrete math or power set problems and need to enumerate all unique sub-multisets including the empty set.

How it works

  1. 1Enter between 1 and 12 items separated by commas or spaces, including duplicates if applicable.
  2. 2Select a generation mode: Permutations (all distinct full-length orderings), Combinations (distinct selections of size k), or Subsets (the full power set).
  3. 3Specify the selection size k if running in combinations mode.
  4. 4View the calculated multiset formula, exact total count, and the lexicographically ordered list of results capped at 200 entries.

Use cases

  • Discrete mathematics students verifying multiset permutation and combination formulas against enumerated sets.
  • Game designers calculating distinct hand configurations or dice outcome orderings with repeated symbols.
  • Software developers testing algorithmic test cases requiring deduplicated lexicographic permutations.

Examples

1. Generating Unique Anagram Orderings with Repeated Letters

Word Game Designer

Background

A game designer needs to verify all distinct 4-letter arrangements formed by the letters in 'A, A, B, C'.

Problem

Manual calculation often produces duplicate arrangements due to the repeated letter 'A'.

How to use

Set Mode to 'Permutations (all orderings)' and enter 'A, A, B, C' in the Items input.

mode: permutations, items: A, A, B, C

Outcome

Calculates an exact count of 4!/2! = 12 distinct permutations and lists them in lexicographic order from 'A A B C' to 'C B A A'.

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

Math Teacher

Background

A teacher is creating an assignment on multiset combinations where students choose 2 tokens from a bag containing 2 red tokens and 1 blue token.

Problem

The teacher needs a reference list showing all unique 2-token combinations without duplicate pairs.

How to use

Select 'Combinations (choose k)' mode, set Size k to 2, and enter 'Red, Red, Blue' into the Items field.

FAQ

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 (∅).

Home
Tools3212
Samples593
Visualizations471
Viewers103
Hubs239
Tags333
Images, Audio & Video657

Image, audio, and video processing, conversion, and optimization tools

Math, Date & Finance647

Calculators, numerics, date logic, statistics, and finance tools

Design & Color298

Color, layout, graphics, visual styling, and design helper tools

Text & Writing209

Writing, cleanup, formatting, extraction, and text analysis tools

Developer & Web193

Developer utilities, networking, web debugging, and automation helpers

Conversion & Encoding175

Format, file, archive, unit, and encoding conversion tools

Lead Generation Quiz Launch and Contact Handoff
Memorial Drafts: Family Review and Print Handoff
Private Habit Records: Backup, Restore and Sharing Review
Article to X and LinkedIn Drafts: Fact Review and Handoff
Markdown Interactive Deck Review and Offline Handoff

© 2026 Elysia Tools. All rights reserved.

DocsPricingAboutTerms of ServicePrivacy PolicyCookiesContact
Media

Copyright-Free FLAC Audio Samples

Lossless FLAC audio samples for testing and development, mirrored from MP3 set with nature sounds and meditation music

Media

Copyright-Free WAV Audio Samples

Uncompressed PCM WAV audio samples for testing and development, mirrored from MP3 set with nature sounds and meditation music

Python

Web Image Processing Python Samples

Web Python image processing examples using PIL/Pillow including reading, saving, resizing, and format conversion

Java

Android Image Processing Java Samples

Android Java image processing examples including reading/saving images, scaling, and format conversion

Math & Numbers

Sieve of Eratosthenes (Prime List Generator)

Enumerate primes up to 10⁷ (or within [m, n]) with the classic sieve; shows base primes, crossing-out operations, exact counts, and up to 200 primes.

Math & Numbers

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

Estimate the three-phase symmetric short-circuit current using the IEC 60909 far-from-generator method: I"_k = c·U_n/(√3·|Z|) and i_p = κ·√2·I"_k with κ = 1.02 + 0.98·e^(−3R/X). Source impedance is the series sum of transformer and line R/X.

Math & Numbers

Carmichael Function λ(n) Calculator

Group exponent λ(n) from prime factorization with φ(n) comparison, primitive-root existence, Korselt's Carmichael-number detection, and optional sample-unit verification.

Math & Numbers

Chinese Remainder Theorem Solver (System of Congruences)

Generalized pairwise-merge CRT for 2–20 congruences: coprime moduli give the product modulus, consistent non-coprime moduli give the lcm, inconsistent systems are rejected.

mode: combinations, items: Red, Red, Blue, k: 2

Outcome

Generates the 2 distinct combinations: [Red, Red] and [Red, Blue], with the exact multiset coefficient count.