Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Bernoulli number
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== The Kummer theorems === The Bernoulli numbers are related to [[Fermat's Last Theorem]] (FLT) by [[Ernst Kummer|Kummer]]'s theorem,{{r|Kummer1850}} which says: :If the odd prime {{mvar|p}} does not divide any of the numerators of the Bernoulli numbers {{math|''B''<sub>2</sub>, ''B''<sub>4</sub>, ..., ''B''<sub>''p'' β 3</sub>}} then {{math|''x''<sup>''p''</sup> + ''y''<sup>''p''</sup> + ''z''<sup>''p''</sup> {{=}} 0}} has no solutions in nonzero integers. Prime numbers with this property are called [[regular prime]]s. Another classical result of Kummer are the following [[Modular arithmetic#Congruence|congruences]].{{r|Kummer1851}} {{main|Kummer's congruence}} :Let {{mvar|p}} be an odd prime and {{mvar|b}} an even number such that {{math|''p'' β 1}} does not divide {{mvar|b}}. Then for any non-negative integer {{mvar|k}} :: <math> \frac{B_{k(p-1)+b}}{k(p-1)+b} \equiv \frac{B_{b}}{b} \pmod{p}. </math> A generalization of these congruences goes by the name of {{math|''p''}}-adic continuity.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)