{
  "id": "1602.02407",
  "version": "v1",
  "published": "2016-02-07T18:49:21.000Z",
  "updated": "2016-02-07T18:49:21.000Z",
  "title": "On the congruence ${1^n + 2^n + \\dotsb + n^n\\equiv p \\pmod{n}}$",
  "authors": [
    "Max Alekseyev",
    "Jose Maria Grau",
    "Amtonio Oller-Marcen"
  ],
  "categories": [
    "math.NT"
  ],
  "abstract": "It is well-known that the congruence $\\sum_{i=1}^{n} i^{n} \\equiv 1 \\pmod{n}$ has exactly five solutions: $\\{1,2,6,42,1806\\}$. In this work, we characterize the solutions to the congruence in the title for every prime $p $. This characterization leads to an algorithm that allows to compute all such solutions when there is finite number of them and, in general, to find all the solutions up to very high bounds in comparison to the computational complexity appearing if the problem is naively addressed by exhaustive search.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-02-07T18:49:21.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "congruence",
      "finite number",
      "high bounds",
      "characterization",
      "well-known"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160202407A"
    }
  }
}