CSC 4640: Project 6

Project 6:
prolog("Prolog", 6, "Prolog")

Assigned: Wed Feb 26 2025
Due: 11:59:00 PM on Fri Mar 14 2025
Team Size: 1
Language: SWI-Prolog
Out of: 100 points

In this project you'll be writing a bunch of recursive procedures in prolog. (It may look a lot like my fruitful recursion project in intro programming.)

Part 0, 0 points: Look at the submission instructions below to set up your folder and source code file name.

Part 1, 1 points: Write the factorial functor:

?- factorial(0, X).
X = 1
?- factorial(5, X).
X = 120
?- factorial(-1, X).
false
?- factorial(6, X).
X = 720

Part 2, 1 points: Write the fibonacci functor:

?- fibonacci(0, X).
X = 0
?- fibonacci(1, X).
1
?- fibonacci(10, X).
X = 55
?- fibonacci(20, X).
X = 6765
?- fibonacci(-1, X).
false

Part 3, 15 points: The string_concat/3 procedure can used in a similar way to plus:

?- string_concat("monkey", "banana", X).
X = "monkeybanana".
?- string_concat(X, "banana", "monkeybanana").
X = "monkey".
?- string_concat("monkey", X, "monkeybanana").
X = "banana".

Use this to write the repeat_string functor, which acts like string multiplication:

?- repeat_string("mouse", 5, String).
String = "mousemousemousemousemouse"

Part 4, 20 points: Write the functor prime(N), which succeeds when the parameter is prime:

?- prime(1).
false
?- prime(2)
true
?- prime(10007).
true

Part 5, 19 points: Write the functor triangular_number(N, T), which unifies when 1 + 2 + ... + N = T:

?- triangular_number(2, T).
T = 3
?- triangular_number(10, T)
T = 55
?- triangular_number(-1, T).
false

Part 6, 5 points: Write the functor tetrahedral_number(N, T), which unifies T is the Nth tetrahedral number:

?- tetrahedral_number(2, T).
T = 4
?- tetrahedral_number(5, T)
T = 35
?- tetrahedral_number(-1, T).
false

Part 7, 17 points: You can get the first character by using sub_string/5 like this:

?- sub_string("hamburger", 0, 1, _, FirstChar).
FirstChar = "h".

You can also use it to get the last character of a string like this:

?- string_length("hamburger", N),
|    M is N-1,
|    sub_string("hamburger", M, 1, _, LastChar).
LastChar = "r".

You can get the middle of a string by using it like this:

?- string_length("hamburger", N),
|    L is N-2, 
|    sub_string("hamburger", 1, L, _, Middle).
Middle = "amburge".

Use all that to write a functor palindrome(String), which succeeds when String is a palindrome:

?- palindrome("I").
true.
?- palindrome("racecar").)
true.
?- palindrome("at").
false
?- palindrome("racetar").
false.

Part 8, 10 points: Write the functor power(Power, Base), which succeeds when there exists an integer n such that Base raised to n equals Power:

?- power(81, 3).
true
?- power(250, 250).
true
?- power(500, 250).
false

Part 9, 5 points: Write the functor gcd(A, B, Divisor), which unifies Divisor with the greatest common divisor of A and B:

?- gcd(60, 40, X).
X = 20 .
?- gcd(64, 40, X).
X = 8 .
?- gcd(40, 131, X).
X = 1 .

Part 10, 4 points: Update repeat_string so that it works in reverse:

?- repeat_string(S, 3, "monkeymonkeymonkey").
S = "monkey" .
?- repeat_string(S, 6, "monkeymonkeymonkeymonkeymonkeymonkey").
S = "monkey" .
?- repeat_string(S, 2, "bananamonkey").
false.

Part 11, 3 points: Update factorial so that it works in reverse:

?- factorial(X, 6).
X = 3 .
?- factorial(X, 120).
X = 5 .
?- factorial(X, 200).
false.

Submitting your Project: Put all your procedure definitions in one file named project6.pl in a folder named <TeamName>Project6 where <TeamName> has all team members' (last) names separated by 'and' in PascalCase. For example, if I had worked with Alyssa Borgin, my folder name would be: BorginAndBurkeProject6. The code file should be located directly in that folder. Zip the folder up (don't change the file name) and upload the zip file to the assignment in Canvas.