Revision as of 13:08, 12 April 2020 (view source) Simonjsaunders (talk \| contribs) (Added Prolog Solution) ← Older edit		Revision as of 14:03, 12 April 2020 (view source) Simonjsaunders (talk \| contribs) m (Efficiency improvement) Newer edit →
Line 1,455: sexy_prime_group(S1, N1, Limit, Group). sexy_prime_groups(_, P[], ~~Limit~~_, []):- ~~P > Limit,~~ !. sexy_prime_groups(Size, [P\|Primes], Limit, [Group\|Groups]):- sexy_prime_group(Size, P, Limit, Group), !, sexy_prime_groups(Size, P1Primes, Limit, Groups).▼ ~~P1 is P + 1,~~ sexy_prime_groups(Size, P1[_\|Primes], Limit, Groups).:- sexy_prime_groups(Size, PPrimes, Limit, Groups):-. ~~P1 is P + 1,~~ ▲ sexy_prime_groups(Size, P1, Limit, Groups). print_sexy_prime_groups(Size, Primes, Limit):- sexy_prime_groups(Size, 2Primes, Limit, Groups), length(Groups, Len), writef('Number of groups of size %t is %t\n', [Size, Len]), Line 1,508 ⟶ 1,505: Max is Limit + 6, find_prime_numbers(Max), ~~print_sexy_prime_groups~~findall(2P, (is_prime(P), P =< Limit), Primes), print_sexy_prime_groups(32, Primes, Limit), print_sexy_prime_groups(43, Primes, Limit), print_sexy_prime_groups(54, Primes, Limit), print_sexy_prime_groups(5, Primes, Limit), unsexy_primes(Limit, Unsexy), length(Unsexy, Count),

Sexy primes (view source)