Follow
Newest Numberphile video features Tom Crawford breaking down an approach to an ex-Oxford Admissions Question: given the task of completely filling up a square with N non-overlapping rectangles of any size (not necessarily all uniform), as long as each rectangle has one side twice the length of the other, for which values of N is this task possible?
