it says "hint: where is the extra square unit" am i supposed to use a proof here? if so is this Fibonacci, generalized Fibonacci, Lucas number?
it says "hint: where is the extra square unit" am i supposed to use a proof here? if so is this Fibonacci, generalized Fibonacci, Lucas number?
Prove that fn+1fn-1-fn2=(-1)n for every positive integer n...
Prove: fn-3-fn=2fn+1 Confused on wheter to use strong induction or weak to prove this. and i am to solve it by factoring the left side of the equation...
that is g(n)=2g(n-1) i think i am stuck on where to plug in what.... i know that a series/sequence defined recursively is g(n)=g(n+1)=(n+1)g(n) so if g(1)=2 then for...
i know that the general form for super pi is ∏ak=am*am+1,...,an where k=m to n im cool with this if the limit is finite. but i get confused when my upper limit is n... my...
not sure what to do with these... the problem in my book reads show that [x+y] ≥ [x]+[y] for all reals x and y.....(brackets, not abs. value bars)
is this as simple as just plugging in real numbers for x? if so, let's say x=1 then we have [1]+[-1] would be 0 so the value for all real numbers in this particular summation would always be zero...