Search Results for ""

There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...

An ordinary differential equation of the form y^('')+P(x)y^'+Q(x)y=0. (1) Such an equation has singularities for finite x=x_0 under the following conditions: (a) If either ...

Separation of variables is a method of solving ordinary and partial differential equations. For an ordinary differential equation (dy)/(dx)=g(x)f(y), (1) where f(y)is nonzero ...

Sociable numbers are numbers that result in a periodic aliquot sequence, where an aliquot sequence is the sequence of numbers obtained by repeatedly applying the restricted ...

A square root of x is a number r such that r^2=x. When written in the form x^(1/2) or especially sqrt(x), the square root of x may also be called the radical or surd. The ...

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...