e/Jordan's totient function

New Query

Information
has glosseng: In number theory, Jordans totient function J_k(n) of a positive integer n is the number of k-tuples of positive integers all less than or equal to n that form a coprime (k + 1)-tuple together with n. This is a generalisation of Eulers totient function, which is J1. The function is named after Camille Jordan.
lexicalizationeng: Jordan's totient function
instance ofc/Multiplicative functions

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint