[英]Prime numbers Prolog
I have written Prolog code to (try) find prime numbers between 0 and N. I am however unable to filter out composite numbers.我已经编写了 Prolog 代码来(尝试)找到 0 和 N 之间的素数。但是我无法过滤掉合数。
Any advice would be great.任何建议都会很棒。
check(N, 2) :-
N mod 2 =:= 0.
plist(N, List) :-
X>1,
findall(Z, between(1, N, Z), L1),
list(L1, 2, List).
list([], _, []).
list([H | Tail1], 2, [H | Tail2]) :-
\+ divide(H, 2),
list(Tail1, 2, Tail2).
list([H | Tail1], 2, List) :-
divide(H, 2),
list(Tail1, 2, List).
Start coding a predicate is_prime(N) :- ....
without any optimization, just looping from 2 to N-1 (of course, you can stop at square root of N, but it's not so important right now...).开始编写谓词
is_prime(N) :- ....
没有任何优化,只是从 2 循环到 N-1 (当然,你可以停在 N 的平方根处,但现在它并不那么重要......) .
You can test it at the command line, ?- is_prime(13).
您可以在命令行上对其进行测试,
?- is_prime(13).
should give true, ?- is_prime(21).
应该给真,
?- is_prime(21).
should give false...应该给假...
Then you have done:然后你做了:
plist(N, List) :-
findall(Z, (between(1, N, Z), is_prime(Z)), List).
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.