When you start, this will start calculating primes and the amount of unique pairs of primes that can be added to create a certain even number (#10 being the tenth even number, or 20). If any number above 2 is has 0 pairs, Goldbach's conjecture (all even numbers above 2 can be written as the sum of 2 primes) is false. It will also calculate which even numbers break the record for most pairs and the new record they set in the format [record breaker] [new record].
!!WARNING!! This takes up a lot of computer power! Decided to do this for fun/as a challenge. I checked the 2711th even number, or 5422, for accuracy and it got 67 pairs, which I found to be correct after cross-checking with other code. Update 1, Nov 15, 2024: I changed to check only up to sqrt(n) for divisibility and it made my code SO MUCH faster. Thanks to my math teacher for this idea!
