Search Results for ""

A discrete function A(n,k) is called closed form (or sometimes "hypergeometric") in two variables if the ratios A(n+1,k)/A(n,k) and A(n,k+1)/A(n,k) are both rational ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

A coincidence is a surprising concurrence of events, perceived as meaningfully related, with no apparent causal connection (Diaconis and Mosteller 1989). Given a large number ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

A fundamental system of logic based on the concept of a generalized function whose argument is also a function (Schönfinkel 1924). This mathematical discipline was ...

The common logarithm is the logarithm to base 10. The notation logx is used by physicists, engineers, and calculator keypads to denote the common logarithm. However, ...

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

The complete elliptic integral of the second kind, illustrated above as a function of k, is defined by E(k) = E(1/2pi,k) (1) = ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

A complex number z may be represented as z=x+iy=|z|e^(itheta), (1) where |z| is a positive real number called the complex modulus of z, and theta (sometimes also denoted phi) ...