Search Results for ""

An integer n which is tested to see if it divides a given number.

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...

A technical conjecture which connects algebraic K-theory to étale cohomology. The conjecture was made more precise by Dwyer and Friedlander (1982). Thomason (1985) ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...

The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...