Search Results for ""

If proofreader A finds a mistakes and proofreader B finds b mistakes, c of which were also found by A, how many mistakes were missed by both A and B? Assume there are a total ...

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

A nickname for the one-sheeted hyperboloid due to Samuel (1988, p. 95).

A number of attractive 8-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

Given n mutually exclusive events A_1, ..., A_n whose probabilities sum to unity, then P(B)=P(B|A_1)P(A_1)+...+P(B|A_n)P(A_n), where B is an arbitrary event, and P(B|A_i) is ...

A disk with radius 1. The (open) unit disk can also be considered to be the region in the complex plane defined by {z:|z|<1}, where |z| denotes the complex modulus. (The ...

The system of partial differential equations (partial_t+partial_z^3+partial_(z^_)^3)v+partial_z(uv)+partial_(z^_)(vw) (1) partial_(z^_)u=3partial_zv (2) ...

The term used in propositional calculus for the NAND connective. The notation A|B is used for this connective, a most unfortunate choice in light of modern usage of A|B or ...

A type of sale in which members of a group of buyers offer ever increasing amounts. The bidder making the last bid (for which no higher bid is subsequently made within a ...

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...