Binary Representations of Inverted Primes – Continued


I’ve generated the binary representations of a few more inverted primes, from 37 to 67, to investigate whether the observed patterns continue.

In the following, I’ve used superscripts to represent multiple 1’s or 0’s, as illustrated for 1/37:

I’ve noted additional patterns beyond those previously mentioned, and I summarize them all here:

– excepting the special case of P1 = 2, the number of repeating digits for the n-th prime, Pn, is (Pn-1)
– the repeating groups of digits in each case have symmetry, in that the second half of the group is either identical to the first half, or, more commonly in these sets, is the inverse of the first half (e.g. 11101 in place of 00010)
– in most cases, 1/2 of all digits are 1. This includes, by inspection, all cases where the second half of the repeating pattern is the inverse of the first half, and some of the cases where the first and second halves are the same (e.g. 1/17 = 0.0000111100001111….
– the pattern always begins with “0” and ends with “1.” By inspection the first MUST be true. It’s not obvious why the second would necessarily always be true, and it may not, but it is for all cases examined so far

One may consider further that the only “important” digits after the binary point are those between the k-th and 2k-th positions after the binary point, where k is the position after the binary point of the first 1. This is true because the given prime, Pn, must be greater than 2^k, and not greater than [2^(k+1) – 2]. If the repeating pattern is truncated after the 2k-th binary digit and inverted and rounded, it will yield the prime number under consideration.

By “important” I only mean that one can obtain the prime number under consideration with only these digits. There may be other combinations of these same 2k digits that would lead to the same result, but if we know these first 2k digits (where the first k-1 are all 0, by definition, so we need only know k+1 digits), we can calculate the respective inverse prime number.

Here are the primes to 67 in illustration of this idea:

About petequinn

I'm a Canadian geotechnical engineer specializing in the study of landslides. I started this page to discuss some mathematical topics that interest me, initially this involved mostly prime numbers, but more recently I've diverted focus back to a number of topics of interest in geotechnique, geographic information systems and risk. I completed undergraduate training in engineering physics at Royal Military College (Kingston, Ontario), did a masters degree in civil (geotechnical) engineering at University of British Columbia (Vancouver), and doctorate in geological engineering at Queen's University (Kingston). I was a military engineer for several years at the beginning of my career, and did design and construction work across Canada and abroad. I've worked a few years for the federal government managing large environmental clean up projects in Canada's arctic, and I've worked across Canada, on both coasts and in the middle, as a consulting geotechnical engineer. My work has taken me everywhere in Canada's north, to most major Canadian cities and many small Canadian towns, and to Alaska, Chile, Bermuda, the Caribbean, Germany, Norway, Sweden, Bosnia, and Croatia. My main "hobby" is competitive distance running, which I may write about in future.
This entry was posted in Prime Numbers, Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s