Discrete mathematics (source code)

= Discrete mathematics
{wiki}

<Discrete mathematics> studies structures built from distinct objects and finite or countable choices. Its main connections include <combinatorics>, <graph theory>, <number theory>, <mathematical logic> and the analysis of <algorithms>. The distinction concerns the structures under study, rather than a ban on using <real numbers> or <analysis> in proofs.

For example, a <graph> with $n$ vertices has $\binom n2$ possible unordered edges when loops and repeated edges are excluded. Counting possible <edge sets> gives $2^{\binom n2}$ labeled <simple graphs>. A small modeling assumption about allowed edges has turned a structural question into an exact counting formula. Such translations underpin scheduling, networks and <computer science>.