English

Must a primitive non-deficient number have a component not much larger than its radical?

Number Theory 2024-12-12 v3

Abstract

Let nn be a primitive non-deficient number where n=p1a1p2a2pkakn=p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k} where p1,p2pkp_1, p_2 \cdots p_k are distinct primes. We prove that there exists an ii such that piai+1<2k(p1p2p3pk).p_i^{a_i+1} < 2k(p_1p_2p_3\cdots p_k). We conjecture that in fact one can always find an ii such that piai+1<p1p2p3pk{p_i}^{a_i+1} < p_1p_2p_3\cdots p_k.

Keywords

Cite

@article{arxiv.2005.12115,
  title  = {Must a primitive non-deficient number have a component not much larger than its radical?},
  author = {Joshua Zelinsky},
  journal= {arXiv preprint arXiv:2005.12115},
  year   = {2024}
}

Comments

8 pages. This version tighter bounds than the first version due to a suggestion by Jan-Christoph Schlage-Puchta