[seqfan] Re: Generalization of the totient

[jean-paul allouche]

Dear Charles

Do you mean m and k coprime?
best
jean-paul

Le 24/01/18 à 08:36, Charles Greathouse a écrit :
> I'm interested in the function f(m, n) which counts the number of k, 1 <= k
> <= n, such that m and k are squarefree. This function generalizes Euler's
> totient: f(n, n) = phi(n). Can this be computed efficiently in the more
> general case where m and n are unequal? (You can assume the factorization
> of m is known and m and n are of the same order of magnitude.) Is anything
> interesting known about this function?
>
> Charles Greathouse
> Case Western Reserve University
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/