Methodical recommendation:
Theory
| Number | Name | Description |
|---|---|---|
| 1. | Euclid’s Division Lemma | Learn about Euclid's division lemma and Eulcid's division algorithm. |
| 2. | Euclid’s Division Algorithm | Learn about Euclid's division lemma and Eulcid's division algorithm. |
Practice Questions
| Number | Name | Type | Difficulty | Marks | Description |
|---|---|---|---|---|---|
| 1. | Find the quotient and remainder in each case | Other | easy | 2 m. | Work on the problem to find the quotient and remainder. |
| 2. | Evaluate the value of the variable | Other | medium | 2 m. | In this exercise, find the value of the variable using Euclid's division algorithm. |
| 3. | Calculate the HCF | Other | medium | 2 m. | Work on the problem to find the HCF using theorem 3. |
| 4. | Choose the given numbers are co-prime or not | Other | medium | 2 m. | In this exercise, choose the given numbers are co-prime or not using Euclid's division algorithm. |
| 5. | Find the numbers of rows and left over flower pots | Other | medium | 2 m. | Analyse the problem and solve using Euclid's algorithm. |
| 6. | Obtain the greatest number | Other | hard | 5 m. | In this exercise, find the value of 'x' using Euclid's Division Algorithm. |
| 7. | TBQ - Prove the following | Other | hard | 5 m. | Try to solve the problem using the given information and upload your work. |
| 8. | TBQ - Find the HCF | Other | hard | 5 m. | Practice problem to find the HCF using Euclid's division algorithm. |
| 9. | TBQ - Prove the following | Other | hard | 5 m. | Try to solve the problem using the given information and upload your work. |