l
33. A rectangular courtyard is 18 m 72 cm long and 13 m 20 cm broad. It is to be paved with
square tiles of the same size. Find the least possible number of such tiles.
Answers
Question :
A rectangular courtyard is 18 m 72 cm long and 13 m 20 cm broad. It is to be paved with square tiles of the same size. Find the least possible number of such tiles.
Answer :
The least possible number of tiles required to pave the rectangular courtyard is .
==================
Given :
- Length of rectangular courtyard = 18m 72cm
- Breadth of rectangular courtyard = 13m 20cm
- Tiles used for paving the courtyard is squared shape
To find :
- The least possible number of tiles required to pave the rectangular courtyard.
Concept
In order to solve this question we will proceed by calculating the area of the rectangular courtyard. Then by using the concept of HCF in the given length and breadth of the courtyard we will get the size of the side of a square tile. Then after calculating the area of the square tile we will acquire the least number of tiles required to pave the rectangular courtyard.
Formulas to be used :
➷ Area of rectangular courtyard =
where : l stands for length and b for breadth.
➷ Area of square tiles =
where : s stands for side.
➷ Number of tiles =
Hope am clear let's solve :D~
Solution :
Calculating the area of the rectangular courtyard -
Length of the courtyard = 18m 72cm = 1872cm
Breadth of the courtyard = 13m 20cm = 1320cm
⠀⠀⠀ ⠀⠀
Therefore ,
Area of the courtyard =
Area of the courtyard =
Now we know the size of the side of the square tile is equal to the HCF of the length and breadth of the rectangular courtyard.
Henceforth ,
Prime factorisation of 1872 =
Prime factorisation of 1320 =
HCF of 1872 and 1320 = =
Hence we got the length of the square tile to be as 24cm . Now calculating the area of the square tile :
Area of the square tile =
Area of the square tile =
Finally,
=
Substituting the values we got
=
Reducing the fraction to the lower terms
=
=
=
=
______________________
Note :- HCF also known as Greatest Common Divisor ( GCD ) is the largest number which could divide the given number .
- In this particular question I have calculated HCF by prime factorisation method.