A note on the $\Sopfr(n)$ function

Ruslan Sharipov

A note on the $\Sopfr(n)$ function

Number Theory 2011-04-29 v1

Authors: Ruslan Sharipov

Abstract

The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and some conjectures for prime numbers formulated in terms of the $\Sopfr(n)$ function are suggested.

Keywords

divisor function prime numbers

Cite

@article{arxiv.1104.5235,
  title  = {A note on the $\Sopfr(n)$ function},
  author = {Ruslan Sharipov},
  journal= {arXiv preprint arXiv:1104.5235},
  year   = {2011}
}

Comments

AmSTeX, 7 pages, amsppt style

Related papers

View all related →