290562 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern ≅, is 2n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290563 Solve: k - 3 = 3

290564 Classify the following polynomial as polynomial in one variable, two variables etc. y\(^{1}\)- 5y

290565 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern [], is 4n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290562 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern ≅, is 2n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290563 Solve: k - 3 = 3

290564 Classify the following polynomial as polynomial in one variable, two variables etc. y\(^{1}\)- 5y

290565 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern [], is 4n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290562 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern ≅, is 2n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290563 Solve: k - 3 = 3

290564 Classify the following polynomial as polynomial in one variable, two variables etc. y\(^{1}\)- 5y

290565 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern [], is 4n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290562 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern ≅, is 2n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.

290563 Solve: k - 3 = 3

290564 Classify the following polynomial as polynomial in one variable, two variables etc. y\(^{1}\)- 5y

290565 Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put forward. Read both the statements carefully and choose the correct alternative from the following:
Assertion (A): The rule, which gives the number of matchsticks required to make the matchstick pattern [], is 4n
Reason (R): n is an example of a variable. Its value is not fixed; it can take any value 1, 2, 3, 4,…. We wrote the rule for the number of matchsticks required using the variable n.