Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
