Priming Goldbach

Inspiration

A few months ago, Veritasium posted a video on YouTube titled "The Obviously True Theorem No One Can Prove". It explained how Goldbach Conjectures are so obvious yet still unproven. Since then, I have been obsessed with it. I often try to find pairs, play around with numbers and it has been quite fun. So I decided to make a game out of it.

What it does

The reddit game is simply about finding two prime numbers such that their sum is the target even number. In the calc tab, the user can verify whether a number is prime or not and check if the sum actually equals to the number expected.

How we built it

Development process was quite simple with Devvit Web. I created a new app at https://developers.reddit.com/new. The given npm command bootstrapped the app and I was able to start the development using react in no time.

Challenges we ran into

The game was easy to build however, an important challenge was to ensure prime number calculation is not so big that server or game crashes yet I still wanted users to go for big numbers as smaller numbers are easy to solve. So right now, game gives target numbers between 500 and 1000000. Another challenge that was a bit problematic was understanding how reddit posts can be scheduled for the game. Reading documentation, I was able to solve it easy.

Accomplishments that we're proud of

A simple yet addictive game around numbers. I love things that are fun and productive at the same time.

What we learned

Devvit Web ofcourse. The ability to create games around posts is a bit different from what I am used to.

What's next for Priming Goldbach

Optimizing the prime number verification algorithm and increasing max possible target number.

Built With

• devvit
• react