Search Results for ""

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

The covariant derivative of a contravariant tensor A^a (also called the "semicolon derivative" since its symbol is a semicolon) is given by A^a_(;b) = ...

A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

The coversine is a little-used entire trigonometric function defined by covers(z) = versin(1/2pi-z) (1) = 1-sinz, (2) where versin(z) is the versine and sinz is the sine. The ...

The complex lattice Lambda_6^omega corresponding to real lattice K_(12) having the densest hypersphere packing (kissing number) in twelve dimensions. The associated ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.