Find the rule which gives the number of matchsticks required to make the following matchstick patterns. Use a variable to write the rule:
(a) A pattern of letter T as![]()
(b) A pattern of letter Z as![]()
(c) A pattern of letter U as![]()
(d) A pattern of letter V as![]()
(e) A pattern of letter E as![]()
(f) A pattern of letter S as![]()
(g) A pattern of letter A as ![]()
(a) 
From the above figure, it can be observed that the letter T will require 2 matchsticks
Therefore,
The pattern is 2n
(b) 
From the above figure, it can be observed that the letter Z will require 3 matchsticks
Therefore,
The pattern is 3n
(c) 
From the above figure, it can be observed that the letter U will require 3 matchsticks
Therefore,
The pattern is 3n
(d) 
From the above figure, it can be observed that the letter V will require 2 matchsticks
Therefore,
The pattern is 2n
(e) 
From the above figure, it can be observed that the letter E will require 5 matchsticks
Therefore,
The pattern is 5n
(f) 
From the above figure, it can be observed that the letter S will require 5 matchsticks
Therefore,
The pattern is 5n
(g) 
From the above figure, it can be observed that the letter R will require 6 matchsticks
Therefore,
The pattern is 6n