January 23, 2002
Here is a recursive definition of ancestor, given the definition
of parent.
-
If y is a parent of x, then
y is an ancestor of x.
-
If y is a parent of x
and z is an ancestor of y, then
z is an ancestor of x.
-
If there is no proof that
y is an ancestor of x using the above
two rules, then y is not an ancestor of x.
Consider the following recursive definition of likable number.
-
1 is a likable number.
-
If n is a likable number, then 2n is a likable number.
-
If there is no proof that
x is a likable number using the above
two rules, then x is not a likable number.
Problem: what are the likable numbers?
Although you may discuss this assignment with others,
your homework must be hand-written, in your handwriting.
It must not be typed, printed, or xeroxed. Please turn it in at the
beginning of class on January 30.