UPSC Prelims 2026 CSAT Q68 · Numeracy
There are three types of rectangular tiles: 3' × 3', 3' × 7' and 3' × 11'. An area of rectangular shape of dimensions 3' × 100' is to be covered using these tiles without breaking them. If x and y are the maximum and minimum numbers of tiles of various sizes, respectively, that can be used to cover the area exactly, then x − y is
- a20
- b12
- c10
- d7
Show answer & explanationHide answer
The maximum number of tiles (x) is 32 and the minimum number of tiles (y) is 12, leading to x - y = 20.
Statement-by-statement analysis
- The total area to be covered is 3' × 100'. Since all tiles have a width of 3', we only need to cover a length of 100' using tiles of lengths 3', 7', and 11'.
- Let 'a' be the number of 3' tiles, 'b' be the number of 7' tiles, and 'c' be the number of 11' tiles. The constraint is 3a + 7b + 11c = 100.
- To find the maximum number of tiles (x), we should use as many of the smallest tiles (3') as possible. If we use 33 tiles of 3', the length covered is 99', leaving 1' which cannot be covered by 7' or 11' tiles. So, 33 tiles is not possible.
- Consider using 31 tiles of 3' (3a = 93'). This leaves 100 - 93 = 7' to be covered. We can use one 7' tile (b=1). So, a=31, b=1, c=0. Total tiles = 31 + 1 + 0 = 32. This is the maximum number of tiles (x = 32).
- To find the minimum number of tiles (y), we should use as many of the largest tiles (11') as possible. If we use 9 tiles of 11', the length covered is 99', leaving 1' which cannot be covered by 3' or 7' tiles. So, 9 tiles of 11' is not possible.
- Consider using 8 tiles of 11' (11c = 88'). This leaves 100 - 88 = 12' to be covered. We can use four 3' tiles (3a = 12'). So, a=4, b=0, c=8. Total tiles = 4 + 0 + 8 = 12.
- Alternatively, consider using 7 tiles of 11' (11c = 77'). This leaves 100 - 77 = 23' to be covered. We can use two 7' tiles (7b = 14') and three 3' tiles (3a = 9'). So, a=3, b=2, c=7. Total tiles = 3 + 2 + 7 = 12.
- Many combinations yield 12 tiles (e.g., c=4, b=8, a=0; c=5, b=6, a=1; c=6, b=4, a=2). The minimum number of tiles (y) is 12.
- Therefore, x - y = 32 - 12 = 20.
- This option suggests x - y = 12. However, our calculations show x = 32 and y = 12, so x - y = 20.
- This option suggests x - y = 10. However, our calculations show x = 32 and y = 12, so x - y = 20.
- This option suggests x - y = 7. However, our calculations show x = 32 and y = 12, so x - y = 20.
Concept to know
- This problem involves solving a linear Diophantine equation of the form Ax + By + Cz = D, where A, B, C, D are constants and x, y, z are non-negative integers representing counts.
- To find the maximum number of items (tiles in this case), prioritize using the smallest available item size as much as possible, then adjust with larger items to meet the exact total.
- To find the minimum number of items (tiles), prioritize using the largest available item size as much as possible, then adjust with smaller items to meet the exact total.
- A systematic trial-and-error approach, starting from the maximum possible count for the preferred tile size and working downwards, is effective.
- Always check for divisibility and remainders at each step to ensure the remaining length can be covered by the other available tile sizes.
- The problem requires finding integer solutions for the number of tiles, as tiles cannot be broken.
Related facts for revision
- Similar problems often involve making change with coins of different denominations (e.g., minimum/maximum number of coins to make a certain amount).
- Questions involving partitioning a total quantity into parts using given unit sizes, often with constraints on the number of parts.
- Optimization problems where a sum needs to be achieved using a combination of items, and the goal is to maximize or minimize the count of items.
- Problems that test number sense and the ability to work with remainders and divisibility rules.
- Variations might include additional constraints, such as a maximum number of a specific tile type or a minimum number of another.
UPSC tests your problem-solving skills, number sense, and ability to apply a systematic approach to optimization problems involving integer solutions. It also assesses your patience in exploring various combinations.
Trap: A common trap is to stop searching for the minimum/maximum once a valid combination is found, without ensuring it is indeed the absolute minimum or maximum. For minimum tiles, candidates might not explore enough combinations of larger tiles, or for maximum tiles, they might incorrectly assume a simple division will work. Always verify the edge cases and systematically check combinations.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.