About the Project

Dirichlet%20characters

AdvancedHelp

(0.001 seconds)

1—10 of 126 matching pages

1: 27.8 Dirichlet Characters
§27.8 Dirichlet Characters
In other words, Dirichlet characters (mod k ) satisfy the four conditions: … If χ is a character (mod k ), so is its complex conjugate χ ¯ . … Every Dirichlet character χ (mod k ) is a product …where χ 0 is a character (mod d ) for some induced modulus d for χ , and χ 1 is the principal character (mod k ). …
2: 25.15 Dirichlet L -functions
§25.15 Dirichlet L -functions
where χ ( n ) is a Dirichlet character ( mod k ) 27.8). For the principal character χ 1 ( mod k ) , L ( s , χ 1 ) is analytic everywhere except for a simple pole at s = 1 with residue ϕ ( k ) / k , where ϕ ( k ) is Euler’s totient function (§27.2). … … When χ is a primitive character (mod k ) the L -functions satisfy the functional equation: …
3: 27.10 Periodic Number-Theoretic Functions
Examples are the Dirichlet characters (mod k ) and the greatest common divisor ( n , k ) regarded as a function of n . … Another generalization of Ramanujan’s sum is the Gauss sum G ( n , χ ) associated with a Dirichlet character χ ( mod k ) . It is defined by the relation … For any Dirichlet character χ ( mod k ) , G ( n , χ ) is separable for n if ( n , k ) = 1 , and is separable for every n if and only if G ( n , χ ) = 0 whenever ( n , k ) > 1 . … The finite Fourier expansion of a primitive Dirichlet character χ ( mod k ) has the form …
4: 27.9 Quadratic Characters
§27.9 Quadratic Characters
For an odd prime p , the Legendre symbol ( n | p ) is defined as follows. …The Legendre symbol ( n | p ) , as a function of n , is a Dirichlet character (mod p ). … If an odd integer P has prime factorization P = r = 1 ν ( n ) p r a r , then the Jacobi symbol ( n | P ) is defined by ( n | P ) = r = 1 ν ( n ) ( n | p r ) a r , with ( n | 1 ) = 1 . The Jacobi symbol ( n | P ) is a Dirichlet character (mod P ). …
5: 25.19 Tables
  • Cloutman (1989) tabulates Γ ( s + 1 ) F s ( x ) , where F s ( x ) is the Fermi–Dirac integral (25.12.14), for s = 1 2 , 1 2 , 3 2 , 5 2 , x = 5 ( .05 ) 25 , to 12S.

  • Fletcher et al. (1962, §22.1) lists many sources for earlier tables of ζ ( s ) for both real and complex s . §22.133 gives sources for numerical values of coefficients in the Riemann–Siegel formula, §22.15 describes tables of values of ζ ( s , a ) , and §22.17 lists tables for some Dirichlet L -functions for real characters. For tables of dilogarithms, polylogarithms, and Clausen’s integral see §§22.84–22.858.

  • 6: 24.16 Generalizations
    §24.16(ii) Character Analogs
    Let χ be a primitive Dirichlet character mod f (see §27.8). Then f is called the conductor of χ . …
    24.16.11 B n , χ ( x ) = k = 0 n ( n k ) B k , χ x n k .
    Let χ 0 be the trivial character and χ 4 the unique (nontrivial) character with f = 4 ; that is, χ 4 ( 1 ) = 1 , χ 4 ( 3 ) = 1 , χ 4 ( 2 ) = χ 4 ( 4 ) = 0 . …
    7: Bibliography D
  • C. de la Vallée Poussin (1896b) Recherches analytiques sur la théorie des nombres premiers. Deuxième partie. Les fonctions de Dirichlet et les nombres premiers de la forme linéaire M x + N . Ann. Soc. Sci. Bruxelles 20, pp. 281–397 (French).
  • K. Dilcher (1987b) Irreducibility of certain generalized Bernoulli polynomials belonging to quadratic residue class characters. J. Number Theory 25 (1), pp. 72–80.
  • P. G. L. Dirichlet (1837) Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält. Abhandlungen der Königlich Preussischen Akademie der Wissenschaften von 1837, pp. 45–81 (German).
  • P. G. L. Dirichlet (1849) Über die Bestimmung der mittleren Werthe in der Zahlentheorie. Abhandlungen der Königlich Preussischen Akademie der Wissenschaften von 1849, pp. 69–83 (German).
  • B. Döring (1966) Complex zeros of cylinder functions. Math. Comp. 20 (94), pp. 215–222.
  • 8: 27.5 Inversion Formulas
    If a Dirichlet series F ( s ) generates f ( n ) , and G ( s ) generates g ( n ) , then the product F ( s ) G ( s ) generates
    27.5.1 h ( n ) = d | n f ( d ) g ( n d ) ,
    called the Dirichlet product (or convolution) of f and g . The set of all number-theoretic functions f with f ( 1 ) 0 forms an abelian group under Dirichlet multiplication, with the function 1 / n in (27.2.5) as identity element; see Apostol (1976, p. 129). …
    27.5.6 G ( x ) = n x F ( x n ) F ( x ) = n x μ ( n ) G ( x n ) ,
    9: 27.3 Multiplicative Properties
    Examples are 1 / n and λ ( n ) , and the Dirichlet characters, defined in §27.8. …
    10: 25.1 Special Notation
    The main related functions are the Hurwitz zeta function ζ ( s , a ) , the dilogarithm Li 2 ( z ) , the polylogarithm Li s ( z ) (also known as Jonquière’s function ϕ ( z , s ) ), Lerch’s transcendent Φ ( z , s , a ) , and the Dirichlet L -functions L ( s , χ ) .