{
  "id": "1104.5235",
  "version": "v1",
  "published": "2011-04-27T20:00:50.000Z",
  "updated": "2011-04-27T20:00:50.000Z",
  "title": "A note on the $\\Sopfr(n)$ function",
  "authors": [
    "Ruslan Sharipov"
  ],
  "comment": "AmSTeX, 7 pages, amsppt style",
  "categories": [
    "math.NT"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-04-27T20:00:50.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11N60",
      "11N64",
      "11-04"
    ],
    "keywords": [
      "primes distribution function",
      "prime factors",
      "multiplicity",
      "conjectures"
    ],
    "note": {
      "typesetting": "AMS-TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1104.5235S"
    }
  }
}