Jordan Totient Function
The Jordan Totient Function is a multiplicative arithmetic function that generalizes Euler’s totient function by counting the number of k-tuples of positive integers less than or equal to a given integer n that form a coprime tuple with n.
8
Publications
618
Citations
11
Authors
7
Institutions
Publications per year
2017–2026
1
Variants
Jordan's Totient Function
Parents
8
Jordan derivations of prime rings
I. N. Herstein · Proceedings of the American Mathematical Society · 1957 · 399 citations · Full text
Jordan Derivations of Prime Rings
I. N. Herstein · Proceedings of the American Mathematical Society · 1957 · 103 citations
1–5 of 8
11
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 11
7
Université Sorbonne Paris Nord
Villetaneuse, France
2 h-index
2 publications
37 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
37 citations

University of Bradford
Bradford, United Kingdom
2 h-index
2 publications
37 citations

Institute of Mathematical Sciences
Chennai, India
1 h-index
1 publications
12 citations
Düzce Üniversitesi
Düzce, Türkiye
1 h-index
2 publications
54 citations

Tata Institute of Fundamental Research
Mumbai, India
1 h-index
1 publications
12 citations

Istanbul Commerce University
Istanbul, Türkiye
1 h-index
1 publications
27 citations

Aligarh Muslim University
Aligarh, India
1 publications
10 citations
1–8 of 7
2 publications · 37 citations
2
h-index
PROC · 2 publications · 502 citations
2
h-index
1 publications · 12 citations
1
h-index
1 publications · 27 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5