The Corpus Christi Prime


This number is a prime, with 2688 digits. It also looks rather a lot like Corpus Christi College, Cambridge. The top left corner encodes my initials, JRH, in ASCII. The bottom right corner is my date of birth.

I was inspired by Numberphile’s most recent video, which demonstrates a prime number of 1350 digits, which looks like the coat of arms of Trinity Hall College, Cambridge.

How Was This Done?

I created some pixel art, which looks a bit like the College, but slightly squished since pixels are square, but characters are rectangles.


Next, I selected a font (Menlo) and counted the number of pixels used for each digit. I chose Menlo because it has very heavy zeros, which I thought might come in useful.

Then I wrote a program which generated an “ideal” number, based on these two pieces of information. I then manually made the two required modifications (which were not completely narcissistic – the number had to end with an odd digit, and numbers starting with 1 are ever so slightly more likely to be prime).

Finally, I generated random fluctuations in the number and tested each with the Miller-Rabin primality test. This produced a shortlist of numbers which were very very likely to be prime. I used Dario Alpern’s fantastic tool to determine whether any of them actually were prime. Of the 8 candidates I had generated overnight, all of them were prime, so I selected the nicest looking one, which you see above.

Why Was I Confident That This Would Work?

The prime number theorem tells us that there are approximately \frac{n}{\log (n)} primes less than n. So there are approximately

\frac{10^{2688}}{\log 10^{2688}} - \frac{10^{2687}}{\log 10^{2687}} \approx 1.6 \times 10^{2683}

2688-digit primes. So approximately one in every 6200 2688-digit numbers is prime. Now, I wasn’t looking at even numbers, so that reduces that number by half, so things are looking quite good.

I set my program running for a little bit and determined that on my hardware (a MacBook Air with a 1.7 GHz processor and 8GB of RAM) my program could determine whether about 30 2688-digit numbers are probably prime per minute. So I thought that it would take about 100 minutes to find a candidate. I had slightly overestimated this time: overnight (9 hours), I checked 25750 numbers and found 8 probable primes. This lines up pretty well with the back of the envelope calculation above.

The Number

Feel free to check whether it is prime:


8 thoughts on “The Corpus Christi Prime

  1. Well done.

    So you are only 19 or 20, depending on whether your date of birth is written in crazy US format or at-least-in-order-of-magnitude most-of-rest-of-world format?!

    PS: My website went into a coma soon after it was born.


  2. This is fascinating stuff. Prime numbers have always interested me.
    By chance I discovered a way to factorize a number without having to divide anything. It turns out some easily-generated sequences have such a relationship that unless a term from one can be found in the other, then the value of n used to generate one of those sequences must be prime. These sequences need only a number of terms equal to a quarter of n and, thanks to a handy mathematical law it, each term need not have any more than a very low number of digits no matter how large the value of n. It seems to me it would be very easy for a powerful computer to generate and sort through the two sets of data looking for a match. Much easier than the current method of trying to divide huge numbers into huge numbers. Do you have any thoughts on this?


    1. Thanks! Your test reminds me of the Lucas primality test, and “thanks to a handy mathematical law it, each term need not have any more than a very low number of digits no matter how large the value of n” is reminiscent of modular arithmetic. If you’d like me to have a look in more detail, feel free to email me: my crsid (in the sidebar)

      Liked by 1 person

    2. The sequences that are generated involve no modular arithmetic. I discovered the procedure by using a very simple (non factor-related) algorithm to represent integers and discovered the pattern always corresponded to their known factors and prime numbers always looked ‘disordered’ compared to composites. Certainly modular arithmetic is used to more easily and quickly generate this graphic representation, but the algorithm works on its own. From this discovery I eventually derived the aforementioned 2-sequence procedure which I have proved infallibly identifies primes or can identify prime factors of n using knowledge of which matching terms produce ‘hits’.
      I’m not a mathematician and the mathematical reasoning behind this procedure is beyond my current ability to express in academic language; however, I will try to find a way of making it as clear as possible and get back to you. Thank you so much for your interest!


Leave a Reply

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

You are commenting using your 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