Search Results for ""

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

A Fermat pseudoprime to a base a, written psp(a), is a composite number n such that a^(n-1)=1 (mod n), i.e., it satisfies Fermat's little theorem. Sometimes the requirement ...

Draw lines P_AQ_A, P_BQ_B, and P_CQ_C through the symmedian point K and parallel to the sides of the triangle DeltaABC. The points where the parallel lines intersect the ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...

Wirsing (1974) showed, among other results, that if F_n(x) is the Gauss-Kuzmin distribution, then lim_(n->infty)(F_n(x)-lg(1+x))/((-lambda)^n)=Psi(x), (1) where ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

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