arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0607591math.NT
收藏

Ramanujan函数的算术性质

Arithmetic properties of the Ramanujan function

Florian Luca, Igor E Shparlinski

摘要:

研究了Ramanujan函数$τ(n)$的一些算术性质,如最大素除子$P(τ(n))$和不同素除子因子$τ(n)$的个数$ω(τ(n))$对不同的$n$序列的影响.特别地,我们证明了对于无穷多个$n$,\hbox{$P(τ(n)) \geq (\log n)^{33/31 + o(1)}$}是唯一的,对于每个素数$p$,\begin{equation*} P(τ(p)τ(p^2)τ(p^3)) > (1+o(1))\frac{\log\log p\log\log\log p} {\log\log\log\log p} \end{equation*}是唯一的,并且\hbox{$τ(p)\neq 0$}是唯一的.

英文摘要:

We study some arithmetic properties of the Ramanujan function $τ(n)$, such as the largest prime divisor $P(τ(n))$ and the number of distinct prime divisors $ω(τ(n))$ of $τ(n)$ for various sequences of $n$. In particular, we show that \hbox{$P(τ(n)) \geq (\log n)^{33/31 + o(1)}$} for infinitely many $n$, and \begin{equation*} P(τ(p)τ(p^2)τ(p^3)) > (1+o(1))\frac{\log\log p\log\log\log p} {\log\log\log\log p} \end{equation*} for every prime $p$ with \hbox{$τ(p)\neq 0$}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑