Search Results for ""

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.

The base-60 notational system for representing real numbers. A base-60 number system was used by the Babylonians and is preserved in the modern measurement of time (hours, ...

Although a numerically computed chaotic trajectory diverges exponentially from the true trajectory with the same initial coordinates, there exists an errorless trajectory ...

A conjecture that, as proved by Parshin (1968), implies the Mordell conjecture.

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

A generalization of the Bessel differential equation for functions of order 0, given by zy^('')+y^'+(z+A)y=0. Solutions are y=e^(+/-iz)_1F_1(1/2∓1/2iA;1;∓2iz), where ...

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...