An Extension of Fermat's Theorem (Q5532641)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3245577
Language Label Description Also known as
default for all languages
No label defined
    English
    An Extension of Fermat's Theorem
    scientific article; zbMATH DE number 3245577

      Statements

      An Extension of Fermat's Theorem (English)
      0 references
      0 references
      0 references
      1967
      0 references
      extension of Fermat's little theorem
      0 references
      The following theorem is proved. Let \(\lambda\) be the greatest positive integer such that \(a^{(p-1)/p^n}\equiv 1\pmod{p^{\lambda/p^n}}\), where \(p\) is prime and \((a,p) =1\). Then \[ \sum_{s=0}^r (-1)^{r-s} \binom{r}{s} a^{(t+(p-1)s/p^n)^k} \equiv 0\pmod{p^{\lambda r_k/p^k}} \] where \(t, k\) are integers and \(r_k= [(r+k - 1)/k]\). This theorem includes results proved by \textit{A. A. Trypanis} [Am. Math. Mon. 57, 87--89 (1950; Zbl 0036.02402)] and the reviewer [Am. Math. Mon.70, 247--250 (1963; Zbl 0113.26702)].
      0 references

      Identifiers