Scribd
Upload
4 views3 pages

Class 10 Math Notes PDF Downloads

Chapter 1 covers fundamental concepts of real numbers, including Euclid's Division Lemma and Algorithm for finding the HCF of integers. It also discusses the Fundamental Theorem of Arithmetic, stating that every composite number can be uniquely factored into primes. Additionally, the chapter includes various problems and proofs related to divisibility and properties of integers.

Uploaded by

Shivang Agarwal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views3 pages

Class 10 Math Notes PDF Downloads

Chapter 1 covers fundamental concepts of real numbers, including Euclid's Division Lemma and Algorithm for finding the HCF of integers. It also discusses the Fundamental Theorem of Arithmetic, stating that every composite number can be uniquely factored into primes. Additionally, the chapter includes various problems and proofs related to divisibility and properties of integers.

Uploaded by

Shivang Agarwal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Chapter 1 Real numbers

1. Euclid’s Division lemma:- Given Positive integers a and b there exist unique integers q and r
satisfying
a=bq +r, where 0 where a, b, q and r are respectively called as dividend, divisor, quotient
and remainder.
2. Euclid’s division Algorithm:- To obtain the HCF of two positive integers say c and d, with
c>0, follow the steps below:
Step I: Apply Euclid’s division lemma, to c and d, so we find whole numbers, q and r such that c
=dq+r, 0
Step II: If r=0, d is the HCF of c and d. If r
Step III: Continue the process till the remainder is zero. The divisor at this stage will be the

s
required HC
3. The Fundamental theorem of Arithmetic:-

se
Every composite number can be expressed ( factorised ) as a product of primes, and this
factorization is unique, apart from the order in which the prime factors occur.
Ex.:

57 las
Theorem: LET be a rational number whose decimal expansion terminates. Then can be
expressed in the form

50 C
1. If the H C F of 657 and 963 is expressible in the form of 657x + 963x - 15 find [Link]
(Ans:x=22)
16 on
39 uiti
84 T
al

2. Express the GCD of 48 and 18 as a linear combination. (Ans: Not unique)


w
ar
Ag

|
Hence, x and y are not unique.
3. Prove that one of every three consecutive integers is divisible by 3.
Ans:
n,n+1,n+2 be three consecutive positive integers
We know that n is of the form 3q, 3q +1, 3q + 2
So we have the following cases Properties

s
se
57 las
4. Find the largest possible positive integer that will divide 398, 436, and 542 leaving remainder 7,
11, 15 respectively.

50 C
(Ans: 17)
16 on
39 uiti

5. Find the least number that is divisible by all numbers between 1 and 10 (both inclusive).
84 T

6. Show that 571 is a prime number.


al
w

7. If d is the HCF of 30, 72, find the value of x & y satisfying d = 30x + 72y.
ar
Ag

Hence, x and y are not unique


8. Show that the product of 3 consecutive positive integers is divisible by 6.
Ans: Proceed as in question sum no. 3
9. Show that for odd positive integer to be a perfect square, it should be of the form
11. If a and b are positive integers. Show that always lies between

s
se
57 las
50 C
16 on
39 uiti
84 T
al
w
ar

12. Prove that is irrational, for every n N Symbol chart


Ag

You might also like