Search Results for ""

Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...

A commutative diagram is a collection of maps A_i-->^(phi_i)B_i in which all map compositions starting from the same set A and ending with the same set B give the same ...

A conformal mapping, also called a conformal map, conformal transformation, angle-preserving transformation, or biholomorphic map, is a transformation w=f(z) that preserves ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

The Euler-Mascheroni constant gamma=0.577215664901532860606512090082402431042... (OEIS A001620) was calculated to 16 digits by Euler in 1781 and to 32 decimal places by ...

A factorial prime is a prime number of the form n!+/-1, where n! is a factorial. n!-1 is prime for n=3, 4, 6, 7, 12, 14, 30, 32, 33, 38, 94, 166, 324, 379, 469, 546, 974, ...

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...