TOPICS
Search

Search Results for ""


1211 - 1220 of 2006 for Graph entropySearch Results
A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...
An important result in ergodic theory. It states that any two "Bernoulli schemes" with the same measure-theoretic entropy are measure-theoretically isomorphic.
Two losing gambling games can be set up so that when they are played one after the other, they become winning. There are many ways to construct such scenarios, the simplest ...
Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...
The binary logarithm log_2x is the logarithm to base 2. The notation lgx is sometimes used to denote this function in number theoretic literature. However, because Russian ...
The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...
The branch of mathematics dealing with the efficient and accurate storage, transmission, and representation of information.
Jenny's constant is the name given (Munroe 2012) to the positive real constant defined by J = (7^(e-1/e)-9)pi^2 (1) = 867.53090198... (2) (OEIS A182369), the first few digits ...
The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...
For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...
1 ... 119|120|121|122|123|124|125 ... 201 Previous Next

...