Search results
Results from the WOW.Com Content Network
The Dirichlet function is not Riemann-integrable on any segment of despite being bounded because the set of its discontinuity points is not negligible (for the Lebesgue measure). The Dirichlet function provides a counterexample showing that the monotone convergence theorem is not true in the context of the Riemann integral.
The Dirichlet L-function L(s, χ) = 1 − 3 −s + 5 −s − 7 −s + ⋅⋅⋅ (sometimes given the special name Dirichlet beta function), with trivial zeros at the negative odd integers. Let χ be a primitive character modulo q, with q > 1. There are no zeros of L(s, χ) with Re(s) > 1. For Re(s) < 0, there are zeros at certain negative ...
The convolution of D n (x) with any function f of period 2 π is the nth-degree Fourier series approximation to f, i.e., we have () = () = = ^ (), where ^ = is the k th Fourier coefficient of f. This implies that in order to study convergence of Fourier series it is enough to study properties of the Dirichlet kernel.
The name "Dirichlet's principle" is due to Bernhard Riemann, who applied it in the study of complex analytic functions. [1]Riemann (and others such as Carl Friedrich Gauss and Peter Gustav Lejeune Dirichlet) knew that Dirichlet's integral is bounded below, which establishes the existence of an infimum; however, he took for granted the existence of a function that attains the minimum.
The set of arithmetic functions forms a commutative ring, the Dirichlet ring, under pointwise addition, where f + g is defined by (f + g)(n) = f(n) + g(n), and Dirichlet convolution. The multiplicative identity is the unit function ε defined by ε ( n ) = 1 if n = 1 and ε ( n ) = 0 if n > 1 .
It is named after Carl Johannes Thomae, but has many other names: the popcorn function, the raindrop function, the countable cloud function, the modified Dirichlet function, the ruler function (not to be confused with the integer ruler function), [2] the Riemann function, or the Stars over Babylon (John Horton Conway's name). [3]
Let σ 0 (n) be the divisor-counting function, and let D(n) be its summatory function: = = (). Computing D(n) naïvely requires factoring every integer in the interval [1, n]; an improvement can be made by using a modified Sieve of Eratosthenes, but this still requires Õ(n) time.
In mathematics, the study of special values of L-functions is a subfield of number theory devoted to generalising formulae such as the Leibniz formula for π, namely + + =, by the recognition that expression on the left-hand side is also L ( 1 ) {\displaystyle L(1)} where L ( s ) {\displaystyle L(s)} is the Dirichlet L -function for the field ...