Fading Coder

One Final Commit for the Last Sprint

Prime Pair Search and Other Algorithmic Problems

Prime Pair Search Description Given an even number, find two prime numbers that are closest to eachother and sum to the even number. Approach Precompute primes up to 100,000 using the Euler sieve. Then, for each input even number, iterate through the primes and check if both the current prime and th...