Commit 33d66d8e authored by Frank Huch's avatar Frank Huch
Browse files

Correct cdots

parent e6fa1b3d
......@@ -51,9 +51,9 @@
**Note:** Use auxiliary predicates such as `addP`, which are defined on positive numbers. Furthermore, use the following equations and develop equations for further combinations if necessary.
1+1 =2
1+(2\cdot N) =2\cdot N+1
1+(2\cdot N+1) =2\cdot (N+1)
1+1 =2
1+(2 * N) =2 * N+1
1+(2 * N + 1) =2 * (N+1)
2. When used in the opposite direction, e.g. with a query like `add(X, Y, pos(o(i)))`, Prolog computes all solutions, but, unfortunately, does not terminate. The reason is, that the Prolog program does not know that the sum of two positive numbers is greater than each summand, and thus increasing summands are tried.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment