Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 5 - Section 5.3 - Recursive Definitions and Structural Induction - Exercises - Page 359: 49

Answer

Showing that A(m, 2) = 4 whenever m ≥ 1.

Work Step by Step

Let P(n) be “A(n, 2) = 4.” --Basis step: -P(1) is true because A(1, 2) = A(0, A(1, 1)) = A(0, 2) = 2 · 2 = 4. --Inductive step: - Assume that P(n) is true, that is, A(n, 2) = 4. Then -A(n + 1, 2) = A(n, A(n + 1, 1)) = A(n, 2) = 4.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.