|
Arithmetic Function
In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function ''f''(''n'') whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of ''n''". An example of an arithmetic function is the divisor function whose value at a positive integer ''n'' is equal to the number of divisors of ''n''. There is a larger class of number-theoretic functions that do not fit the above definition, for example, the prime-counting functions. This article provides links to functions of both classes. Arithmetic functions are often extremely irregular (see table), but some of them have series expansions in terms of Ramanujan's sum. Multiplicative and additive functions An arithmetic function ''a'' is * completely additive if ''a''(''mn'') = ''a''(''m'') + ''a''(''n'') for all natural numbers ''m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."German original: "Die Mathematik ist die Königin der Wissenschaften, und die Arithmetik ist die Königin der Mathematik." Number theorists study prime numbers as well as the properties of mathematical objects made out of integers (for example, rational numbers) or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory are often best understood through the study of Complex analysis, analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fundamental Theorem Of Arithmetic
In 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, : 1200 = 2^4 \cdot 3^1 \cdot 5^2 = (2 \cdot 2 \cdot 2 \cdot 2) \cdot 3 \cdot (5 \cdot 5) = 5 \cdot 2 \cdot 5 \cdot 2 \cdot 3 \cdot 2 \cdot 2 = \ldots 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. The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (for example, 12 = 2 \cdot 6 = 3 \cdot 4). This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, then factorization into primes would not be unique; for example, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Roots Of Unity
In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power . Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform. Roots of unity can be defined in any field. If the characteristic of the field is zero, the roots are complex numbers that are also algebraic integers. For fields with a positive characteristic, the roots belong to a finite field, and, conversely, every nonzero element of a finite field is a root of unity. Any algebraically closed field contains exactly th roots of unity, except when is a multiple of the (positive) characteristic of the field. General definition An ''th root of unity'', where is a positive integer, is a number satisfying the equation :z^n = 1. Unless otherwise specified, the roots of unity may be taken to be complex numbers (incl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Form
In mathematics, a modular form is a (complex) analytic function on the upper half-plane satisfying a certain kind of functional equation with respect to the Group action (mathematics), group action of the modular group, and also satisfying a growth condition. The theory of modular forms therefore belongs to complex analysis but the main importance of the theory has traditionally been in its connections with number theory. Modular forms appear in other areas, such as algebraic topology, sphere packing, and string theory. A modular function is a function that is invariant with respect to the modular group, but without the condition that be Holomorphic function, holomorphic in the upper half-plane (among other requirements). Instead, modular functions are Meromorphic function, meromorphic (that is, they are holomorphic on the complement of a set of isolated points, which are poles of the function). Modular form theory is a special case of the more general theory of automorphic form ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Discriminant
In mathematics, the Weierstrass elliptic functions are elliptic functions that take a particularly simple form. They are named for Karl Weierstrass. This class of functions are also referred to as ℘-functions and they are usually denoted by the symbol ℘, a uniquely fancy script ''p''. They play an important role in the theory of elliptic functions. A ℘-function together with its derivative can be used to parameterize elliptic curves and they generate the field of elliptic functions with respect to a given period lattice. Symbol for Weierstrass \wp-function Definition Let \omega_1,\omega_2\in\mathbb be two complex numbers that are linearly independent over \mathbb and let \Lambda:=\mathbb\omega_1+\mathbb\omega_2:=\ be the lattice generated by those numbers. Then the \wp-function is defined as follows: \weierp(z,\omega_1,\omega_2):=\weierp(z,\Lambda) := \frac + \sum_\left(\frac 1 - \frac 1 \right). This series converges locally uniformly absolutely in \math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Q-expansion
In mathematics, a modular form is a (complex) analytic function on the upper half-plane satisfying a certain kind of functional equation with respect to the group action of the modular group, and also satisfying a growth condition. The theory of modular forms therefore belongs to complex analysis but the main importance of the theory has traditionally been in its connections with number theory. Modular forms appear in other areas, such as algebraic topology, sphere packing, and string theory. A modular function is a function that is invariant with respect to the modular group, but without the condition that be holomorphic in the upper half-plane (among other requirements). Instead, modular functions are meromorphic (that is, they are holomorphic on the complement of a set of isolated points, which are poles of the function). Modular form theory is a special case of the more general theory of automorphic forms which are functions defined on Lie groups which transform nicely with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (except ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramanujan Tau Function
The Ramanujan tau function, studied by , is the function \tau : \mathbb \rarr\mathbb defined by the following identity: :\sum_\tau(n)q^n=q\prod_\left(1-q^n\right)^ = q\phi(q)^ = \eta(z)^=\Delta(z), where with , \phi is the Euler function, is the Dedekind eta function, and the function is a holomorphic cusp form of weight 12 and level 1, known as the discriminant modular form (some authors, notably Apostol, write \Delta/(2\pi)^ instead of \Delta). It appears in connection to an "error term" involved in counting the number of ways of expressing an integer as a sum of 24 squares. A formula due to Ian G. Macdonald was given in . Values The first few values of the tau function are given in the following table : Ramanujan's conjectures observed, but did not prove, the following three properties of : * if (meaning that is a multiplicative function) * for prime and . * for all primes . The first two properties were proved by and the third one, called the Ramanujan conjec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet Convolution
In 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. Definition If f , g : \mathbb\to\mathbb are two arithmetic functions from the positive integers to the complex numbers, the ''Dirichlet convolution'' is a new arithmetic function defined by: : (f*g)(n) \ =\ \sum_ f(d)\,g\!\left(\frac\right) \ =\ \sum_\!f(a)\,g(b) where the sum extends over all positive divisors ''d'' of ''n'', or equivalently over all distinct pairs of positive integers whose product is ''n''. This product occurs naturally in the study of Dirichlet series such as the Riemann zeta function. It describes the multiplication of two Dirichlet series in terms of their coefficients: :\left(\sum_\frac\right) \left(\sum_\frac\right) \ = \ \left(\sum_\frac\right). Properties The set of arithmetic functions forms a commutative ring, the , under pointwise addition, where is defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Inversion
Moebius, Möbius or Mobius may refer to: People * August Ferdinand Möbius (1790–1868), German mathematician and astronomer * Theodor Möbius (1821–1890), German philologist * Karl Möbius (1825–1908), German zoologist and ecologist * Paul Julius Möbius (1853–1907), German neurologist * Dieter Moebius (1944–2015), German/Swiss musician * Mark Mobius (born 1936), emerging markets investments pioneer * Jean Giraud (1938–2012), French comics artist who used the pseudonym Mœbius Fictional characters * Mobius M. Mobius, a character in Marvel Comics * Mobius, also known as the Anti-Monitor, a supervillain in DC Comics Mathematics * Möbius energy, a particular knot energy * Möbius strip, an object with one surface and one edge * Möbius function, an important multiplicative function in number theory and combinatorics ** Möbius transform, transform involving the Möbius function ** Möbius inversion formula, in number theory * Möbius transformation, a particular rati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Function
The Möbius function is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted . Definition For any positive integer , define as the sum of the primitive th roots of unity. It has values in depending on the factorization of into prime factors: * if is a square-free positive integer with an even number of prime factors. * if is a square-free positive integer with an odd number of prime factors. * if has a squared prime factor. The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where is the Kronecker delta, is the Liouville function, is the number of dis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jordan Totient Function
Let k be a positive integer. In number theory, the Jordan's totient function J_k(n) of a positive integer n equals the number of k-tuples of positive integers that are less than or equal to n and that together with n form a coprime set of k+1 integers. Jordan's totient function is a generalization of Euler's totient function, which is given by J_1(n). The function is named after Camille Jordan. Definition For each k, Jordan's totient function J_k is multiplicative and may be evaluated as :J_k(n)=n^k \prod_\left(1-\frac\right) \,, where p ranges through the prime divisors of n. Properties * \sum_ J_k(d) = n^k. \, :which may be written in the language of Dirichlet convolutions as :: J_k(n) \star 1 = n^k\, :and via Möbius inversion as ::J_k(n) = \mu(n) \star n^k. :Since the Dirichlet generating function of \mu is 1/\zeta(s) and the Dirichlet generating function of n^k is \zeta(s-k), the series for J_k becomes ::\sum_\frac = \frac. * An average order of J_k(n) is ::\frac. * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
