Introduction

This is a hand-in written by Group 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology.

Group 7 consists of:

• 901011-0279

• twingoow@gmail.com

• Program: IT

The size of the problem $$n$$, as a function of $$p, k$$ is: $n(p, k) = \floor{\log_2{p}} + \floor{\log_2{k}}$