Search for: All records

Abstract We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of$$n \le x$$for which the Alladi–Erdős function$$A(n) = \sum_{p^k \parallel n} k p$$takes values in a given residue class moduloq, whereqvaries uniformly up to a fixed power of$$\log x$$. We establish a similar result for the equidistribution of the Euler totient function$$\phi(n)$$among the coprime residues to the ‘correct’ moduliqthat vary uniformly in a similar range and also quantify the failure of equidistribution of the values of$$\phi(n)$$among the coprime residue classes to the ‘incorrect’ moduli. 

Abstract Schinzel and Wójcik have shown that for every$$\alpha ,\beta \in \mathbb {Q}^{\times }\hspace{0.55542pt}{\setminus }\hspace{1.111pt}\{\pm 1\}$$ $\alpha ,\beta \in Q^{\times }\backslash \{\pm 1\}$, there are infinitely many primespwhere$$v_p(\alpha )=v_p(\beta )=0$$ $v_p\left(\alpha \right)=v_p\left(\beta \right)=0$and where$$\alpha $$ $\alpha$and$$\beta $$ $\beta$generate the same multiplicative group modp. We prove a weaker result in the same direction for algebraic numbers$$\alpha , \beta $$ $\alpha ,\beta$. Let$$\alpha , \beta \in \overline{\mathbb {Q}} ^{\times }$$ $\alpha ,\beta \in {\overline{Q}}^{\times }$, and suppose$$|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\alpha )|\ne 1$$ $|N_{Q(\alpha ,\beta )/Q}\left(\alpha \right)|\ne 1$and$$|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\beta )|\ne 1$$ $|N_{Q(\alpha ,\beta )/Q}\left(\beta \right)|\ne 1$. Then for some positive integer$$C = C(\alpha ,\beta )$$ $C=C(\alpha ,\beta )$, there are infinitely many prime idealsPof Equation missing<#comment/>where$$v_P(\alpha )=v_P(\beta )=0$$ $v_P\left(\alpha \right)=v_P\left(\beta \right)=0$and where the group$$\langle \beta \bmod {P}\rangle $$ $⟨\beta modP⟩$is a subgroup of$$\langle \alpha \bmod {P}\rangle $$ $⟨\alpha modP⟩$with$$[\langle \alpha \bmod {P}\rangle \,{:}\, \langle \beta \bmod {P}\rangle ]$$ $[⟨\alpha modP⟩:⟨\beta modP⟩]$dividingC. A key component of the proof is a theorem of Corvaja and Zannier bounding the greatest common divisor of shiftedS-units. 

Abstract Let denote the exponent of the multiplicative group modulon. We show that whenqis odd, each coprime residue class moduloqis hit equally often by asnvaries. Under the stronger assumption that , we prove that equidistribution persists throughout a Siegel–Walfisz‐type range of uniformity. By similar methods we show that obeys Benford's leading digit law with respect to natural density. Moreover, if we assume Generalized Riemann Hypothesis, then Benford's law holds for the order ofamodn, for any fixed integer . 

Abstract We investigate the leading digit distribution of thekth largest prime factor ofn(for each fixed$$k=1,2,3,\dots $$) as well as the sum of all prime factors ofn. In each case, we find that the leading digits are distributed according to Benford’s law. Moreover, Benford behavior emerges simultaneously with equidistribution in arithmetic progressions uniformly to small moduli.