Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Discrete objects can often be characterized by integers, while continuous objects require real numbers. Examples of structures studied in discrete mathematics include integers, graphs, and statements in logic. Discrete structures can be finite or infinite. The study of how discrete objects combine with one another and the probabilities of various outcomes is known as combinatorics. Other fields of mathematics that are considered to be part of discrete mathematics include graph theory and the theory of computation. Discrete mathematics is the mathematical language of computer science, and as such, its importance has increased dramatically in recent decades. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. Discrete mathematics is also a prerequisite for mathematics majors in some universities.