I have recently gone into studying induction. I am having trouble in general performing such a proof and it is not so much that i dont understand what the induction is about but more the problem that I get the feeling that I don't posses the tools to perform such a proof.
example. I have seen in one induction example stating:
floor[log(m) +1] = floor[log(m)+log(2)] and i am sure there is a logical calculation rule supporting this fact but i just dont know it and lots of others. Yet!
So i was hoping you guys could point me to an already existing set of rules that one will find very usefull when performing induction(rewriting algorithms) or help me create one here.