Search Results for ""

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

A polygonal number is a type of figurate number that is a generalization of triangular, square, etc., to an n-gon for n an arbitrary positive integer. The above diagrams ...

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 ...

The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

The equation f(x_n|x_s)=int_(-infty)^inftyf(x_n|x_r)f(x_r|x_s)dx_r which gives the transitional densities of a Markov sequence. Here, n>r>s are any integers (Papoulis 1984, ...

The partial differential equation P_t=P_(xx)-uP_x+partial/(partialx){[u-F(x)]P}.

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...