KEMBAR78
Maths - Real Numbers - Test Supplementary Content | PDF | Numbers | Prime Number
0% found this document useful (0 votes)
36 views85 pages

Maths - Real Numbers - Test Supplementary Content

The document is an educational resource for 10th-grade mathematics, focusing on real numbers and related concepts. It covers topics such as the number system, Euclid's division lemma and algorithm, the fundamental theorem of arithmetic, and properties of rational and irrational numbers. Additionally, it includes various questions and examples to reinforce understanding of HCF, LCM, and factorization.
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
0% found this document useful (0 votes)
36 views85 pages

Maths - Real Numbers - Test Supplementary Content

The document is an educational resource for 10th-grade mathematics, focusing on real numbers and related concepts. It covers topics such as the number system, Euclid's division lemma and algorithm, the fundamental theorem of arithmetic, and properties of rational and irrational numbers. Additionally, it includes various questions and examples to reinforce understanding of HCF, LCM, and factorization.
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
You are on page 1/ 85

AARAMBH TEST

Subject Name - Mathematics

Class – 10th

Chapter Name – Real Numbers

PPT No.- 01/01


PPT CONTENT

Sr. No. TOPICS

1. Introduction
2. Number System
3. Euclid’s Division lemma
4. Euclid’s Division Algorithm
5. Fundamental Theorem of Arithmetic
6. Irrational Numbers
7. Revisiting Rational Numbers
8. Important Concepts Regarding HCF and LCM of numbers
9. Factor Related Concepts
Topic:
Introduction
Number System

A number system defines a set of values used to represent a quantity. It is a system


of writing for numbers. It provides a unique representation to every number and
present the arithmetic and algebraic structure of the figures. It also allows us to
operate arithmetic operations like addition, subtraction multiplication and division.
Topic: Number System
Even Number –

Odd Number –

Prime Number –

Co-prime Number –

Composite Number -
Topic: Number System

#Q. Every rational number is


[CBSE 2011]

a natural number
A

B an integer

C a real number

D a whole number
Topic: Number System

#Q. Every point on a number line represents

a unique real number


A

B a natural number

C a rational number

D an irrational number
Topic: Number System

#Q. Which of the following is a rational number?


[CBSE SP 2011]

D
Topic: Number System

#Q. Which of the following is a composite number?

A 22

B 31

C 23

29
D
Topic: Number System

#Q. Which of the following is a prime number?

A 35

B 33

C 37

39
D
Topic: Number System

#Q. Which of the following is not an odd composite number?

A 21

B 29

C 33

35
D
Topic: Number System

#Q. Which of the following is an odd composite number?

A 45

B 29

C 47

37
D
Topic: Number System

#Q. Which of the following is not even composite number?

A 47

B 52

C 38

46
D
Topic: Number System

#Q. Explain why 7 x 11 x 13 + 13 and 7 x 6 x 5 x 4 x 3 x 2 x 1 + 5 are composite


number.
Topic: Euclid's Division Lemma

Theorem 1:
For two positive integers a and b, there always exist some unique integers q and r
such that a = bq + r, where 0 ≤ r < b.
Here, when a is divided by b, q and r and obtained as quotient and remainder.
Let’s have a look at some examples.
(i) Consider number 27 and 5, then:
27 = 5 × 5 + 2
Comparing this with a = bq + r, we get
a = 27, b = 5, q = 5, r = 2
and 0 ≤ r < b (as 0 ≤ 2 < 5).
In the relation a =bq + r.
0 ≤ r < b is just a statement of long division of number ‘a’ by a number ‘b’ in which ‘q’
is obtained as quotient and ‘r’ is obtained as remainder.
Thus, dividend = divisor × quotient + remainder ⇒ a = bq + r.
Euclid's Division Algorithm

Euclid's Algorithm is a technique to compute highest common factor (HCF) or the


greatest common divisor (GCD).

For obtaining HCF of two positive integers, say m and n, with m > n, follow the steps
given below:

Step-1: Apply Euclid's division lemma to m and n, so that we can find whole
numbers q and r, such that m = n q + r (O < r < n).

Step-2: If r = 0, n is the HCF of m and n. If r # 0, apply the division lemma to n and r.

Step-3: The process is continued till we get the remainder as zero. The divisor we
get at this stage will be the required HCF.
Topic: Euclid's Division Lemma

#Q. When a positive integer p is divided by 3, the values of the remainder r are

A 0, 1, 2

B 0, 1, 4

C 0, 1, 2, 3

D 0, 1, 3, 4
Topic: Euclid's Division Lemma

[NCERT EXEMPLAR]
A

D
Topic: Euclid's Division Lemma

[NCERT EXEMPLAR]
A

D
Topic: Euclid's Division Lemma

[NCERT EXEMPLAR]

D
Topic: Euclid's Division Lemma

#Q. Find the value of n, if the HCF of 65 and 117 is expressed as 65 n – 117.

A 4

B 3

C 6

D 2
Topic: Euclid's Division Lemma

#Q. How will you prove that every odd integer is of the form 2q + 1, where
q is an integer.
Topic: Euclid's Division Lemma

#Q. Prove that the square of any positive integer cannot be of the form 5q + 2
or 5q + 3 for any integer q.
Topic: Euclid's Division Lemma

#Q. Show that any positive odd integer is of the form


6q + 1, or 6q + 3, or 6q + 5, where q is some integer.
Topic: Euclid's Division Lemma

#Q. Find the HCF of 420, 130 and 600, by using Euclid’s division algorithm.
Topic: Euclid's Division Lemma

#Q. Use Euclid’s division algorithm to find the HCF of:


135 and 225
Topic: Euclid's Division Lemma

#Q. Use Euclid’s division algorithm to find the HCF of:


196 and 38220
Topic: Fundamental Theorem of Arithmetic

Every integer greater than 1 is either prime or can be represented by a unique prime
factorization.

Prime Numbers Composite Numbers


2 4 = 22
3 9 = 32
5 25 = 52
7
11
Theorem: every composite number can be written (factorised) as the product of
primes and this factorisation is unique, apart from the order in which the prime
factors occur
H.C.F. (Highest common factor)
The H.C.F. of two or more numbers is the largest positive integer that divides each of the
integers.
L.C.M. (Least common Multiple)
The L.C.M. of two or more numbers is the smallest positive integer which is exactly divisible
by each one of the given numbers.
To find HCF and LCM of given numbers using Prime Factorisation Method or Fundamental
Theorem of Arithmetic, firs express each number in the form of product of prime factors,
then
HCF = Product of the smallest powers of common factors.
LCM = Product of the greatest power of each prime factor involved in the numbers.
Topic: Fundamental Theorem of Arithmetic

#Q. Which of the given statements is true?


[NSTSE2013]

D
Topic: Fundamental Theorem of Arithmetic

#Q. Which of the following is NOT a composite number?


[NSTSE2013]

D
Topic: Fundamental Theorem of Arithmetic

#Q. For some integer q, every odd integer is of the form

[NCERT EXEMPLAR]
A

D
Topic: Fundamental Theorem of Arithmetic

[NSTSE2009]

3
A

B 48

C 51

D 2009
Topic: Irrational numbers
Theorem 3:

Let a be a prime number. If a divides p2, then ‘a’ divides p, where p is a positive
integer.
Properties of irrational
numbers
An irrational number is always a real number.
An irrational number cannot be expressed as a fraction.
An irrational number is non-repeating and non-terminating as the decimal part never
ends and never repeats itself.
The value of the square root of any prime number is an irrational number.
The sum of a rational number and an irrational number is irrational. The product of a
rational number and an irrational number is irrational. This means that any operation
between a rational and an irrational number, be it addition, subtraction, multiplication or
division will always result in an irrational number only.
If r is one irrational number and s is another irrational number, then r + s and r – s may or
may not be irrational numbers and rs and r/s are may or may not be irrational numbers.
This means that any operation between two irrational numbers, be it addition,
subtraction, multiplication or divisions will not always result in an irrational number.
If a and b are two distinct positive irrational numbers, then ab−−√
is an irrational number lying between a and b.
For any two irrational numbers, their least common multiple (LCM) may or may not exist.
Irrational number is simplifications of Surds. When we can’t simplify a number to remove
a square root or cube root etc. then it is a surd. For example, 2–√
(square root of 2) can’t be simplified further so it is a surd.
Topic: Irrational numbers

#Q. An irrational number is:


[NSTSE2009]

a terminating and non-repeating decimal


A

B a non-terminating and non repeating decimal

C a terminating and repeating decimal

D a non-terminating and repeating decimal


Topic: Irrational numbers

#Q. The product of a non-zero rational and an irrational number is


[NCERT EXEMPLAR]

always irrational
A

B always rational

C rational or irrational

D one
Topic: Irrational numbers
Topic: Revisiting Rational Numbers
Topic: Revisiting Rational Numbers
Topic: Revisiting Rational Numbers

#Q. Which of the following rational numbers have a terminating decimal


expansion? [NSTSE2013]

D
Topic: Revisiting Rational Numbers

#Q. Which of the following will have a terminating decimal expansion?


[NSTSE2012]

D
Topic: Revisiting Rational Numbers

[NSTSE2012]

D
Topic: Revisiting Rational Numbers

[NCERT EXEMPLAR]

one decimal place


A

B two decimal places

C three decimal places

D four decimal places


Topic: Revisiting Rational Numbers

[NSTSE2022]

4,3
A

B 4,5

C 4,4

D 3,4
Topic: Important Concepts Regarding HCF and LCM
of Numbers
To find the largest number which will divide a, b and c leaving remainders x, y and
z respectively.
Required number = H.C.F. of (a - x), (b - x) and (c - z).

Ex: Find the largest number which will divide 148, 246 and 623 leaving remainders
4. 6 and 11 respectively.
To find the smallest number which will divide by a, b and c leave the remainders x,
y and z respectively.

∴ Required number (a - x) = (b – y) = (c - z) = k(say).

Ex: Find the smallest number which will divided 12, 15 and 21 leave the remainders
7, 10 and 16 respectively.
To find the smallest number which will divide by a, b and c leave the remainders r
in each case.
Required number = (L.C.M of a, b and c) + r.

Ex: Find the smallest number which will divided 16, 20 and 24 leave the remainders
5, in each case
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. The least number, which when divided by 12, 15, 20 or 54 leaves a
remainder of 8 in each case, is:

A 450

B 454

C 548

D 544
Topic: Important Concepts Regarding HCF and LCM
of Numbers

[NCERT EXEMPLAR]

ab
A

B a2b2

C a3b2

D a3b3
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. The least number that is divisible by all the numbers from 1 to 10
(both inclusive) is [NCERT EXEMPLAR]

10
A

B 100

C 504

D 2520
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. The largest number which divides 70 and 125 , leaving remainders 5 and 8 ,
respectively, is [NCERT EXEMPLAR]

D
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. Find the greatest number of five digits which when divided by 3, 5, 8, 12
have 2 leaves a remainder.

A 99999

B 99958

C 99960

D 99962
Topic: Important Concepts Regarding HCF and LCM
of Numbers

[NCERT EXEMPLAR]

D
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. The least number which when divided by 16, 18, 20 and 25 leaves 4 as a
remainder in each case but when divided by 7 leaves no remainder is:

A 17004

B 18000

C 18002

D 18004
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. What is the least number must be subtracted from 1936 so that the
resulting number when divided by 9,10 and 15 will leave in each case the
remainder 7 ? [NSTSE 2022]
37
A

B 36

C 39

D 30
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. To find the largest number which will divide a, b and c leaving the
same remainder in each case.

(a) When the value of remainder is not given:

Required number = H.C.F. of | (b - c) and | (c - a) |

(b) When the value of remainder is given:

Required number = H.C.F. of (a - r), (b - r) and (c - r).


Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. Let N be the greatest number that will divided 1305, 4665 and 6905 leaving
the same remainder in each case. Then, the sum of the digits in N is:

A 4

B 5

C 6

D 8
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. Find the largest number which on dividing 34, 90 and 104 leaves the
same remainder in each case.
Topic: Important Concepts Regarding HCF and LCM
of Numbers
#Q. Find the largest number which will divide 155 and 192 and leaves the
remainder 7 in each case.
Topic: Factor Related Concepts

Number of Factors of a Given Number

Let N be a composite number, and its prime factors be a, b, c, d, ……. etc. and k, I, m,
n…etc. be the powers of a, b, c, d….. etc. respectively i.e., N can be expressed as
N = ak. b1. cm . dn …
then, the number of total factors or divisors of N is (k + 1) (1 + 1) (m + 1) (n + 1) …..

Ex. Find the total number of factors of 1080:

Sol. 1080 = 2 × 2 × 2 × 3 × 3 × 3 × 5
540 = 23 × 33 × 51

Therefore total number of factors of 1080 is (3 + 1) (3 + 1) (1 + 1) = 32


Sum of Factors of a Given Number

Let N be a composite number, and its prime factors be a, b, c, d, ……. etc. and k, I, m,
n…etc. be the powers of a, b, c, d….. etc. respectively i.e., N can be expressed as
N = ak. b1. cm . dn …

then, the sum of all factors or divisors of

Ex: Find the sum of the factors of 180.

Sol. 180 = 23 × 33 × 5

∴ Sum of the factors of


Product of Factors
Number of Odd Factors of a Given Number
Number of Even Factors of a Composite Number
Topic: Factor Related Concepts

#Q. What is the sum of all the factors of 56?

A 64

B 120

C 63

D 60
Topic: Factor Related Concepts

#Q. Find the sum of the factors of 3240

A 10890

B 11000

C 10800

D 10190
Topic: Factor Related Concepts

#Q. If a number is in the form of 810 × 97 × 78, find the total number of prime
factors o the given number.

A 52

B 560

C 3360

D 25
Topic: Factor Related Concepts

#Q. Find the number of even factors and that of odd factors of the number 1800
and also find the difference between the sum of even factors and the sum of
odd factors.

A 27, 9, 5229

B 9, 27, 5239

C 27, 9, 5239

D 27, 9, 6045
Topic: Factor Related Concepts

#Q. For the number 7200, find sum and no. of even factors sum and number of
odd factors sum and number of factors divisible by 24
Topic: Homework

#Q. Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5,


where q is some integer.

#Q. Use Euclid’s division lemma to show that the square of any positive integer
is either of the form 3m or 3m + 1 for some integer m.

#Q. Use Euclid’s division lemma to show that the cube of any positive integer is
of the form 9m, 9m + 1 or 9m + 8.

#Q. Find total number of factors of 1080.


Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]

[NCERT EXEMPLAR]
Topic: Homework

[NCERT]

[NCERT]
Topic: Homework

[NCERT]

You might also like