Ruslan Sharipov
Published 2011-04-27Version 1
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.
Comments: AmSTeX, 7 pages, amsppt style
Les conjectures de Weil : origines, approches, généralisations
Values of modular functions at real quadratics and conjectures of Kaneko
Conjectures and results on $x^2$ mod $p^2$ with $4p=x^2+dy^2$
![QR code for arXiv:1104.5235 [math.NT]](http://oss.arxitics.com/images/favicon.svg)