MathDB
rectangle is divided into n^2 smaller by n - 1 horizontal and n-1 vertical

Source: Rioplatense Olympiad 2012 level 3 P2

September 4, 2018
combinatorial geometrycombinatoricsrectangleminimum

Problem Statement

A rectangle is divided into n2n^2 smaller rectangle by n−1n - 1 horizontal lines and n−1n - 1 vertical lines. Between those rectangles there are exactly 56605660 which are not congruent. For what minimum value of nn is this possible?
Back to ProblemsView on AoPS