Tous les défis
Moyen 0 résolus 0 % de réussite

Goldbach Partition

Write an even number as the sum of two primes, using the smallest possible first prime.

Ce que vous allez apprendre

  • Write a trial-division prime test that stops at √n
  • Search candidates in increasing order and stop at the first hit
  • Return a pair in the required order

Problème

Afficher la traduction

Goldbach's conjecture says that every even number greater than 2 is the sum of two primes. It has never been proven, but it has been checked far beyond the numbers here. Often there are several ways: 28 = 5 + 23 = 11 + 17. Find the one whose smaller prime is as small as possible.

Implement goldbach_partition(n).

Trying p = 2, 3, 5, ... and testing whether n − p is prime finds the answer quickly, because a small p almost always works. Testing a number up to 10^9 for primality by trial division only needs divisors up to about 31,623.

Input

n: An even number greater than 2.

Output

Return [p, q] where p and q are primes, p + q = n, p ≤ q, and p is the smallest prime for which this works.

Contraintes

4 ≤ n ≤ 10^9, n is even

Exemples

Exemple 1
Entrée :
n = 28

Sortie attendue :
expected = [5, 23]
Entrée :
long long n = 28;

Sortie attendue :
std::vector<long long> expected = {5, 23};
Entrée :
long n = 28;

Sortie attendue :
long[] expected = new long[] {5, 23};

Explication

28 − 2 = 26 and 28 − 3 = 25 are not prime, but 28 − 5 = 23 is, so the answer is [5, 23].

Exemple 2
Entrée :
n = 4

Sortie attendue :
expected = [2, 2]
Entrée :
long long n = 4;

Sortie attendue :
std::vector<long long> expected = {2, 2};
Entrée :
long n = 4;

Sortie attendue :
long[] expected = new long[] {2, 2};

Explication

The only option is 2 + 2, so the answer is [2, 2].

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Try p = 2, 3, 4, ... and stop at the first p where both p and n − p are prime.

Indice 2

A prime test only needs to try divisors up to the square root.

Indice 3

Since you stop at the smallest p, p ≤ n − p comes for free.

Complexité attendue

O(k √n) time where k is the number of candidates tried, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.