decimal expansion
21Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… …
22Cardinality of the continuum — In mathematics, the cardinality of the continuum, sometimes also called the power of the continuum, is the size (cardinality) of the set of real numbers mathbb R (sometimes called the continuum). The cardinality of mathbb R is often denoted by… …
23Mathematical constant — A mathematical constant is a special number, usually a real number, that is significantly interesting in some way .[1] Constants arise in many different areas of mathematics, with constants such as e and π occurring in such diverse contexts as… …
24Conway base 13 function — The Conway base 13 function is a function created by British mathematician John H. Conway as a counterexample to the converse of the intermediate value theorem. In other words, even though Conway s function f is not continuous, if… …
25Real number — For the real numbers used in descriptive set theory, see Baire space (set theory). For the computing datatype, see Floating point number. A symbol of the set of real numbers …
26real number — /ree euhl, reel/, Math. a rational number or the limit of a sequence of rational numbers, as opposed to a complex number. Also called real. [1905 10] * * * In mathematics, a quantity that can be expressed as a finite or infinite decimal expansion …
27Cauchy sequence — In mathematics, a Cauchy sequence, named after Augustin Cauchy, is a sequence whose elements become arbitrarily close to each other as the sequence progresses. To be more precise, by dropping enough (but still only a finite number of) terms from… …
28Liouville number — In number theory, a Liouville number is a real number x with the property that, for every positive integer n, there exist integers p and q with q > 1 and such that A Liouville number can thus be approximated quite closely by a sequence of… …
29Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… …
30Champernowne constant — In mathematics, the Champernowne constant C10 is a transcendental real constant whose decimal expansion has important properties. It is named after mathematician D. G. Champernowne, who published it as an undergraduate in 1933. In base 10, the… …
