Search Results for ""
91 - 100 of 208 for Bertrand's paradoxSearch Results
A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...
A flat disk that acts as a two-sided die.
A proposition which is consistent with known data, but has neither been verified nor shown to be false. It is synonymous with hypothesis.
The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...
A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...
A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...
A branch of game theory dealing with strategies to maximize the outcome of a given process in the face of uncertain conditions.
A formal argument in logic in which it is stated that 1. P=>Q and R=>S (where => means "implies"), and 2. Either not-Q or not-S is true, from which two statements it follows ...
Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).
A lattice which satisfies the identities (x ^ y) v (x ^ z)=x ^ (y v z) (x v y) ^ (x v z)=x v (y ^ z) is said to be distributive.
...
View search results from all Wolfram sites (667 matches)

