Yioop - PHP Search Engine

-- Dec 1 In-Class Exercise Thread

generatePrime( 1 , [] ) :- !.

generatePrime( N , X ) :-

  not( isPrime( N ) ) , !,
  Z is N-1 ,
  generatePrime( Z , X ) .

generatePrime(N, [N | X] ):-

  Z is N-1 ,
  generatePrime( Z , X ) .my_for_loop(N) :- natural(I),
                  write(I), nl,
                  I < N, !.

(Edited: 2021-12-01)

generatePrime( 1 , [] ) :- !. generatePrime( N , X ) :- not( isPrime( N ) ) , !, Z is N-1 , generatePrime( Z , X ) . generatePrime(N, [N | X] ):- Z is N-1 , generatePrime( Z , X ) .my_for_loop(N) :- natural(I), write(I), nl, I < N, !.

-- Dec 1 In-Class Exercise Thread

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(W) Z=Z, not(composite(Y)). primeloop(N) :- prime(N), write(N), n1, n0, !.

<nowiki> whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(W) Z<Y, W<Y, Z>1, Y is Z*W. prime(Y) :- whole(Y), Y>=Z, not(composite(Y)). primeloop(N) :- prime(N), write(N), n1, n<100, n>0, !. </nowiki>

-- Dec 1 In-Class Exercise Thread

whole(1). whole(X) :- whole(X1),

            X is X1+1.

composite(Y) :- whole(Z), whole(A), Z < Y, A < Y, Z > 1, Y is Z*A.

prime(Y) :- whole(Y),

            Y >= 2,
            not(composite(Y)).

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(A), Z < Y, A < Y, Z > 1, Y is Z*A. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)).

-- Dec 1 In-Class Exercise Thread

whole(1) whole(X): -whole(X1), X is X1+1 composite(Y): -whole(Z), whole (W), Z < Y, W < Y, Z > 1, Y is Z*W Prime(Y) :- whole(Y) Y >= 2, not(composite(Y))

-- Dec 1 In-Class Exercise Thread

whole (1). whole (X) :- whole(X1), X is X1 + 1 . composite (Y) :- whole(W) Z < Y, W < Y, Z > 1, Y is Z * W . prime (Y) :- whole(Y), Y >= Z, not(composite(Y)) .

my_for_loop(N) :- prime(N), write(N), n1, N < 100, N > 0, !.

whole (1). whole (X) :- whole(X1), X is X1 + 1 . composite (Y) :- whole(W) Z < Y, W < Y, Z > 1, Y is Z * W . prime (Y) :- whole(Y), Y >= Z, not(composite(Y)) . my_for_loop(N) :- prime(N), write(N), n1, N < 100, N > 0, !.

-- Dec 1 In-Class Exercise Thread

 whole(1).
 whole(X) :- whole(X1), 
             X is X1+1.
 composite(Y) :- whole(Z),
                 whole(W), 
                 Z < Y, 
                 W < Y, 
                 Z > 1, 
                 Y is Z * W.
 prime(Y) :- whole(Y), 
             Y >= Z, 
             not(composite(Y)).

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z * W. prime(Y) :- whole(Y), Y >= Z, not(composite(Y)).

-- Dec 1 In-Class Exercise Thread

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z * W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)).

<nowiki> whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z * W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)). </nowiki>

-- Dec 1 In-Class Exercise Thread

 whole(1).
 whole(X) :- whole(X1), X is X1+1.
 composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W.
 prime(Y) :- whole(Y),
             Y >= 2,
             not(composite(Y)).

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)).

-- Dec 1 In-Class Exercise Thread

whole(1).
whole(X) :- whole(X1), X is X1+1.
composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W.
prime(Y) :- whole(Y),
            Y >= 2,
            not(composite(Y)).

<pre> whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)). </pre>

-- Dec 1 In-Class Exercise Thread

whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)).

<nowiki> whole(1). whole(X) :- whole(X1), X is X1+1. composite(Y) :- whole(Z), whole(W), Z < Y, W < Y, Z > 1, Y is Z*W. prime(Y) :- whole(Y), Y >= 2, not(composite(Y)). </nowiki>