Discrete mathematics deals with areas of mathematics that are discrete, as opposed to continuous, in nature. Sequences and series, counting problems, graph theory and set theory are some of the many branches of mathematics in this category. Use Wolfram|Alpha to apply and understand these and related concepts.
Use the ideas of permutation and combination to find binomial coefficients or integer partitions or to do other forms of counting.
Compute binomial coefficients (combinations):
Compute a Frobenius number:
Find the partitions of an integer:
Compute the properties of these discrete subsets of Euclidean space. Deal with regular or rooted lattices. Compare them.
Compute the properties of a lattice:
Compute the properties of a root lattice:
Compare several lattices:
Work with the famous function known for being a total computable function that is not primitive recursive.
Evaluate the Ackermann function:
Work with known graphs or specify your own via adjacency lists. Check for isomorphism, compute the shortest path and more.
Compute the properties of a named graph:
Compare several graphs:
Analyze a graph specified by adjacency rules:
Deduce patterns in incompletely specified sequences or series. Sum infinite series or perform other operations on them.
Compute a possible formula and continuation for a sequence:
Sum an incompletely specified infinite series:
GO FURTHERStep-by-Step Solutions for Discrete Mathematics
Solve recurrences, specify initial values or attempt to model sequences with recurrences.