The least number of square tiles required to pave the floor of a room 15 m 91 cm and 9 m 46 cm broad is
To solve the problem of finding the least number of square tiles required to pave the floor of the room, we need to find the greatest square tile size that perfectly covers the given dimensions of the room with minimal wastage.
The dimensions of the room are given as 15 m 91 cm length and 9 m 46 cm breadth. Let's first convert these dimensions into centimeters:
1 meter = 100 centimeters, so:
To find the largest square tile that can be used, we need to calculate the Greatest Common Divisor (GCD) of 1591 and 946.
Using the Euclidean algorithm for GCD:
Therefore, the GCD of 1591 and 946 is 43 cm. This means the largest possible square tile that will fit perfectly is a 43 cm × 43 cm tile.
Next, we calculate the number of such tiles needed:
Total number of tiles = \(37 \times 22 = 814\)
Thus, the least number of square tiles required to cover the floor is 814.