No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
In this paper the congruence (f ∘ g)(n) = 0 (mod n) and the functional equation f ∘ f ∘ … ∘ f = g, are studied, where ∘ is an exponential regular convolution.