https://github.com/hspencer/primes_modulator

Finding patterns in prime numbers
https://github.com/hspencer/primes_modulator

mathematics processing

Last synced: about 1 month ago
JSON representation

Finding patterns in prime numbers

• Host: GitHub
• URL: https://github.com/hspencer/primes_modulator
• Owner: hspencer
• Created: 2017-02-26T16:14:50.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2017-02-26T16:17:50.000Z (almost 8 years ago)
• Last Synced: 2024-11-12T21:36:18.567Z (3 months ago)
• Topics: mathematics, processing
• Language: Processing
• Size: 757 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Primers Modulator

=================

After creating a simple script for generating an endless list of prime numbers, I tried to visualize them in a way that could reveal something interesting.

 

The first thing I tried to do was to put them in a archimedean spiral (r = a + b × t). Then I learned that Stanislaw Ulam, in 1963, came up with a simple yet revealing arrangement for prime numbers (Ulam's rose). He created a gridded square spiral that presented mysterious diagonal patterns that still remain unexplained.

![Ulam's Rose](data/ulams-rose.png)

 

From this starting point, I'm trying to design a tool for discovering the hidden patterns in the prime numbers.  If you play long enough, maybe you can find a hidden pattern that explains the aparent randomness of primes. Good luck!

Claim your prize at mathword.com, but remember to take your PDFs as a proof of your discovery. You'll need to run executable version in order to get a PDF.

~ Originally Dec 2006