The Goldbach Conjecture, Part 2 - MATLAB Cody - MATLAB Central

Problem 64. The Goldbach Conjecture, Part 2

Difficulty:
(73)
Rate

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

66.79% Correct | 33.21% Incorrect
Last Solution submitted on Apr 25, 2025

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers2372

Suggested Problems

More from this Author96

Problem Tags

primes

Community Treasure Hunt

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

Start Hunting!
Go to top of page