2000 character limit reached
On the pointwise periodicity of multiplicative and additive functions
Published 27 May 2020 in math.NT | (2005.13217v1)
Abstract: We study the problem of estimating the number of points of coincidences of an idealized gap on the set of integers under a given multiplicative function $g:\mathbb{N}\longrightarrow \mathbb{C}$ respectively additive function $f:\mathbb{N}\longrightarrow \mathbb{C}$. We obtain various lower bounds depending on the length of the period, by varying the worst growth rates of the ratios of their consecutive values.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.