<p>For any positive integer <i>n</i>, let <i>σ</i>(<i>n</i>) be the sum of all positive divisors of <i>n</i>. For any prime <i>p</i> and any positive integer <i>m</i>, let <i>ν</i><sub><i>p</i></sub>(<i>m</i>) be the largest integer <i>α</i> such that <i>p</i><sup><i>α</i></sup> ∣ <i>m</i>. Recently, Amdeberhan, Moll, Sharma and Villamizar proved that for any odd prime <i>p</i> and any integer <i>n</i> ≥ 2, <i>ν</i><sub><i>p</i></sub>(<i>σ</i>(<i>n</i>)) ≤ [log<sub><i>p</i></sub> <i>n</i>] if <i>n</i> satisfies some conditions, where [<i>x</i>] denotes the least integer not less than <i>x</i>. In this paper, for any odd prime <i>p</i>, we prove that <i>ν</i><sub><i>p</i></sub>(<i>σ</i>(<i>n</i>)) ≤ [log<sub><i>p</i></sub> <i>n</i>] for all positive integers <i>n</i> unconditionally. Moreover, we prove that if 3 ≤ <i>p</i> &lt; 10<sup>5</sup> is a prime and <i>p</i> ≠ 31, then there are only finitely many positive integers <i>n</i> such that <i>ν</i><sub><i>p</i></sub>(<i>σ</i>(<i>n</i>)) = [log<sub><i>p</i></sub> <i>n</i>]. For <i>p</i> = 31 and <i>n</i> ≥ 2, <i>ν</i><sub><i>p</i></sub>(<i>σ</i>(<i>n</i>)) = [log<sub><i>p</i></sub> <i>n</i>] if and only if <i>n</i> = 2<sup>4</sup>, 5<sup>2</sup>, 2<sup>4</sup>5<sup>2</sup> and 2<sup>4</sup>5<sup>2</sup>(2 · 31<sup><i>s</i></sup> − 1), where <i>s</i> is a positive integer and 2 · 31<sup><i>s</i></sup> − 1 is a prime.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

p-adic Valuation of the Sum of Divisors

  • Junjia Zhao,
  • Yonggao Chen

摘要

For any positive integer n, let σ(n) be the sum of all positive divisors of n. For any prime p and any positive integer m, let νp(m) be the largest integer α such that pαm. Recently, Amdeberhan, Moll, Sharma and Villamizar proved that for any odd prime p and any integer n ≥ 2, νp(σ(n)) ≤ [logp n] if n satisfies some conditions, where [x] denotes the least integer not less than x. In this paper, for any odd prime p, we prove that νp(σ(n)) ≤ [logp n] for all positive integers n unconditionally. Moreover, we prove that if 3 ≤ p < 105 is a prime and p ≠ 31, then there are only finitely many positive integers n such that νp(σ(n)) = [logp n]. For p = 31 and n ≥ 2, νp(σ(n)) = [logp n] if and only if n = 24, 52, 2452 and 2452(2 · 31s − 1), where s is a positive integer and 2 · 31s − 1 is a prime.