Can someone help me with this one: Use induction to show that A (1,n) = n+2, n =0, 1...How do I start here? Thank you.
My guess is that A(m, n) is the Ackermann function. Do you have the same definition as in Wikipedia? Just follow the regular procedure for proofs by induction: identify the property P(n) you are proving for all n, prove the base case P(0), state the induction hypothesis and the goal for the induction step, etc. For more on the generic procedure, see this post.
Yes, this is the outline. So, for the base case, A(1, 0) = A(0, 1) = 2 applying the second and then the first line of definition. For the step, A(1, n + 1) = A(0, A(1, n)) by the third line of definition. Can you continue by using the inductive hypothesis?
I assume the definition you have is the following.
$\displaystyle A(m, k) =\begin{cases}k+1 & \mbox{if } m = 0 \\A(m-1, 1) & \mbox{if } m > 0 \mbox{ and } k = 0 \\A(m-1, A(m, k-1)) & \mbox{if } m > 0 \mbox{ and } k > 0.\end{cases}$
Note: compared to the Wiki link above, I systematically replaced $\displaystyle n$ with $\displaystyle k$ everywhere in the definition. This is OK because $\displaystyle n$ is just a placeholder that relates the left- and right-hand sides; it show where a number that is the second argument of the left-hand side is used in the right-hand side.
To compute $\displaystyle A(0, n+2)$, you compare $\displaystyle A(0, n+2)$ with the definition's left-hand side, i.e., $\displaystyle A(m, k)$. These two expressions match if $\displaystyle m = 0$ and $\displaystyle k= n + 2$. Then you replace $\displaystyle m$ with 0 and $\displaystyle k$ with $\displaystyle n + 2$ everywhere in the right-hand side. You get
$\displaystyle \begin{cases}(n+2)+1 & \mbox{if } 0 = 0 \\A(0-1, 1) & \mbox{if } 0 > 0 \mbox{ and } n+2 = 0 \\A(0-1, A(0, (n+2)-1)) & \mbox{if } 0 > 0 \mbox{ and } n+2 > 0.\end{cases}$
Now you need to select of one of these three values based on which of the corresponding conditions is true.