{"id":158,"date":"2024-01-25T02:23:27","date_gmt":"2024-01-25T02:23:27","guid":{"rendered":"https:\/\/thorshov.net\/?p=158"},"modified":"2024-01-25T03:54:30","modified_gmt":"2024-01-25T03:54:30","slug":"prime-reciprocals-repetends-and-repunits","status":"publish","type":"post","link":"https:\/\/thorshov.net\/index.php\/2024\/01\/25\/prime-reciprocals-repetends-and-repunits\/","title":{"rendered":"Prime Reciprocals, Repetends and Repunits"},"content":{"rendered":"\n

I was recently watching a numberphile video on YouTube<\/a>. Matt Parker explores a volume of work by William Shanks. Shanks calclulated the digit length of the repetend for the reciprocals of thousands of prime numbers. His work was carried out by hand in the mid to late 1800s. <\/p>\n\n\n\n

\"\"
Shanks’ table of prime numbers adjacent to the number of repeating digits in its reciprocal<\/figcaption><\/figure>\n\n\n\n

A number is called prime if it is greater than 1 and has only 1 and itself as a divisor. The first 10 prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. The following is c# code finds all primes less than 2^32 or 4,294,967,296 and saves them to a primes.bin.<\/p>\n\n\n\n

private void DoIt(){\n    BuildPrimeList(uint.MaxValue);\n    BinaryWriter primeFile = new BinaryWriter(File.OpenWrite(\"primes.bin\"));\n    foreach(uint prime in m_PrimeList)\n       primeFile.Write(prime);\n    primeFile.Close();\n}\n \nprivate void BuildPrimeList(uint maxCandidate)\n{\n    m_PrimeList = new List<uint>();\n    m_PrimeList.Add(2);\n    for (uint i = 3; i < maxCandidate; i+=2)\n       IsPrime(i);\n}\n\nprivate bool IsPrime(uint candidate)\n{\n    int maxFactor = (int)Math.Ceiling(Math.Sqrt(candidate))+1;\n    foreach (int prime in m_PrimeList){\n      if (candidate % prime == 0) return false;\n      if (prime > maxFactor) break;\n    }\n    m_PrimeList.Add(candidate);\n    return true;\n}<\/code><\/pre>\n\n\n\n
The recipracol of a number n, is simply 1\/n and when this fraction is converted to a decimal there are either finite digits or an infinite number of digits that repeat after some time.  All prime numbers with the exception of 2 and 5 have decimal representations of their reciprocals containing infinite digits with repeating patterns.  Consider the following examples:<\/p>\n\n\n\n
\n
\n
prime:  7
reciprocal:  1\/7
0.142857142857142857…
repeating digits:  6<\/p>\n<\/div>\n\n\n\n
\n
prime: 11
reciprocal: 1\/11
0.0909090909090909…
repeating digits: 2<\/p>\n<\/div>\n\n\n\n
\n
prime: 13
reciprocal: 1\/13
0.07692307692307692…
repeating digits:  6<\/p>\n<\/div>\n<\/div>\n\n\n\n
When the pages of Shanks’ work appeared on the screen I noticed a relationship between some of the numbers.  Many of the primes had a repeating digit count that was only one less then the prime number itself.  Similar to 7 above.   Then I noticed that some had half the repeating digits of one less than prime.  <\/p>\n\n\n\n
\"\"<\/figure>\n\n\n\n
I paused the video and tested a few on the page and saw that each prime was one more than a multiple of the digit count.  I supposed that this might be true for all the numbers in his list.  Since I did not have his list available I decided to write the following code create a dictionary that would replicate his work.    This way I could perform a test.<\/p>\n\n\n\n
private uint RecipricolDigits(uint num, uint max)\n{\n   uint digitCount = 0;\n   List<uint> used = new List<uint>((int)max);\n   uint remainder = 1 % num;\n   while (!used.Contains(remainder) && digitCount<=max){\n     digitCount++;\n     used.Add(remainder);\n     remainder = (remainder*10) % num;\n     }\n\n   return digitCount;\n}<\/code><\/pre>\n\n\n\n
For each prime p<1000 I found that the prime was infact one more than a multiple of the number of repeating digits.  I was curious if there might be a pattern to the multiples and decided to plot the against the prime number.<\/p>\n\n\n\n
\"\"
for each prime p<1000 I plot c such that c*(number of repeating digits)+1=p<\/figcaption><\/figure>\n\n\n\n
After deciding there was no obvious pattern I took interest in the spike represented by the prime 271.   1\/271 in decimal form is 0.00369003690036900…. For a relatively large prime it only has 5 repeating digits and 54*(5)+1=271.   At this point I decided to google 271 and found a wikipedia article<\/a> containing that number.<\/p>\n\n\n\n
This article discusses repunit numbers.   All digits of a repunit number are 1 therefor 1 , 11, 111, 1111, 11111, …… are repunit numbers.  271 appeared in a list of prime factors of the first thirty base 10 repunit numbers.  <\/p>\n\n\n\n
\"\"
https:\/\/en.wikipedia.org\/wiki\/Repunit<\/figcaption><\/figure>\n\n\n\n
Then I started to notice that all of the prime factors in the table had a low number of repeating digits within the decimal representation of its reciprocal.  If one were to thumb through Shanks’ pages these repunit factors would definitely stand out as having few repeating digits.  At this point I scripted some code that would calculate upto 265371653 rows of Shanks’ data and output a list ordered by the repeating digit count.  The following is a partial list of primes in assending order of repeat counts for their reciprocals. <\/p>\n\n\n\n
\n
\n
3         1\n11        2\n37        3\n101       4\n41        5\n271       5\n7         6\n13        6\n237       7\n4649      7<\/code><\/pre>\n\n\n\n
<\/p>\n<\/div>\n\n\n\n
\n
73          8\n137         8\n333667      9\n9091        10\n21649       11\n513239      11\n9901        12\n53          13\n79          13\n265371653   13<\/code><\/pre>\n<\/div>\n\n\n\n
\n
909091        14\n31            15\n2906161       15\n17            16\n5882353       16\n2071723       17\n19            18\n52579         18\n3541          20\n27961         20<\/code><\/pre>\n\n\n\n
<\/p>\n<\/div>\n<\/div>\n\n\n\n
I was amazed and excited to see these numbers reflecting exactly those red numbers in the repunit factorization table from above!   As the repunit numbers increase, so does the order that new prime factors appear!  3 being the only exception.   I don’t have the computing power to test all primes up to numbers as high as 5363222357 and beyond in a timely matter, but even now as I write this blog I am noticing that the repeating digit count represents the repunit sequence number for which the prime will first appear!<\/p>\n\n\n\n
R1 = 1
R2 = 11 = 11<\/strong>  (1\/11 has 2 repeating digits)
R3 = 111 = 3 \u00b7 37<\/strong> (1\/37 has 3 repeating digits)
R4 = 1111 = 11 \u00b7 101<\/strong>  (1\/101  has 4 repeating digits)
R5 = 11111 = 41 \u00b7 271<\/strong>   (1\/41 and 1\/271 have 5 repeating digits)
R6 = 111111 = 3 \u00b7 7<\/strong> \u00b7 11 \u00b7 13<\/strong> \u00b7 37 (1\/7 and 1\/13 have 6 repeating digits)
R7 = 1111111 = 239<\/strong> \u00b7 4649<\/strong> (1\/239 and 1\/4649 have 7 repeating digits)
R8 = 11111111= 11 \u00b7 73<\/strong> \u00b7 101 \u00b7 137<\/strong> (1\/73 and 1\/137 have 8 repeating digits)
R9 = 111111111 = 32<\/sup> \u00b7 37 \u00b7 333667<\/strong> (1\/333667 has 9 repeating digits) 
\u22ee<\/p>\n\n\n\n
PAUSE!!!!! Stop writing this blog!<\/p>\n\n\n\n
What? Why stop writing the blog? This is almost interesting for God’s sake!  It is years later now and I have resolved to continue adding content to my site so now I will explain.   <\/p>\n\n\n\n
I was so excited that I might have discovered something original.   What would it have felt like to sail the ocean blue and discover a new world?  How would it feel when you found out you weren’t the first to discover it?  I think this feeling has become common among many of us in the digital world.  The experience of starting down what you percieve to be an original road only to realize you are within someone elses old tracks.  There is a disappointment associated with learning that an idea is not original. This createive letdown caused me to put it all away and stop writing and stop exploring the repunit\/prime recipricol relationship.  As a result there would be no more insight, even if it was original, and there would be no more blog.  <\/p>\n\n\n\n
I discovered that my idea wasn’t original when reading a rather demoralizing sentence the history section of the aforementioned Wikipedia article<\/a>.<\/p>\n\n\n\n
\"It was found very early on that for any prime p greater than 5, the period of the decimal expansion of 1\/p is equal to the length of the smallest repunit number that is divisible by p.\"<\/pre>\n\n\n\n
I was able to glean the above “on my own” very quickly considering the youtube video and ensuing Wikipedia article were at my disposal, as well has having the power of a programming language and modern PC.  The road to my “high” was quick and so was the fall.   <\/p>\n\n\n\n
William Shanks spent a lifetime creating his tables and I admire his dedication to such a tedious task and believe he must have found peace through his accomplishments.  <\/p>\n","protected":false},"excerpt":{"rendered":"
I was recently watching a numberphile video on YouTube. Matt Parker explores a volume of work by William Shanks. Shanks calclulated the digit length of the repetend for the reciprocals of thousands of prime numbers. His work was carried out by hand in the mid to late 1800s. A number is called prime if it … <\/p>\n
Continue reading “Prime Reciprocals, Repetends and Repunits”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":165,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10,9],"tags":[],"_links":{"self":[{"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/posts\/158"}],"collection":[{"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/comments?post=158"}],"version-history":[{"count":9,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/posts\/158\/revisions"}],"predecessor-version":[{"id":187,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/posts\/158\/revisions\/187"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/media\/165"}],"wp:attachment":[{"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/media?parent=158"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/categories?post=158"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/thorshov.net\/index.php\/wp-json\/wp\/v2\/tags?post=158"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}