Search Results for ""

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...

A Taylor series remainder formula that gives after n terms of the series R_n=(f^((n+1))(x^*))/(n!p)(x-x^*)^(n+1-p)(x-x_0)^p for x^* in (x_0,x) and any p>0 (Blumenthal 1926, ...

S(nu,z) = int_0^infty(1+t)^(-nu)e^(-zt)dt (1) = z^(nu-1)e^zint_z^inftyu^(-nu)e^(-u)du (2) = z^(nu/2-1)e^(z/2)W_(-nu/2,(1-nu)/2)(z), (3) where W_(k,m)(z) is the Whittaker ...

A Fourier series-like expansion of a twice continuously differentiable function f(x)=1/2a_0+sum_(n=1)^inftya_nJ_0(nx) (1) for 0<x<pi, where J_0(x) is a zeroth order Bessel ...

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

The Schmitt-Conway biprism is a convex polyhedron found to be only aperiodically space-filling by Conway in 1993.

The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.