I looked at this problem a couple of days ago and after solving it, I decided to extend it by applying 2n coins over 2n + 1 spaces (n >=1) and discovered that the number of moves it would take appears to be n(n + 2) (or (n + 1)^2 -1 if you like). My problem now is trying to prove it. Although the proof is crying out for mathematical induction, I just cannot put my finger on the step which allows for this proof.
I can do it in one move. I turn the paper 180 degrees
Naughty! But hat's off to you. That's the sort of thinking that the great physicist Neils Bohr would have considered.
I looked at this problem a couple of days ago and after solving it, I decided to extend it by applying 2n coins over 2n + 1 spaces (n >=1) and discovered that the number of moves it would take appears to be n(n + 2)
(or (n + 1)^2 -1 if you like).
My problem now is trying to prove it. Although the proof is crying out for mathematical induction, I just cannot put my finger on the step which allows for this proof.
Thank you!!! I was so confused! Now I can do my math project on this!! You save my math class life!!
I figured this out in my head correctly before he showed how to do it.
genius
Good feat
Thank you... It helps me to slove a stage of game.. 😊
thanks for this logically appreciate your help
I got it on the first try.
Frog game i played
Got it!
Hooray, I got it! }|:oD
Very easy... sorry. :p
That was so stupid. Get a girlfriend.