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

3913 Solutions
2365 Solvers

Last Solution submitted on Dec 27, 2024

Last 200 Solutions

Problem Comments

3 Comments

3 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

Faisal deshpande on 28 Aug 2021

I have used same solution approach as in goldbach conjecture part 1.

Solution Comments

Show comments

Problem Recent Solvers2365

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 64. The Goldbach Conjecture, Part 2

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2365

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Problem 64. The Goldbach Conjecture, Part 2

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2365

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Players