Tags » Primes

Factorization diagram card redesign: feedback welcome!

After getting a printed set of factorization diagram cards, I decided there were a few design tweaks I wanted to make. I’ve gone through a few iterations and I think they are definitely better now. 96 more words


Guten abend Prof. Riemann

Ever since I “got it” 4 years ago, I’ve been looking for a way to express it in various ways. Everyday language is pretty useless, and everyone who “gets it” knows this for sure. 1,496 more words


Vinogradov's Three-Prime Theorem (with Sammy Luo and Ryan Alweiss)

This was my final paper for 18.099, seminar in discrete analysis, jointly with Sammy Luo and Ryan Alweiss.

We prove that every sufficiently large odd integer can be written as the sum of three primes, conditioned on a strong form of the prime number theorem. 1,507 more words


Last Dance on Primes

Ok, here’s all you need to know. (And if you giveth not a sh*t about numbers, just click out now; check how many ‘Likes’ Linsey Lohan got today..) I forgive you. 1,063 more words

Project Euler 12: Highly divisible triangular number

Question Text:

The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. 1,232 more words

Project Euler 10: Summation of primes

Question Text:

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million. 381 more words

Project Euler 7: 10001st prime

Question Text:

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. 705 more words