Search Results for ""

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

A conical frustum is a frustum created by slicing the top off a cone (with the cut made parallel to the base). For a right circular cone, let s be the slant height and R_1 ...

A plot in the complex plane of the points B(t)=S(t)+iC(t), (1) where S(t) and C(t) are the Fresnel integrals (von Seggern 2007, p. 210; Gray 1997, p. 65). The Cornu spiral is ...

Adding a damping force proportional to x^. to the equation of simple harmonic motion, the first derivative of x with respect to time, the equation of motion for damped simple ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

If a complex function is analytic at all finite points of the complex plane C, then it is said to be entire, sometimes also called "integral" (Knopp 1996, p. 112). Any ...

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...