Search Results for ""

f_p=f_0+1/2p(p+1)delta_(1/2)-1/2(p-1)pdelta_(-1/2) +(S_3+S_4)delta_(1/2)^3+(S_3-S_4)delta_(-1/2)^3+..., (1) for p in [-1/2,1/2], where delta is the central difference and ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

The tesseract is the hypercube in R^4, also called the 8-cell or octachoron. It has the Schläfli symbol {4,3,3}, and vertices (+/-1,+/-1,+/-1,+/-1). The figure above shows a ...

A curious approximation to the Feigenbaum constant delta is given by pi+tan^(-1)(e^pi)=4.669201932..., (1) where e^pi is Gelfond's constant, which is good to 6 digits to the ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

Picking two independent sets of points x and y from a unit uniform distribution and placing them at coordinates (x,y) gives points uniformly distributed over the unit square. ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...

alpha_n(z) = int_1^inftyt^ne^(-zt)dt (1) = n!z^(-(n+1))e^(-z)sum_(k=0)^(n)(z^k)/(k!). (2) It is equivalent to alpha_n(z)=E_(-n)(z), (3) where E_n(z) is the En-function.