Dirichlet's theorem on arithmetic progressionsIn number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n is also a positive integer. In other words, there are infinitely many primes that are congruent to a modulo d. The numbers of the form a + nd form an arithmetic progression and Dirichlet's theorem states that this sequence contains infinitely many prime numbers.
Fundamental theorem of arithmeticIn mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. For example, The theorem says two things about this example: first, that 1200 be represented as a product of primes, and second, that no matter how this is done, there will always be exactly four 2s, one 3, two 5s, and no other primes in the product.
Ramanujan's sumIn number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula where (a, q) = 1 means that a only takes on values coprime to q. Srinivasa Ramanujan mentioned the sums in a 1918 paper. In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently large odd number is the sum of three primes.
Average order of an arithmetic functionIn number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average". Let be an arithmetic function. We say that an average order of is if as tends to infinity. It is conventional to choose an approximating function that is continuous and monotone. But even so an average order is of course not unique. In cases where the limit exists, it is said that has a mean value (average value) .
Prime-counting functionIn mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by pi(x) (unrelated to the number pi). Prime number theorem Of great interest in number theory is the growth rate of the prime-counting function. It was conjectured in the end of the 18th century by Gauss and by Legendre to be approximately where log is the natural logarithm, in the sense that This statement is the prime number theorem.
Chebyshev functionIn mathematics, the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function θ (x) or θ (x) is given by where denotes the natural logarithm, with the sum extending over all prime numbers p that are less than or equal to x. The second Chebyshev function ψ (x) is defined similarly, with the sum extending over all prime powers not exceeding x where Λ is the von Mangoldt function.
Mersenne primeIn mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2n − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2p − 1 for some prime p. The exponents n which give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, .
Zeta function regularizationIn mathematics and theoretical physics, zeta function regularization is a type of regularization or summability method that assigns finite values to divergent sums or products, and in particular can be used to define determinants and traces of some self-adjoint operators. The technique is now commonly applied to problems in physics, but has its origins in attempts to give precise meanings to ill-conditioned sums appearing in number theory.
Dirichlet convolutionIn mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. If are two arithmetic functions from the positive integers to the complex numbers, the Dirichlet convolution f ∗ g is a new arithmetic function defined by: where the sum extends over all positive divisors d of n, or equivalently over all distinct pairs (a, b) of positive integers whose product is n.
Zeros and polesIn complex analysis (a branch of mathematics), a pole is a certain type of singularity of a complex-valued function of a complex variable. It is the simplest type of non-removable singularity of such a function (see essential singularity). Technically, a point z0 is a pole of a function f if it is a zero of the function 1/f and 1/f is holomorphic (i.e. complex differentiable) in some neighbourhood of z0. A function f is meromorphic in an open set U if for every point z of U there is a neighborhood of z in which either f or 1/f is holomorphic.
Complex analysisComplex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, applied mathematics; as well as in physics, including the branches of hydrodynamics, thermodynamics, quantum mechanics, and twistor theory. By extension, use of complex analysis also has applications in engineering fields such as nuclear, aerospace, mechanical and electrical engineering.
Power seriesIn mathematics, a power series (in one variable) is an infinite series of the form where an represents the coefficient of the nth term and c is a constant. Power series are useful in mathematical analysis, where they arise as Taylor series of infinitely differentiable functions. In fact, Borel's theorem implies that every power series is the Taylor series of some smooth function. In many situations, c (the center of the series) is equal to zero, for instance when considering a Maclaurin series.
