A rectangular area, measuring 2148 by 1272 , has to be filled with square tiles, of same size, to cover the whole rectangular area. What is the smallest possible number of square tiles needed and the largest possible area of the square tiles used to cover the rectangular area?
Give your answer as the smallest possible number of square tiles needed + the value of the largest possible area of the square tiles used, in , to cover the given rectangular area.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Find the prime factorization of 2 1 4 8 and 1 2 7 2 : 2 1 4 8 1 2 7 2 = 2 2 × 3 × 1 7 9 = 2 3 × 3 × 5 3 Thus, the greatest common divisor of the two dimensions is 2 2 × 3 = 1 2 . This is the greatest possible side length of a square, assuming a whole number of tiles fit along each side. So there are 1 2 2 1 4 8 × 1 2 1 2 7 2 = 1 7 9 × 1 0 6 = 1 8 9 7 4 total tiles, each with an area of 1 2 × 1 2 = 1 4 4 . The answer is 1 8 9 7 4 + 1 4 4 = 1 9 1 1 8 .