Search Results for ""

By analogy with the divisor function sigma_1(n), let pi(n)=product_(d|n)d (1) denote the product of the divisors d of n (including n itself). For n=1, 2, ..., the first few ...

Let 0<k^2<1. The incomplete elliptic integral of the third kind is then defined as Pi(n;phi,k) = int_0^phi(dtheta)/((1-nsin^2theta)sqrt(1-k^2sin^2theta)) (1) = ...

Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...

The "imaginary error function" erfi(z) is an entire function defined by erfi(z)=-ierf(iz), (1) where erf(z) is the erf function. It is implemented in the Wolfram Language as ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...

Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...

Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...

Move a point Pi_0 along a line from an initial point to a final point. It traces out a line segment Pi_1. When Pi_1 is translated from an initial position to a final ...

A skew polygon such that every two consecutive sides (but no three) belong to a face of a regular polyhedron. Every regular polyhedron can be orthogonally projected onto a ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...