Please tell us what you mean by A(1, n).
I am stuck on this same problem as the other guys topic. But I think we do use induction.I have this so far:
A(1, n) = n + 2
n + 2 = 2^(n) Let n = 2
2 + 2 = 2^(2)
4 = 4 Base case holds
We going to assume P(k) is true for all integers of k > 1
Induction Step (Confused Here):
We must prove for P(k+1)
What do I do next b/c I cant solve this?
Heres a link to Ackermanns Function:
Ackermann Function -- from Wolfram MathWorld
(Edit: Sorry! you already gave the link. I think its asking me to prove using Induction, which I tried in the 1st post. Doesn't help in the book but it shows 1 using Induction.)
Heres a link (it's at the bottom of the page: #50 on page 10/10):
(This is what we confused on.)
I agree with you its not correct b/c when I tried 1 since n >= 1 I would have LHS:1 + 2 = 3 = 2^(1) = 2RHS which is not equal, but it does work when n = 2, but like you also mention doesn't work with 3.