Search Results for ""

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

The quintic equation x^5+ax^3+1/5a^2x+b=0 (1) is sometimes known as de Moivre's quintic (Spearman and Williams 1994). It has solutions x_j=omega^ju_1+omega^(4j)u_2 (2) for ...

Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...

The four following types of groups, 1. linear groups, 2. orthogonal groups, 3. symplectic groups, and 4. unitary groups, which were studied before more exotic types of groups ...

Given a Schwarz triangle (p q r), replacing each polygon vertex with its antipodes gives the three colunar spherical triangles (p q^' r^'),(p^' q r^'),(p^' q^' r), (1) where ...

2^(60)=1024^6 bytes. Although the term exabyte is sometimes used to refer to 1024^6 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 exabyte ...

The Fibonacci chain map is defined as x_(n+1) = -1/(x_n+epsilon+alphasgn[frac(n(phi-1))-(phi-1)]) (1) phi_(n+1) = frac(phi_n+phi-1), (2) where frac(x) is the fractional part, ...

The hacovercosine, also known as the hacoversed cosine and cohavercosine, is a little-used trigonometric function defined by hacovercos(z) = covercosz (1) = 1/2(1+sinz), (2) ...