Sexy primes: Difference between revisions

Content deleted Content added
m Efficiency improvement
m Simplified Prolog code
Line 1,454:
S1 is Size - 1,
sexy_prime_group(S1, N1, Limit, Group).
sexy_prime_groups(_, [], _, []):-
!.
sexy_prime_groups(Size, [P|Primes], Limit, [Group|Groups]):-
sexy_prime_group(Size, P, Limit, Group),
!,
sexy_prime_groups(Size, Primes, Limit, Groups).
sexy_prime_groups(Size, [_|Primes], Limit, Groups):-
sexy_prime_groups(Size, Primes, Limit, Groups).
 
print_sexy_prime_groups(Size, Primes, Limit):-
sexy_prime_groupsfindall(G, (is_prime(P), P =< Limit, sexy_prime_group(Size, PrimesP, Limit, G)), Groups),
length(Groups, Len),
writef('Number of groups of size %t is %t\n', [Size, Len]),
Line 1,505 ⟶ 1,496:
Max is Limit + 6,
find_prime_numbers(Max),
findallprint_sexy_prime_groups(P2, (is_prime(P), P =< Limit), Primes),
print_sexy_prime_groups(2, Primes3, Limit),
print_sexy_prime_groups(3, Primes4, Limit),
print_sexy_prime_groups(4, Primes5, Limit),
print_sexy_prime_groups(5, Primes, Limit),
unsexy_primes(Limit, Unsexy),
length(Unsexy, Count),