Problem 64. The Goldbach Conjecture, Part 2

Created by Cody Team

Solve Later

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].

Solve

Solution Stats

2003 Solutions
978 Solvers

Last Solution submitted on Jan 27, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Dima Panna on 1 Jun 2019

For some reason the 'nthprime' function is not recognized, however it works for me in my desktop MATLAB.

Asif Newaz on 1 Nov 2019

@Dima Panna 'nthprime' uses symbolic math toolbox which is not supported in cody

Problem Recent Solvers978

Problem Tags

primes

Problem 64. The Goldbach Conjecture, Part 2

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers978

Suggested Problems

More from this Author95

Problem Tags

Problem 64. The Goldbach Conjecture, Part 2

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers978

Suggested Problems

More from this Author95

Problem Tags

Players