## visualising prime numbers in binary

For a while now, I've wondered what the prime numbers look like in binary, that is, if you paint the ones as white dots, and the zeros as black dots, what does the whole set look like? I finally got around to writing a program to generate the prime numbers and output them as a PNG, and you can see the results below...

The above image illustrates how the plot works. Horizontally we have the 'units of twos' - i.e. the columns from right to left corresponds to increasing powers of 2. You've seen this before in decimal, where the columns are units, tens, hundreds, thousands and so on, but instead of the number 13 being made up by adding one ten and three units, we indicate the number thirteen as a sum of powers of two, i.e. 13 = 8 + 4 + 1. So, in this case, the 8,4 and 1 columns are white, and the others are black/blank.

Now we understand the columns, it's clear that each row is a different prime number. I chose to start with 1 (although this is not always considered prime), giving the sequence 1, 2, 3, 5, 7, 11, 13... Each row shows the prime number in the black/white binary form.

Over on the far right, we have two more images showning the first 9,593 primes and the first 9,593 numbers (i.e. including non-primes). I've put them in a scrollable box to make it easier to view. When I first plotted the primes, I was surprised by the complex and interesting pattern and the strong bifurcation motifs that repeat throughout. However, plotting the natural numbers in binary shows that this bifurcation is just an artefact of the choice of representation - the patterning of binary numbers is very clear here.

So, I'm not sure how much insight is to be gained from this plot, but it was interesting to make. It also illustrated the advantages of using Java, as this type of thing is very easy to create in a language with such strong support for graphics built into the standard libraries.

- andy's blog
- Login to post comments
- 14255 reads

## Good work

I've often puzzled if the riddle of the prime number can be solved on a purely 2 dimensional plain and whether numbers themselves necessarily hold the answer. This is really good work, keep going...

Dan