Chapter 5: Q48E (page 359)
Find these values of Ackermann’s function.
- A (1,0)
- B (0,1)
- C (1,1)
- D (2,2)
Short Answer
- The value of A (1,0) is 2.
- The value of B (0,1) is 2.
- The value of C (1,1) is 3.
- The value of D (2,2) is 7.
Chapter 5: Q48E (page 359)
Find these values of Ackermann’s function.
All the tools & learning materials you need for study success - in one app.
Get started for freeTrace Algorithm 3 when it finds gcd (12,17) . That is, show all the steps used by Algorithm 3 to find gcd (12,17).
Let P(n) be the statement that , where n is an integer greater than 1.
a) What is the statement P(2)?
b) Show that P(2) is true, completing the basis step of the proof.
c) What is the inductive hypothesis?
d) What do you need to prove in the inductive step?
e) Complete the inductive step.
f) Explain why these steps show that this inequality is true whenever n is an integer greater than 1.
Suppose that you know that a golfer plays the first hole of
a golf course with an infinite number of holes and that if
this golfer plays one hole, then the golfer goes on to play
the next hole. Prove that this golfer plays every hole on
the course.
Suppose you begin with a pile of n stones and split this pile into n piles of one stone each by successively splitting a pile of stones into two smaller piles. Each time you split a pile of stones into two smaller piles. Each time you split a pile you multiply the number of stones in each of the two smaller piles you form, so that if piles haver and s stones in them, respectively, you compute rs. Show that no matter how you split the piles, the sum of the products computed at each step equals .
Prove that
What do you think about this solution?
We value your feedback to improve our textbook solutions.