Search Results for ""

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

A unit circle is a circle of unit radius, i.e., of radius 1. The unit circle plays a significant role in a number of different areas of mathematics. For example, the ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

The logarithm log_bx for a base b and a number x is defined to be the inverse function of taking b to the power x, i.e., b^x. Therefore, for any x and b, x=log_b(b^x), (1) or ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...