|
|
| Line 1: |
Line 1: |
| In [[mathematics]], '''Wolstenholme's theorem''' states that for a [[prime number]] ''p'' > 3, the congruence
| | Before enjoying a brand upcoming clash of clans crack tool, see the take advantage of book. Most mmorpgs possess a book you can buy individually. You ought to think about doing doing this and [http://Search.about.com/?q=studying studying] it a person play, or even while you are playing. In this fact manner, you can complete out of your game play.<br><br>To understand coins and gems, creosote is the obtain the Clash towards [http://Photobucket.com/images/Clans+hack Clans hack] equipment all by clicking on the pick up button. Contingent by the operating framework that tend to be utilizing, you will operate the downloaded document as being admin. Furnish one particular log in Id and select the gadget. Immediately after this, you are to get in the quantity of necklaces or coins that capable and start off one particular Clash of Clans hack instrument.<br><br>Steer clear of purchasing big title online flash games near their launch times. Waiting means that you're prone to obtain [http://circuspartypanama.com clash of clans cheats] after using a patch or two features emerge to mend manifest holes and bugs that impact your pleasure also game play. Equally keep an eye out in the open for titles from studios which are understood healthy patching and support.<br><br>Any time you feel like families targeted your enemy spot on in a present shooter and still missed, check what weapon you include using. Just for example in real life, different weapons have different plus points and weaknesses. The exact weapon you are using may not have your current short distance required in addition to the weapon recoil must be actually putting you a little bit off target.<br><br>A site is offering Clash for Clans hack tool dog trainer to users who want it to be. The website offering this tool is safe and it guarantees best quality software. There likewise other sites which secure the tool. But is a superb either incomplete or to do with bad quality. when users download these partially hack tools, instead to complete well they end all the way up in trouble. So, players are advised pick the tool from a webpage that offers complete computer software programs.Users who are finding it tough to cross the hurdles can locate a site that allows website visitors download the cheats. Most of the websites allow free download a few websites charge fees. Users can locate a website from where they can obtain good quality software.<br><br>It seems like computer games are pretty much everywhere these times. You can do play them on the best telephone, boot a the game console . in the home properly see them through social media optimisation on your personal mobile computer. It helps to comprehend this associated with amusement to help you'll benefit from the a great deal of offers which are out.<br><br>You don''t necessarily really need one of the complex troops to win wins. A mass volume of barbarians, your first-level troop, could well totally destroy an opponent village, and strangely it''s quite enjoyable to in the virtual carnage. |
| :<math>{2p-1 \choose p-1} \equiv 1 \pmod{p^3}</math>
| |
| holds, where the parentheses denote a [[binomial coefficient]]. For example, with ''p'' = 7, this says that 1716 is one more than a multiple of 343. An equivalent formulation is the congruence
| |
| :<math>{ap \choose bp} \equiv {a \choose b} \pmod{p^3}.</math> | |
| The theorem was first proved by [[Joseph Wolstenholme]] in 1862. In 1819, [[Charles Babbage]] showed the same congruence modulo ''p''<sup>2</sup>, which holds for all primes ''p'' (for ''p''=2 only in the second formulation). The second formulation of Wolstenholme's theorem is due to [[J. W. L. Glaisher]] and is inspired by [[Lucas' theorem]].
| |
| | |
| No known [[composite number]]s satisfy Wolstenholme's theorem and it is conjectured that there are none (see below). A prime that satisfies the congruence modulo ''p''<sup>4</sup> is called a '''[[Wolstenholme prime]]''' (see below).
| |
| | |
| As Wolstenholme himself established, his theorem can also be expressed as a pair of congruences for (generalized) [[harmonic number]]s:
| |
| :<math>1+{1 \over 2}+{1 \over 3}+...+{1 \over p-1} \equiv 0 \pmod{p^2} \mbox{, and}</math>
| |
| :<math>1+{1 \over 2^2}+{1 \over 3^2}+...+{1 \over (p-1)^2} \equiv 0 \pmod p. </math>
| |
| (Congruences with fractions make sense, provided that the denominators are coprime to the modulus.)
| |
| For example, with ''p''=7, the first of these says that the numerator of 49/20 is a multiple of 49, while the second says the numerator of 5369/3600 is a multiple of 7.
| |
| | |
| == Wolstenholme primes ==
| |
| {{main|Wolstenholme prime}}
| |
| | |
| A prime ''p'' is called a Wolstenholme prime [[If and only if|iff]] the following condition holds:
| |
| | |
| :<math>{{2p-1}\choose{p-1}} \equiv 1 \pmod{p^4}.</math>
| |
| | |
| If ''p'' is a [[Wolstenholme prime]], then Glaisher's theorem holds modulo ''p''<sup>4</sup>. The only known Wolstenholme primes so far are 16843 and 2124679 {{OEIS|id=A088164}}; any other Wolstenholme prime must be greater than 10<sup>9</sup>.<ref>{{Citation |first=R. J. |last=McIntosh |first2=E. L. |last2=Roettger |title=A search for Fibonacci−Wieferich and Wolstenholme primes |journal=Mathematics of Computation |volume=76 |issue=260 |year=2007 |pages=2087–2094 |doi=10.1090/S0025-5718-07-01955-2 |url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.9393&rep=rep1&type=pdf}}</ref> This result is consistent with the [[heuristic argument]] that the [[Modular arithmetic|residue modulo]] ''p''<sup>4</sup> is a [[pseudo-random]] multiple of ''p''<sup>3</sup>. This heuristic predicts that the number of Wolstenholme primes between ''K'' and ''N'' is roughly ''ln ln N − ln ln K''. The Wolstenholme condition has been checked up to 10<sup>9</sup>, and the heuristic says that there should be roughly one Wolstenholme prime between 10<sup>9</sup> and 10<sup>24</sup>. A similar heuristic predicts that there are no "doubly Wolstenholme" primes, meaning that the congruence holds modulo ''p''<sup>5</sup>.
| |
| | |
| == A proof of the theorem ==
| |
| | |
| There is more than one way to prove Wolstenholme's theorem. Here is a proof that directly establishes Glaisher's version using both combinatorics and algebra.
| |
| | |
| For the moment let ''p'' be any prime, and let ''a'' and ''b'' be any non-negative integers. Then a set ''A'' with ''ap'' elements can be divided into ''a'' rings of length ''p'', and the rings can be rotated separately. Thus, the cyclic group of order ''p<sup>a</sup>'' acts on the set ''A'', and by extension it acts on the set of subsets of size ''bp''. Every orbit of this group action has ''p<sup>k</sup>'' elements, where ''k'' is the number of incomplete rings, i.e., if there are ''k'' rings that only partly intersect a subset ''B'' in the orbit. There are <math>\textstyle {a \choose b}</math> orbits of size 1 and there are no orbits of size ''p''. Thus we first obtain Babbage's theorem
| |
| :<math>{ap \choose bp} \equiv {a \choose b} \pmod{p^2}.</math> | |
| Examining the orbits of size ''p<sup>2</sup>'', we also obtain
| |
| :<math>{ap \choose bp} \equiv {a \choose b} + {a \choose 2}\left({2p \choose p} - 2\right){a -2 \choose b-1} \pmod{p^3}.</math>
| |
| Among other consequences, this equation tells us that the case ''a=2'' and ''b=1'' implies the general case of the second form of Wolstenholme's theorem.
| |
| | |
| Switching from combinatorics to algebra, both sides of this congruence are polynomials in ''a'' for each fixed value of ''b''. The congruence therefore holds when ''a'' is any integer, positive or negative, provided that ''b'' is a fixed positive integer. In particular, if ''a=-1'' and ''b=1'', the congruence becomes
| |
| :<math>{-p \choose p} \equiv {-1 \choose 1} + {-1 \choose 2}\left({2p \choose p} - 2\right) \pmod{p^3}.</math>
| |
| This congruence becomes an equation for <math>\textstyle {2p \choose p}</math> using the relation
| |
| :<math>{-p \choose p} = \frac{(-1)^p}2{2p \choose p}.</math>
| |
| When ''p'' is odd, the relation is
| |
| :<math>3{2p \choose p} \equiv 6 \pmod{p^3}.</math>
| |
| When ''p''≠3, we can divide both sides by 3 to complete the argument.
| |
| | |
| A similar derivation modulo ''p''<sup>4</sup> establishes that
| |
| :<math>{ap \choose bp} \equiv {a \choose b} \pmod{p^4}</math>
| |
| for all positive ''a'' and ''b'' if and only if it holds when ''a=2'' and ''b=1'', i.e., if and only if ''p'' is a Wolstenholme prime.
| |
| | |
| == The converse as a conjecture ==
| |
| | |
| It is conjectured that if
| |
| :<math>{2n-1 \choose n-1} \equiv 1 \pmod{n^k},</math>
| |
| when ''k=3'', then ''n'' is prime. The conjecture can be understood by considering ''k'' = 1 and 2 as well as 3. When ''k'' = 1, Babbage's theorem implies that it holds for ''n'' = ''p''<sup>2</sup> for ''p'' an odd prime, while Wolstenholme's theorem implies that it holds for ''n'' = ''p''<sup>3</sup> for ''p'' > 3. When ''k'' = 2, it holds for ''n'' = ''p''<sup>2</sup> if ''p'' is a Wolstenholme prime. Only a few other composite values of ''n'' are known when ''k'' = 1 {{OEIS|A228562}}, and none are known when ''k'' = 2, much less ''k'' = 3. Thus the conjecture is considered likely because Wolstenholme's congruence seems over-constrained and artificial for composite numbers. Moreover, if the congruence does hold for any particular ''n'' other than a prime or prime power, and any particular ''k'', it does not imply that
| |
| :<math>{an \choose bn} \equiv {a \choose b} \pmod{n^k}.</math>
| |
| | |
| == Generalizations ==
| |
| | |
| Leudesdorf has proved that for a positive integer ''n'' coprime to 6, the following congruence holds:<ref>{{cite journal |author=Leudesdorf, C. |title=Some results in the elementary theory of numbers |journal=Proc. London Math. Soc. |volume=20 |year=1888 |pages=199–212 |doi=10.1112/plms/s1-20.1.199}}</ref>
| |
| :<math> \sum_{i=1\atop (i,n)=1}^{n-1} \frac{1}{i} \equiv 0\pmod{n^2}.</math>
| |
| | |
| == See also ==
| |
| * [[Fermat's little theorem]]
| |
| * [[Wilson's theorem]]
| |
| * [[Wieferich prime]]
| |
| * [[Wilson prime]]
| |
| * [[Wall-Sun-Sun prime]]
| |
| * [[List of special classes of prime numbers]]
| |
| * [[Table of congruences]]
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| *{{Citation |first=C. |last=Babbage |title=Demonstration of a theorem relating to prime numbers |journal=The Edinburgh philosophical journal |volume=1 |issue= |year=1819 |pages=46–49 |url=http://books.google.com/books?id=KrA-AAAAYAAJ&pg=PA46 }}
| |
| *{{Citation |first=J. |last=Wolstenholme |title=On certain properties of prime numbers |journal=The Quarterly Journal of Pure and Applied Mathematics |volume=5 |issue= |year=1862 |pages=35–39 |url=http://books.google.com/books?id=vL0KAAAAIAAJ&pg=PA35 }}
| |
| *{{Citation |first=J.W.L. |last=Glaisher |title=Congruences relating to the sums of products of the first n numbers and to other sums of products |journal=The Quarterly Journal of Pure and Applied Mathematics |volume=31 |year=1900 |pages=1–35}}
| |
| *{{Citation |first=J.W.L. |last=Glaisher |title=On the residues of the sums of products of the first p−1 numbers, and their powers, to modulus p<sup>2</sup> or p<sup>3</sup> |journal=The Quarterly Journal of Pure and Applied Mathematics |volume=31 |year=1900 |pages=321–353}}
| |
| *{{Citation |first=R. J. |last=McIntosh |title=On the converse of Wolstenholme's theorem |journal=Acta Arithmetica |volume=71 |issue=4 |year=1995 |pages=381–389 |url=http://matwbn.icm.edu.pl/ksiazki/aa/aa71/aa7144.pdf }}
| |
| *R. Mestrovic, [http://arxiv.org/abs/1111.3057 Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862—2012)].
| |
| | |
| == External links ==
| |
| * [http://primes.utm.edu/glossary/page.php?sort=Wolstenholme The Prime Glossary: Wolstenholme prime]
| |
| * [http://www.loria.fr/~zimmerma/records/Wieferich.status Status of the search for Wolstenholme primes]
| |
| | |
| [[Category:Classes of prime numbers]]
| |
| [[Category:Factorial and binomial topics]]
| |
| [[Category:Articles containing proofs]]
| |
| [[Category:Theorems about prime numbers]]
| |
Before enjoying a brand upcoming clash of clans crack tool, see the take advantage of book. Most mmorpgs possess a book you can buy individually. You ought to think about doing doing this and studying it a person play, or even while you are playing. In this fact manner, you can complete out of your game play.
To understand coins and gems, creosote is the obtain the Clash towards Clans hack equipment all by clicking on the pick up button. Contingent by the operating framework that tend to be utilizing, you will operate the downloaded document as being admin. Furnish one particular log in Id and select the gadget. Immediately after this, you are to get in the quantity of necklaces or coins that capable and start off one particular Clash of Clans hack instrument.
Steer clear of purchasing big title online flash games near their launch times. Waiting means that you're prone to obtain clash of clans cheats after using a patch or two features emerge to mend manifest holes and bugs that impact your pleasure also game play. Equally keep an eye out in the open for titles from studios which are understood healthy patching and support.
Any time you feel like families targeted your enemy spot on in a present shooter and still missed, check what weapon you include using. Just for example in real life, different weapons have different plus points and weaknesses. The exact weapon you are using may not have your current short distance required in addition to the weapon recoil must be actually putting you a little bit off target.
A site is offering Clash for Clans hack tool dog trainer to users who want it to be. The website offering this tool is safe and it guarantees best quality software. There likewise other sites which secure the tool. But is a superb either incomplete or to do with bad quality. when users download these partially hack tools, instead to complete well they end all the way up in trouble. So, players are advised pick the tool from a webpage that offers complete computer software programs.Users who are finding it tough to cross the hurdles can locate a site that allows website visitors download the cheats. Most of the websites allow free download a few websites charge fees. Users can locate a website from where they can obtain good quality software.
It seems like computer games are pretty much everywhere these times. You can do play them on the best telephone, boot a the game console . in the home properly see them through social media optimisation on your personal mobile computer. It helps to comprehend this associated with amusement to help you'll benefit from the a great deal of offers which are out.
You dont necessarily really need one of the complex troops to win wins. A mass volume of barbarians, your first-level troop, could well totally destroy an opponent village, and strangely its quite enjoyable to in the virtual carnage.