Search Results for ""

A sphere with three handles (and three holes), i.e., a genus-3 torus.

The function defined by U(n)=(n!)^(n!). The values for n=0, 1, ..., are 1, 1, 4, 46656, 1333735776850284124449081472843776, ... (OEIS A046882).

The integral of 1/r over the unit disk U is given by intint_(U)(dA)/r = intint_(U)(dxdy)/(sqrt(x^2+y^2)) (1) = int_0^(2pi)int_0^1(rdrdtheta)/r (2) = 2piint_0^1dr (3) = 2pi. ...

The Riemann zeta function is an extremely important special function of mathematics and physics that arises in definite integration and is intimately related with very deep ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...