Stephens' constant

From Wikipedia, the free encyclopedia
(Redirected from Stephens' Constant)
Jump to navigation Jump to search

Stephens' constant expresses the density of certain subsets of the prime numbers.[1][2] Let a and b be two multiplicatively independent integers, that is, ambn1 except when both m and n equal zero. Consider the set T(a,b) of prime numbers p such that p evenly divides akb for some power k. Assuming the validity of the generalized Riemann hypothesis, the density of the set T(a,b) relative to the set of all primes is a rational multiple of

CS=p(1pp31)=0.57595996889294543964316337549249669(sequence A065478 in the OEIS)

Stephens' constant is closely related to the Artin constant CA that arises in the study of primitive roots.[3][4]

CS=p(CA+(1p2p2(p1)))(p(p+1+1p))

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).