Proof by induction

actually what's really cool is that you can prove that t(n)=t(n-1)+2*t([n/2]) is divisible by whatever number you want as long as you choose t(0) the right way

Base case: T(1)=T(0)+2T(0)=3T(0)
Inductive case: assume for n

nigger you just went full retard

can't just assume [N/2] is a positive integer

actually you can
move aside brainlets better proof coming through

base: t(1)=t(0)+2t([1/2])=3t(0)

induction: t(n)|3 for 0

>can't just assume floor[N/2] is a positive integer

>CS majors

>what if N=1

>brainlets

This thread
My fucking sides.
It's too early for this, holy shit.

this is how iron sharpens iron user
through passive aggressive bullshit

The
>>move aside brainlets
Fucking killed me.

Nice proof user, I r8 -1/12 / e^-2ipi :^)