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].
Solution Stats
Problem Comments
Recent Solvers786
Suggested Problems
-
137 Solvers
-
Vectorize the digits of an Integer
225 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
242 Solvers
-
339 Solvers
-
221 Solvers
More from this Author95
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today