Recent content by dlemke

Prove C = G C = {x + 7: x ∈ N} and G = {x : x ∈ N and x > 7} I can come up with a logical answer to this, but I can't come up with an algebraic answer, and I'm not sure if that matters, I just want to see if there is a more proper way to do this than what I came up with, which is: Let m...

f_{2k+3} = f_{2k+2} + f_{2k-1}. Oh, nice, so you are taking the LHS and rewriting it, and hopefully eventually transforming it into the original RHS of the assumption. Thank you so much! That first step just kills me. Ok, I will work more on this in the morning and repost. Thank you for...

For all k \in N, f(2k + 1)= f^{2}(k) + f^{2}(k + 1) I couldn't find this one in the forum... I am stuck on the induction step, really I have no idea how to get it going. Oh, and the k statements should be in subscript, I was having real problems with LaTex, misreading subs and sups. Thanks...