Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

Goldbach Partition

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

Lo que aprenderás

  • 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

Problema

Ver traducción

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.

Restricciones

4 ≤ n ≤ 10^9, n is even

Ejemplos

Ejemplo 1
Entrada:
n = 28

Salida esperada:
expected = [5, 23]
Entrada:
long long n = 28;

Salida esperada:
std::vector<long long> expected = {5, 23};
Entrada:
long n = 28;

Salida esperada:
long[] expected = new long[] {5, 23};

Explicación

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

Ejemplo 2
Entrada:
n = 4

Salida esperada:
expected = [2, 2]
Entrada:
long long n = 4;

Salida esperada:
std::vector<long long> expected = {2, 2};
Entrada:
long n = 4;

Salida esperada:
long[] expected = new long[] {2, 2};

Explicación

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

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

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

Pista 2

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

Pista 3

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

Complejidad esperada

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

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.