HOME

TheInfoList



OR:

In
number theory Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example ...
, Jordan's totient function, denoted as J_k(n), where k is a positive integer, is a function of a
positive integer In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positiv ...
, n, that equals the number of k-
tuple In mathematics, a tuple is a finite sequence or ''ordered list'' of numbers or, more generally, mathematical objects, which are called the ''elements'' of the tuple. An -tuple is a tuple of elements, where is a non-negative integer. There is o ...
s of positive integers that are less than or equal to n and that together with n form a
coprime set In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiv ...
of k+1 integers. Jordan's totient function is a generalization of Euler's totient function, which is the same as J_1(n). The function is named after
Camille Jordan Marie Ennemond Camille Jordan (; 5 January 1838 – 22 January 1922) was a French mathematician, known both for his foundational work in group theory and for his influential ''Cours d'analyse''. Biography Jordan was born in Lyon and educated at ...
.


Definition

For each positive integer 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 convolution In mathematics, Dirichlet convolution (or divisor 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 ...
s 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 :: J_k(n) \sim \frac. * The Dedekind psi function is ::\psi(n) = \frac, :and by inspection of the definition (recognizing that each factor in the product over the primes is a cyclotomic polynomial of p^), the arithmetic functions defined by \frac or \frac can also be shown to be integer-valued multiplicative functions. * \sum_\delta^sJ_r(\delta)J_s\left(\frac\right) = J_(n).


Order of matrix groups

* The
general linear group In mathematics, the general linear group of degree n is the set of n\times n invertible matrices, together with the operation of ordinary matrix multiplication. This forms a group, because the product of two invertible matrices is again inve ...
of matrices of order m over \mathbf/n has orderAll of these formulas are from Andrica and Piticari in #External links. : , \operatorname(m,\mathbf/n), =n^\prod_^m J_k(n). * The
special linear group In mathematics, the special linear group \operatorname(n,R) of degree n over a commutative ring R is the set of n\times n Matrix (mathematics), matrices with determinant 1, with the group operations of ordinary matrix multiplication and matrix ...
of matrices of order m over \mathbf/n has order : , \operatorname(m,\mathbf/n), =n^\prod_^m J_k(n). * The
symplectic group In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted and for positive integer ''n'' and field F (usually C or R). The latter is called the compact symplectic gr ...
of matrices of order m over \mathbf/n has order : , \operatorname(2m,\mathbf/n), =n^\prod_^m J_(n). The first two formulas were discovered by Jordan.


Examples

* Explicit lists in the OEIS are J2 in , J3 in , J4 in , J5 in , J6 up to J10 in up to . * Multiplicative functions defined by ratios are J2(n)/J1(n) in , J3(n)/J1(n) in , J4(n)/J1(n) in , J5(n)/J1(n) in , J6(n)/J1(n) in , J7(n)/J1(n) in , J8(n)/J1(n) in , J9(n)/J1(n) in , J10(n)/J1(n) in , J11(n)/J1(n) in . * Examples of the ratios J2k(n)/Jk(n) are J4(n)/J2(n) in , J6(n)/J3(n) in , and J8(n)/J4(n) in .


Notes


References

* * *


External links

* * {{Totient Modular arithmetic Multiplicative functions