## CBSE Class 10 Maths Chapter 1 Revision Notes Real Numbers

CBSE Revision Notes Class 10 Maths Chapter 1 are provided to help the students understand and revise the concepts right from the beginning. The concepts taught in Class 10 are important to be understood as these concepts are the stepping stones for the upcoming syllabus. To score good marks in the Class 10 mathematics examination, it is advised to solve questions provided in the Revision Notes Class 10 Maths Chapter 1. These revision notes for Class 10 Maths help the students to revise all the concepts in a better way. CBSE Class 10 Maths Chapter 1 Revision Notes Real Numbers

**Swiflearn** provides Revision Notes and keynotes chapter wise for the CBSE board exam in an easy-to-understand, free downloadable PDF format so students can use it for their studies and score better in their board exams. The CBSE Class 10 Revision Notes are made for the main subjects of Science and Maths. These core subjects are very critical as they are the stepping stones and plays a crucial role in student’s future. They might be tricky for students. The CBSE Class 10 Revision Notes for each chapter will enable them to have an expert studying pattern with which they can enjoy learning the subject and perform better in the exams.

CBSE Class 10 Maths Revision Notes are designed keeping in my mind the exam pattern and syllabus of NCERT 2020-21. Students can download the PDF for free and practice the questions to score well in the coming exams.

## CBSE Class 10 Maths Chapter 1 Revision Notes Real Numbers

**What is Euclid’s division lemma?**

To find the HCF of two numbers, we generally write them as a product of their prime factors. Then the product of all the common factors is the HCF. However, it may not be easy to apply the prime factorization method if the numbers are large. In such cases, we use the Euclid’s division lemma.

**Euclid’s division lemma:**

Given a dividend and a divisor, there will be a unique pair of quotient and remainder, satisfying the equation

Dividend = Divisor x Quotient + Remainder

This is true for any two positive integers and is referred to as Euclid’s Division Lemma. It states that:

Given positive integers m and n, there exist two unique integers q and r, satisfying m = nq + r, where 0 ≤ r < n.

This lemma is useful to find the HCF of large numbers when breaking them into factors is difficult.