Modular first Chebyshev function: Difference between revisions

From Number
(Created page with '==Definition== Let <math>x</math> be a positive real number, <math>n</math> be a natural number, and <math>a</math> be an integer. The '''modular first Chebyshev function''' of ...')
 
(No difference)

Latest revision as of 01:28, 7 May 2009

Definition

Let be a positive real number, be a natural number, and be an integer. The modular first Chebyshev function of , denoted or , is defined as:

,

where the sum is only over the prime numbers less than or equal to .

The is the modular version of the first Chebyshev function.