The Goldbach conjecture asserts that every even integer greater than 2 can be expressed as the sum of two primes.
Given the even integer n, return c, the number of different ways two primes can be added to result in n. Only count a pair once; the order is unimportant.
Example:
Input n = 10 Output c is 2
because of the prime pairs [3 7] and [5 5].
Input n = 50 Output c is 4
because of [3 47], [7 43], [13 37], and [19 31].
Make the vector [1 2 3 4 5 6 7 8 9 10]
26892 Solvers
315 Solvers
Flip the main diagonal of a matrix
385 Solvers
197 Solvers
351 Solvers