No one can possibly help you if you do not supply every definition.
For example, what does A(k,m) mean?
Problem :: Show that A(1,n) = 2^n whenever n greater than or equal to 1:
This is what i have so far:
proof by induction:
Basis Step: n =1 so we need to comput A(1,1) and A(1,1) equals 3
Inductive Step: Assume A(1, n-1) = 2^(n-1) and consider A(1, n)
I dont know if any of this is correct.. need some help here
I am stuck on this same problem. But I think we do use induction.I have this:
Base Case:
A(1, n) = n + 2
n + 2 = 2^(n) Let n = 2
2 + 2 = 2^(2)
4 = 4 Base case holds
Induction Step:
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?
@ Grandad : the code is :
[url=http://.....]name for the link[/url]
(note that the part "name for the link" can include bbcode such as bold, color, etc...)
for example :
[url=http://www.mathhelpforum.com/math-help/][b][color=red]Your maths website[/color][/b][/url] gives :
Your maths website
Why one rather than another ?or delete 1 of them