We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn

Stephens' constant

Index Stephens' constant

Stephens' constant expresses the density of certain subsets of the prime numbers. [1]

Table of Contents

  1. 8 relations: Artin's conjecture on primitive roots, Euler product, Generalized Riemann hypothesis, Journal of Number Theory, Multiplicative independence, Prime number, Primitive root modulo n, Twin prime.

  2. Infinite products

Artin's conjecture on primitive roots

In number theory, Artin's conjecture on primitive roots states that a given integer a that is neither a square number nor −1 is a primitive root modulo infinitely many primes p. The conjecture also ascribes an asymptotic density to these primes. Stephens' constant and Artin's conjecture on primitive roots are Algebraic number theory.

See Stephens' constant and Artin's conjecture on primitive roots

Euler product

In number theory, an Euler product is an expansion of a Dirichlet series into an infinite product indexed by prime numbers. Stephens' constant and Euler product are infinite products.

See Stephens' constant and Euler product

Generalized Riemann hypothesis

The Riemann hypothesis is one of the most important conjectures in mathematics.

See Stephens' constant and Generalized Riemann hypothesis

Journal of Number Theory

The Journal of Number Theory (JNT) is a monthly peer-reviewed scientific journal covering all aspects of number theory.

See Stephens' constant and Journal of Number Theory

Multiplicative independence

In number theory, two positive integers a and b are said to be multiplicatively independent if their only common integer power is 1.

See Stephens' constant and Multiplicative independence

Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.

See Stephens' constant and Prime number

Primitive root modulo n

In modular arithmetic, a number is a primitive root modulo if every number coprime to is congruent to a power of modulo.

See Stephens' constant and Primitive root modulo n

Twin prime

A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair or In other words, a twin prime is a prime that has a prime gap of two.

See Stephens' constant and Twin prime

See also

Infinite products

References

[1] https://en.wikipedia.org/wiki/Stephens'_constant