Resolve "Rec. equations to solve using repeated unfolding (+induction)"
Added 3 recurrence equations. For the first two, they only have to give a closed form (can be by educated guess) and also give the correct complexity in Big-Oh. For the last one, they need to derive the closed form by repeatedly unfolding and afterwards prove that it correctly corresponds to the equation by using a proof by induction.
This MR includes several files:
-
description.md, this is the top exercise level description -
description_equation_{number}.md, this is the description of a single recurrence equation -
solution_equation_{number}.md, this is the solution a single recurrence equation
Closes #20 (closed)
Edited by Kevin Chong