Problem 64. The Goldbach Conjecture, Part 2
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
-
3 Comments
For some reason the 'nthprime' function is not recognized, however it works for me in my desktop MATLAB.
@Dima Panna 'nthprime' uses symbolic math toolbox which is not supported in cody
I have used same solution approach as in goldbach conjecture part 1.
Solution Comments
Show commentsProblem Recent Solvers2372
Suggested Problems
-
13604 Solvers
-
435 Solvers
-
Sum of first n terms of a harmonic progression
450 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
12254 Solvers
-
Find out missing number from a vector of 9 elements
302 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!