![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
I just spent about an hour staring at math homework and trying to figure out how I was supposed to solve a particular problem. After a while I gave up because staring at it, and rewriting it every way I could think of, wasn't actually helping me learn anything. As usual, I'm close to tears as a result. (I'll probably be fine, once I talk to the professor tomorrow before class. I hope.)
The real problem is that this class shouldn't be taught over a five week term. Period.
These proofs using the Fibonacci algorithm are killing me. I know what I'm supposed to do; I know that I'm supposed to be rewriting f(sub)n as f(sub)n-1 + f(sub)n-2 in some form or another in order to manipulate the equation so that I can use the inductive statement to replace part of it, so that I can eventually get to the statement I need to prove... but there are so many ways to rewrite these equations, and at this point I'm just getting to the point that it's more complicated than it was in the first place. (It doesn't help that when the professor tried to do this in class, he showed us how to start, then ended it when it didn't look anything like the statement we were trying to prove because we ran out of time.)
Specific specifics: Show that (f sub n+2)^2 - (f sub n+1)^2 = (f sub n) * (f sub n+3) for all n>=1.
The basis case is easy! I just... can't get anywhere with this induction proof.
*sigh* At least the bit of number theory that we're studying makes more sense than this.
The real problem is that this class shouldn't be taught over a five week term. Period.
These proofs using the Fibonacci algorithm are killing me. I know what I'm supposed to do; I know that I'm supposed to be rewriting f(sub)n as f(sub)n-1 + f(sub)n-2 in some form or another in order to manipulate the equation so that I can use the inductive statement to replace part of it, so that I can eventually get to the statement I need to prove... but there are so many ways to rewrite these equations, and at this point I'm just getting to the point that it's more complicated than it was in the first place. (It doesn't help that when the professor tried to do this in class, he showed us how to start, then ended it when it didn't look anything like the statement we were trying to prove because we ran out of time.)
Specific specifics: Show that (f sub n+2)^2 - (f sub n+1)^2 = (f sub n) * (f sub n+3) for all n>=1.
The basis case is easy! I just... can't get anywhere with this induction proof.
*sigh* At least the bit of number theory that we're studying makes more sense than this.
no subject
Date: 2015-06-12 04:11 pm (UTC)From:F_n = F_(-1/2-sqrt(13)/2), F_n = F_(1/2 (sqrt(13)-1))
work? It's been a LONG time, but I think my wife and I could probably get back into gear with it.
no subject
Date: 2015-06-13 07:38 pm (UTC)From: