Abstract:We study a level analog of Euler's totient function for integer mosaics. Let $P_i(n)$ be the set of primes appearing in the first $i$ levels of the mosaic of $n$, and let $\varphi_i(n)$ count the integers $m\leq n$ for which $P_i(m)\cap P_i(n)=\varnothing$. We prove a Möbius divisor-sum formula for $\varphi_i(n)$ and reduce it to a sum over a set $\mathcal{V}_{i,S}$ of powerful integers. If $S\neq\varnothing$, $i\geq 2$, and $q=\min S$, then \[
|\mathcal{V}_{i,S}\cap[1,x]|\sim C_{i,S}x^{1/q}, \] with $C_{i,S}$ an explicit positive Euler-product constant. For fixed $S$, the density $\delta_i(S)$ of integers whose first $i$ levels avoid $S$ exists and has an Euler product; for nonempty $S$, $i\ge2$, and $q=\min S$, the number of such integers up to $N$ is $\delta_i(S)N+O_{i,S}(N^{1/q})$. Taking $S=P_i(n)$ gives \[
\frac{\varphi_i(n)}{n}=\delta_i(P_i(n))+O_\varepsilon(n^{-1/2+\varepsilon}) \] uniformly in $n$.
From: Mostafa Mirabi [view email]
[v1]
Mon, 22 Jun 2026 04:38:53 UTC (13 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。