Search Results for ""

A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...

P_y(nu)=lim_(T->infty)2/T|int_(-T/2)^(T/2)[y(t)-y^_]e^(-2piinut)dt|^2, (1) so int_0^inftyP_y(nu)dnu = lim_(T->infty)1/Tint_(-T/2)^(T/2)[y(t)-y^_]^2dt (2) = <(y-y^_)^2> (3) = ...

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

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 ...

By the definition of the trigonometric functions, cos0 = 1 (1) cot0 = infty (2) csc0 = infty (3) sec0 = 1 (4) sin0 = 0 (5) tan0 = 0. (6)

The Tucker cubic is the triangle cubic with trilinear equation secAsecBsecCsum_(cyclic)aalpha(b^2beta^2+c^2gamma^2) =alphabetagammasum_(cyclic)asecA(b^2sec^2B+c^2sec^2C). It ...

Let S be a nonempty set, then an ultrafilter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F. 2. If A,B in F, then A ...

A multiplication table is an array showing the result of applying a binary operator to elements of a given set S. For example, the following table is the multiplication table ...

Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...