Search Results for ""

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

The theta series of a lattice is the generating function for the number of vectors with norm n in the lattice. Theta series for a number of lattices are implemented in the ...

A complex number may be taken to the power of another complex number. In particular, complex exponentiation satisfies (a+bi)^(c+di)=(a^2+b^2)^((c+id)/2)e^(i(c+id)arg(a+ib)), ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

A closed planar quadrilateral with opposite sides of equal lengths a and b, and with four right angles. A square is a degenerate rectangle with a=b. The area of the rectangle ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...

The angular twist theta of a shaft with given cross section is given by theta=(TL)/(KG) (1) (Roark 1954, p. 174), where T is the twisting moment (commonly measured in units ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].