Search Results for ""

There are two equivalent definitions for a nilpotent matrix. 1. A square matrix whose eigenvalues are all 0. 2. A square matrix A such that A^n is the zero matrix 0 for some ...

Let A be a set. An operation on A is a function from a power of A into A. More precisely, given an ordinal number alpha, a function from A^alpha into A is an alpha-ary ...

An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...

Let (K,|·|) be a complete non-Archimedean valuated field, with valuation ring R, and let f(X) be a power series with coefficients in R. Suppose at least one of the ...

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

Legendre's conjecture asserts that for every n there exists a prime p between n^2 and (n+1)^2 (Hardy and Wright 1979, p. 415; Ribenboim 1996, pp. 397-398). It is one of ...

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...

When f:A->B is a ring homomorphism and b is an ideal in B, then f^(-1)(b) is an ideal in A, called the contraction of b and sometimes denoted b^c. The contraction of a prime ...