Search Results for ""

With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...

For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...