L 3
L 3
http://tinyurl.com/jeeadvmath
Telegram Channel
https://t.me/pjsir42
Personal Guidance
Get one on one
guidance from top
exam experts Personal Study
Guidance Planner
Study Planner
Customized study
plan with bi- Live Weekly
weekly reviews
Classes Tests
Test Analysis
Get one on one
ICONIC PLUS
guidance from
top exam experts Structured Unlimited
Courses Access
Study Material
Specialised Notes & Test Study
Practice Sets Analysis Material
12
Months
18
Months
24
Months
54% OFF 62% OFF 67% OFF
12
Months
18
Months
24
Months
14% OFF 30% OFF 34% OFF
ICONIC ICONIC
12
Months
24
Months
20% OFF
₹6,278 ₹4,995
per month per month
Proceed Proceed
PJLIVE to Pay PJLIVE to Pay
PLUS PLUS
12
Months
24
Months
24% OFF
₹3,611 ₹2,734
per month per month
Proceed Proceed
PJLIVE to Pay PJLIVE to Pay
₹43,335 ₹65,610
for 12 Months for 24 Months
COMBO COMBO
CBSE 11 + 12 + IIT JEE CBSE 11 + 12 + IIT JEE
12
Months
24
Months
22% OFF
₹5,400 ₹4,219
per month per month
Proceed Proceed
PJLIVE to Pay PJLIVE to Pay
₹64,800 ₹101,250
for 12 Months for 24 Months
Number System
Number System
INTEGERS: All counting numbers and their negatives including zero are
known as integers. The set of integers can be represented by
Z or I = {..... –4, –3, –2, –1, 0, 1, 2, 3, 4, .....}
POSITIVE INTEGERS: The set I+ = {1, 2, 3, 4, ....} is the set of all positive
integers. Positive integers and natural numbers are synonyms.
NEGATIVE INTEGERS: The set I– = {–1, –2, –3, .....} is the set of all negative
integers.
NON-NEGATIVE INTEGERS: The set {0, 1, 2, 3, ......} is the set of all non-
negative integers.
NON-POSITIVE INTEGERS: The set {......., –3, –2, –1, 0} is the set of all non-
positive integers.
Number System
COMPOSITE NUMBERS: All natural numbers, which are not prime are
composite numbers. If C is the set of composite number then
C = {4, 6, 8, 9, 10, 12 .....}
Prime Numbers
Test to find whether a given number is a prime
Eg: Investigate whether 571 is a prime number.
Number System
EVEN NUMBERS: All those numbers which are exactly divisible by 2 are
called even numbers,
E.g. 2, 6, 8, 10 etc.
ODD NUMBERS:All those numbers which are not exactly divisible by 2 are
called odd numbers,
E.g. 1, 3, 5, 7 etc.
Number System
CO-PRIME NUMBERS: If the H.C.F. of the given numbers (not necessarily
prime) is 1 then they are known as co-prime numbers.
E.g. 4, 9 are co-prime as H.C.F. of (4, 9) = 1.
E.g. 3, 5 are co-prime as H.C.F. of (3, 5) = 1.
E.g. 4, 5 are co-prime as H.C.F. of (4, 5) = 1.
TWIN PRIME NUMBERS: Prime numbers differing by two are called twin
primes.
E.g. (3, 5), (5, 7), (11, 13) etc.
Prove that any positive odd integer can be written in the form 4q + 1 or
4q + 3 where q is an integer.
Example
Prove that the square of any positive integer of the form 5q + 1 is of the
same form.
Example
Use Euclid’s Division Lemma to show that the cube of any positive integer
is of the form 9 m, 9 m + 1 or 9 m + 8, for some integer m.
Example
Show that the square of any positive integer cannot be of the form 5q + 2
or 5q + 3 for any integer q.
Example
Prove that if x and y are both odd positive integers, then x2 + y2 is even but
not divisible by 4.
Euclid’s Division Algorithm
Euclid’s Division Algorithm
If ‘a’ and ‘b’ are positive integers such that a = bq + r, then every common
divisor of ‘a’ and ‘b’ is a common divisor of ‘b’ and ‘r’, and vice-versa.
Example
Use Euclid's division algorithm to find the HCF of 441, 567, 693.
Example
If d is the HCF of 30 and 72, find the values of x and y satisfying d = 30x +
72y. Also, show that x and y are not unique.
Example
Use Euclid’s division algorithm to find the H.C.F. of 196 and 38318.
Example
Use Euclid’s division algorithm to find the HCF of (i) 56 and 814 (ii) 6265
and 76254
Example
If the H.C.F of 657 and 963 is expressible in the form 657x + 963 × (– 15),
find x.
Example
If d is the HCF of 468 and 222, find x, y satisfying d = 468x + 222y. Also,
show that x and y are not unique.
Example
144 cartons of coke cans and 90 cartons of pepsi cans are to be stacked in
a canteen. If each stack is of same height and is to contain cartons of the
same drink, what would be the greatest number of cartons each stack
would have?
Fundamental Theorem of Arithmetic
(a) Fundamental Theorem of Arithmetic
Every composite number can be expressed as a product of primes,
and this factorisation is unique, except for the order in which the
prime factors occurs.
The numbers 525 and 3000 are both divisible only by 3, 5, 15, 25 and 75.
What is HCF (525, 3000)? Justify your answer.
Example
Find the LCM and HCF of 1296 and 2520 by applying the fundamental
theorem of arithmetic method i.e. using the prime factorisation method.
Example
Find the largest number that divides 1251, 9377 and 15628 leaving
remainders 1, 2 and 3, respectively.
Example
Check whether 6n can end with the digit 0 for any natural number.
Example
Find the LCM and HCF of 84, 90 and 120 by applying the prime
factorisation method.
Example
In a morning walk three persons step off together, their steps measure 80
cm, 85 cm and 90 cm respectively.
What is the minimum distance each should walk so that they can cover the
distance in complete steps?
Example
Find the greatest number of six digits exactly divisible by 15, 24 and 36.
Proof of Irrationality and Decimal Representation
Irrational Number :
An irrational number is a real number that cannot be expressed as the
ratio of two integer.
Eg. - etc.
Decimal representation of irrational number is non terminating and non-
repeating.
Proof of Irrationality and Decimal Representation
(a) Some important results
(i) Let ‘p’ be a prime number and ‘a’ be a positive integer. If ‘p’ divides
a2, then ‘p’ divides ‘a’.
(ii) Let x be a rational number whose decimal expansion terminates.
𝒑
Then, x can be expressed in the form , where p and q are co-primes,
𝒒
and prime factorization of q is of the form 2m × 5n, where m, n are
non-negative integers.
Proof of Irrationality and Decimal Representation
𝒑
(iii) Let x = 𝒒 be a rational number, such that the prime factorisation of q is
not of the form 2m × 5n, where m, n are non-negative integers.
Then, x has a decimal expansion which is non -terminating repeating.
In earlier classes you have studied different types of numbers such as
natural numbers, whole numbers, integers, rational and irrational
numbers. All these together are called Real numbers. In this chapter,
we shall study some properties of numbers, especially valid for
integers
𝟏𝟖𝟗 𝟏𝟖𝟗 𝟏𝟖𝟗
E.g. (i) 𝟏𝟐𝟓 𝟓𝟑 𝟐𝟎 ×𝟓𝟑
we observe that the prime factorisation of the denominator of this
rational number is of the form 2m × 5n, where m, n are non-negative
𝟏𝟖𝟗
integers. Hence, 𝟏𝟐𝟓 has terminating decimal expansion.
Proof of Irrationality and Decimal Representation
𝟏𝟕 𝟏𝟕
(ii) 𝟔 𝟐×𝟑
we observe that the prime factorisation of the denominator of this
rational number is not of the form 2m × 5n, where m. n are non-negative
𝟏𝟕
integers. Hence has non-terminating and repeating decimal expansion.
𝟔
𝟏𝟕 𝟏𝟕
(iii) 𝟖 𝟐𝟑 ×𝟓𝟎
𝟏𝟕
So, the denominator 8 of is of the form 2m × 5n, where m, n are non-
𝟖
negative integers.
𝟏𝟕
Hence 𝟖 has terminating decimal expansion.
𝟔𝟒 𝟔𝟒
(iv) 𝟒𝟓𝟓 𝟓×𝟕×𝟏𝟑
𝟔𝟒
Clearly, 455 is not of the form 2m × 5n. So, the decimal expansion of
𝟒𝟓𝟓
is non-terminating repeating.
Example
What can you say about the prime factorization of the denominators of
the following rationals :
(i) 43.123456789 (ii)
Surds and Their Application
(a) Surds
An irrational number of the form is given a special name Surd, where
‘a’ is called radicand and it should always be a rational number. Also the
symbol is called the radical sign and the index n is called order of the
surd. is read as ‘nth root of a’ and can also be written as .
Surds and Their Application
(b) Law of Surds
(i) (ii)
(iii) (iv)
× ×
(v) or ×
Surds and Their Application
(c) Operation on Surds
(i) Addition and Subtraction of Surds :
Addition and subtraction of surds are possible only when order and
radicand are same i.e. only for like surds. The addition of surds follow
the following rules. Summation of same degree surds is distributive.
Simplify :
Example
Simplify :
Example
Simplify :
Example
Divide :
Example
Which is greater :
𝟑 𝟏 𝟑 𝟏
(i) and (ii) and
𝟐 𝟑
Example
Simplify :
(𝟐𝟓)𝟑/𝟐 ×(𝟐𝟒𝟑)𝟑/𝟓 𝟏𝟔×𝟐𝒏 𝟏 𝟒×𝟐𝒏
(i) (ii)
(𝟏𝟔)𝟓/𝟒 ×(𝟖)𝟒/𝟑 𝟏𝟔×𝟐𝒏 𝟐 𝟐×𝟐𝒏 𝟐
Example
/ /
Simplify
Example
𝒙 𝟏 𝒙 𝟏 𝟐𝒚𝟐
Prove that :
𝒙 𝟏 𝒚 𝟏 𝒙 𝟏 𝒚 𝟏 𝒚𝟐 𝒙𝟐
Example
For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
PJLIVE
Have doubts after the class? Get solutions
to your doubts instantly with Unacademy
‘Ask-a-doubt’ feature. Any time, any where.
DON’TS
• Do not post multiple doubts in a single image
• Do not handwritten questions, blurred images or
incomplete questions
FOLLOW ME ON
@prashant42jain
For Unacademy Subscription
use PJLIVE