Stephens' constant

From testwiki
Jump to navigation Jump to search

Template:Short description In number theory, 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, ambn≠1 except when both m and n equal zero. Consider the set T(a,b) of prime numbers p such that p evenly divides ak−b for some power k. Assuming 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(1−pp3−1)=0.57595996889294543964316337549249669…Template:OEIS

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

CS=∏p(CA+1−p2p2(p−1))(pp+1+1/p).

See also

References

Template:Reflist Template:Numtheory-stub