Starlight Tools directory
Discrete Mathematics Calculators
32 free, browser-based tools. No account required.
- Free to use
- Runs in your browser
- No account required
Explore finite structures, counting methods, formal logic, and emergent systems with interactive discrete mathematics tools. Analyze divide-and-conquer complexity with the Master Theorem Calculator, generate recursive sequences with the Recurrence Relation Calculator, calculate cycle counts and set partitions with the Stirling Numbers and Bell Numbers Calculator, solve simultaneous congruences with the Chinese Remainder Theorem Calculator, calculate congruences, inverses, and powers with the Modular Arithmetic Calculator, convert graph edges into a labeled table with the Adjacency Matrix Generator, analyze graph structure with the Graph Theory Calculator, test degree sequences with the Degree Sequence Graphicality Checker, convert between labeled trees and sequences with the Prüfer Code Encoder and Tree Decoder, find a trail that uses every edge once with the Euler Path and Circuit Finder, compare queue-based and stack-based traversal with the BFS and DFS Graph Visualizer, arrange DAG dependencies with the Topological Sort Calculator, find a minimum vertex coloring with the Graph Coloring Calculator, test two-colorability and find odd-cycle witnesses with the Bipartite Graph Checker, find minimum-weight routes with the Shortest Path Calculator, build a cheapest connecting tree with the Minimum Spanning Tree Calculator, generate ordered tuples with the Cartesian Product Calculator, test finite relations with the Binary Relation Properties Calculator, find relation partitions with the Equivalence Relation and Equivalence Class Calculator, draw posets with the Hasse Diagram Generator, compute relation reachability with the Transitive Closure Calculator, inspect Boolean closure one intermediate vertex at a time with the Warshall Algorithm Reachability Matrix Calculator, generate every subset with the Power Set Calculator, compare finite sets with the Set Operations Calculator, count a union from its intersections with the Inclusion–Exclusion Principle Calculator, compare formulas with the Logical Equivalence Checker, convert propositions with the CNF and DNF Converter, simplify small Boolean functions visually with the Karnaugh Map Simplifier, evaluate propositions with the Truth Table Generator, calculate arrangements with or without repetition using the Permutation & Combination Calculator, or experiment with Conway’s Game of Life.
About These Discrete Mathematics Tools
Discrete mathematics studies countable structures and processes. This collection covers recurrence sequences, modular arithmetic, graph theory, finite sets, binary relations, propositional logic, combinatorial counting, and cellular automata, with room to expand into Boolean algebra.