Search Results for ""

The term "characteristic" has many different uses in mathematics. In general, it refers to some property that inherently describes a given mathematical object, for example ...

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...

The twin primes constant Pi_2 (sometimes also denoted C_2) is defined by Pi_2 = product_(p>2; p prime)[1-1/((p-1)^2)] (1) = product_(p>2; p prime)(p(p-2))/((p-1)^2) (2) = ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

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 ...

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 ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

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 ...