1. Write a recursive prolog predicate that accepts two numbers X,Y as input. Output a list of all numbers less than or equal to X that are divisible by Y
2. Write a recursive Prolog predicate, called res1, to accept three numbers X, Y, Z as input. res1 should output to screen a list of all positive numbers less than or equal to X, that leave a remainder of 1 when divided by ((Y * Z)+2). Ensure XYZ are Positive.
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference
and should not be submitted as is. We are not held liable for any misuse of the solutions.
Please see the frequently asked questions page
for further questions and inquiries.
Kindly complete the form.
Please provide a valid email address and we will get back to you within 24 hours.
Payment is through PayPal, Buy me a Coffee
or Cryptocurrency.
We are a nonprofit organization however we need funds to keep this organization operating
and to be able to complete our research and development projects.
