Hello, name101!
Here are some basic problems to get you warmed up . . .
Hello, And thanks for coming to have a look in here.
I'm in need of some study questions for mathimatical induction because my current issue of the text book does not have that chapter in there.
So all im asking is could someone or a group, give me some questions on mathimatical induction ranging from easy to harder (I need to rememeber how to do them )
I'll post up my answers and then they can be marked
Thanks in advance for anyhelp
~Regards
Name101
ok here we go.
Question 1:
after a few lines of working.
assuming n=k is true.
prove for n=(k+1)
Question 2:
test for n = 1
assume true for n=k
prove for n=k+1
Question 3:
test for n=1
assume true for n=k
prove for n=k+1
I think there Right
thanks for those if they are incorrect please point out. but I think I nailed them.
some more questions a little harder please.
~Regards
Name101
@ Cap't Black:
Ah, yes sorry. This was taking a lot longer than I thought to re-write my answers from the book and I was limited in time.( I had work to go to.)
Also another Question. how would I write my final statement at the end of the questions? to sum the question up.
@kalagota:
"tower of hanoi?"
mm never heard of these being called this name before.did a quick wiki search and found what they are to find I created one in wood work 5 years ago with no understanding of were it's origin was or name
I will post full working tomorrow night of the new questions I have recived.
For now im off to bed.
Thanks.
personally, i rewrite the statements and add "is true for all natural number n."
Tower of Hanoi -- from Wolfram MathWorld
they didn't give the inductive proof, try to understand how the puzzle works and then you can show that the formula is true.. Ü (but in case, i'll describe how the puzzle works..)