Partition an integer x into n primes: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Added C solution
m Minor edit to Prolog code
Line 1,420:
retract(is_prime(S)),
!,
Q is S + 2 * P,
cross_out(Q, N, P).
cross_out(S, N, P):-
Q is S + 2 * P,
cross_out(Q, N, P).</lang>
 
Retrieved from "https://rosettacode.org/wiki/Partition_an_integer_x_into_n_primes"