Partition an integer x into n primes: Difference between revisions
Content added Content deleted
(Added C solution) |
m (Minor edit to Prolog code) |
||
| Line 1,420: | Line 1,420: | ||
retract(is_prime(S)), |
retract(is_prime(S)), |
||
!, |
!, |
||
Q is S + P, |
Q is S + 2 * P, |
||
cross_out(Q, N, P). |
cross_out(Q, N, P). |
||
cross_out(S, N, P):- |
cross_out(S, N, P):- |
||
Q is S + P, |
Q is S + 2 * P, |
||
cross_out(Q, N, P).</lang> |
cross_out(Q, N, P).</lang> |
||