1 Answers
Let k {\displaystyle k} be a positive integer. In number theory, Jordan's totient function J k {\displaystyle J_{k}} of a positive integer n {\displaystyle n} equals the number of k {\displaystyle k} -tuples of positive integers that are less than or equal to n {\displaystyle n} and that together with n {\displaystyle n} form a coprime set of k + 1 {\displaystyle k+1} integers.
Jordan's totient function a generalization of Euler's totient function, which is given by J 1 {\displaystyle J_{1}}. The function is named after Camille Jordan.
7 views
Answered