-
Notifications
You must be signed in to change notification settings - Fork 0
/
README.txt
30 lines (20 loc) · 1.1 KB
/
README.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
Overview: Goldbach theorum of two numbers and shows that every even and positive number is the sum of two prime numbers.
Length-Compare: Takes lists and checks to see if the first is larger than the second.
Website: (Editor and Compiler) https://swish.swi-prolog.org/
Quick Rundown of what the programs do and some examples and their results:
Test Queries for Prolog files
%Tests cases which have to be put into console separately per program
Length-Compare:
%Since ListA>ListB is true the program will return lengths of ListA and ListB to the user.
check_length([a,b,c,d], ListA),
check_length([a,b,c], ListB),
compare_length(ListA, ListB).
%Below the test case will be false and will return false to the console
check_length([a,b], ListC),
check_length([a,b,c], ListD),
compare_length(ListC, ListD).
-------------------------------------------------------------------------------------------------------
Goldbach:
%Will return L = [3,97] to user since 100 is a positive even interger
%Goldbach Conjecture: That every Positive Even number greater than 2 is the sum of two prime numbers.
gb(100, L).