Search Results for ""

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...

In particle physics, a spinor field of order 2s describes a particle of spin s, where s is an integer or half-integer. Therefore, a spinor of order 4s contains as much ...

Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

A necessary and sufficient condition for a sequence S_i to converge. The Cauchy criterion is satisfied when, for all epsilon>0, there is a fixed number N such that ...

U_n(f)=int_a^bf(x)K_n(x)dx, where {K_n(x)} is a sequence of continuous functions.

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.