Natural Numbers Counting numbers ,.....are known as natural numbers. The set of all natural numbers can be represented by : .
Whole Numbers If we include 0 among the natural numbers, then the numbers . are called whole numbers. The set of whole numbers can be represented by : . Clearly, every natural number is a whole number but 0 is also a whole number which is not a natural number.
Integers All counting numbers and their negatives including zero are known as integers. The set of integers can be represented by: Z or .
Positive integers The set . natural numbers are synonyms.
Negative integers The set is the set of all negative integers.
Rational numbers The numbers of the form , where and are integers and , are known as rational numbers, e.g. , etc. The set of all rational numbers is denoted by Q . i.e.
Since every natural number 'a' can be written as , so ' ' is a rational number. Since 0 can be written as and every non-zero integer 'a' can be written as , so 0 and every non zero integer is also a rational number. Every rational number has a peculiar characteristic that when expressed in decimal form is expressible either in terminating decimals or non-terminating repeating decimals.
For example : . , etc. The recurring decimals have been given a short notation as 4.1555
Irrational numbers
Those numbers which when expressed in decimal form are neither terminating nor repeating decimals are known as irrational numbers, e.g. etc.
Real numbers
The rational and irrational numbers combined together are called real numbers, e.g. , etc. are real numbers. The set of real numbers is denoted by .
Euclid's division lemma states that "For any two positive integers a and b, there exist unique integers and such that ." e.g. (i) Consider number 23 and 5, then : Comparing with we get, and (as ) (ii) Consider positive integers 18 and 4 For and we have and
In the relation , where is nothing but a statement of the long division of number a by b in which q is the quotient obtained and r is the remainder. e.g. Long division of 25 by 7 . So, Here, quotient , remainder
Building Concepts 1 Prove that every odd integer is of the form , where is an integer. Explanation Let a be any positive integer. By using Euclid division lemma with a and we have , where q is integer and Since For (even integer) and for Now, we know that an integer is either even or odd and is not an even integer is an odd integer.
Building Concepts 2 "The product of two consecutive positive integers is divisible by 2". Is this statement true or false? Give reasons. Explanation: True, because will always be even, as one of the factors is odd and other is even.
Building Concepts 3 A positive integer is of the form being a natural number. Can you write its square in any form other than , i.e., or for some integer ? Justify your answer. Explanation No, because {where
Building Concepts 4 Show that the square of any positive integer cannot be of the form or for any integer . Explanation: We know that any positive integer can be of the form , or for some integer . Thus, we have: Case (i) : is an integer. Case (ii) : , q is an integer. Case (iii) : , q is an integer. Case (iv) : is an integer. Case (v) : , is an integer. Thus, the square of a positive integer cannot be of the form or for any integer .
Building Concepts 5 Prove that if and are both odd positive integers, then is even but not divisible by 4. Explanation Let and for some integers m and n . is even and leaves remainder 2 on dividing by 4 is not divisible by 4 .
If 'a' & 'b' are positive integers such that , then, every common divisor of 'a' & 'b' is a common divisor of ' b ' & ' r ' and vice-versa.
In mathematics, the Euclid's Algorithm is an efficient method for computing the greatest common divisor (GCD) or highest common factor (HCF). So, let us state Euclid's division algorithm clearly. To obtain the HCF of two positive integers, say cand d, with follow the steps below:
Step-1: Apply Euclid's division lemma, to c and d . So, we find whole numbers, q and r such that .
Step-2: If is the HCF of and . If , apply the division lemma to and . Step-3: Continue the process till the remainder is zero. The divisor at this stage will be the required HCF. This algorithm works because HCF ( ) = HCF ( ) where the symbol HCF (c, d) denotes the HCF of c and d .
Building Concepts 6 Explain the principle behind Euclid's division algorithm. Explanation: The Euclid's division algorithm is based on the principle that the greatest common divisor of two numbers does not change if the smaller number is subtracted from the larger number. Consider two numbers 252 and 105 whose HCF is 21 . and , the is also 21 . Since the larger of the two numbers is reduced, repeating this process gives successively smaller numbers until one of them is zero. When that occurs, the GCD is the remaining nonzero number Step-1: Step-2 : Step-3: Required HCF
Numerical Ability 1 Use Euclid's division algorithm to find the HCF of 441, 567, 693. Solution: In order to find the HCF of 441, 567 and 693, we first find the HCF of 441 and 567 by Euclid's division algorithm. Using division algorithm, we get So, Now, we find the HCF of 63 and 693 Hence HCF
The Fundamental Theorem of Arithmetic tells us something important about the relationship between composite numbers and prime numbers. It is usually stated as follows : "Every composite number can be expressed as a product of primes, and their decomposition is unique, apart from the order in which the prime factors occur." e.g.
Thus we have expressed the composite number 12600 as product of powers of primes in ascending order and this decomposition is unique.
HCF (Highest common factor) The HCF of two or more numbers is the greatest number that divides each one of them exactly.
LCM (Least common Multiple) The least number which is exactly divisible by each one of the given numbers is called their LCM.
In order to find HCF and LCM of given numbers by Prime Factorisation Method or Fundamental Theorem of Arithmetic, express each number as the product of primes, then HCF = Product of least powers of common factors.
LCM = Product of highest powers of all the factors.
Important relation Product of two numbers Their HCF Their LCM
Building Concepts 7 The numbers 525 and 3000 are both divisible only by and 75 . What is HCF (525, 3000)? Justify your answer. Explanation: Since HCF of given numbers is the greatest number that divides each one of them exactly. Therefore, .
Numerical Ability 2 Find the LCM and HCF of 1296 and 2520 by applying the fundamental theorem of arithmetic method i.e. using the prime factorisation method. Solution: LCM HCF
Numerical Ability 3 Given that HCF . Find LCM . Solution means HCF of 306 and Required LCM means required. LCM of 306 and 657. For any two positive integers; their i.e.,
What is the relation between the LCM, HCF (of 3 numbers) and the HCF's of them taken by pairs? Exploring the Concept Consider any three natural numbers (say and ). Find their LCM and HCF. Find HCF of and , the HCF of and and the HCF of and . Find the product of the three numbers. Drawing conclusions Study some more examples draw up a table and discover.
State your discovery.
Important relation
Building Concepts 8 Can two numbers have 18 as their HCF and 380 as their LCM? Give reason. Explanation No, because HCF (18) does not divide LCM (380).
Building Concepts 9 Find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively. Explanation: Consider the numbers 1251-1, 9377-2 and 15628-3 or 1250, 9375 and 15625. Required number is the HCF of 1250, 9375 and 15625. Now,
Building Concepts 10 On a morning walk, three persons step off together and their steps measure 40 cm , 42 cm and 45 cm , respectively. What is the minimum distance each should walk so that each can cover the same distance in complete steps? Explanation: Minimum distance covered LCM of 40, 42, 45
Building Concepts 11 Explain why is a composite number. Explanation: Let is a composite number as having more than two distinct factors.
Building Concepts 12 Show that cannot end with digit or 5 for any natural number n . Explanation: So, the only primes in the factorisation of are 2 and 3 . For to end with digit 0 or 5 , it must have 5 as a prime factor. But by fundamental theorem of arithmetic, it cannot have 5 as a prime factor. Hence cannot end with digit 0 or 5 for any natural number n .
An irrational number is a real number that cannot be expressed as the ratio of two integers. The numbers , e, etc. are examples of irrational numbers. The decimal representation of irrational numbers is non-terminating and non-repeating. e.g. 0.101001000100001....
Theorem : Let p be a prime number. If p divides , then p divides a also, where a is a positive integer. Proof : Let the prime factorisation of a be as follows : , where are primes, not necessarily distinct. Therefore, . Now, we are given that divides . Therefore, from the Fundamental Theorem of Arithmetic, it follows that p is one of the prime factors of . However, using the uniqueness part of the Fundamental Theorem of Arithmetic, we realise that the only prime factors of are . So is one of . Now, since divides . Theorem : Prove that square root of 2 is irrational Proof: We shall prove this by the method of contradiction. If possible, let us assume that is a rational number. Then where are integers having no common factor other than 1 .
Building Concepts 13 Show that is irrational. Explanation: Let us assume, to the contrary, that is rational. and b are coprime Since 3, and are integers, is rational, and so is rational. But this contradicts that is irrational. So, we conclude that is irrational.
Building Concepts 14 Prove that is irrational. Explanation: Let be a rational number equals to Here L.H.S is an irrational number while R.H.S. is rational. L.H.S R.H.S Hence it contradicts our assumption that is rational. is irrational.
Building Concepts 15 Prove that is irrational. Explanation Let be rational number say ' x ' Squaring both side As and 2 are rational. is a rational number. So, also is a rational number. Which is contradiction of the fact that is an irrational number. Hence our assumption is wrong is an irrational number.
Building Concepts 16 Prove that is irrational, where are primes. Explanation: Let us suppose that be rational. Let , where r is rational. Therefore Squaring both sides, we get . Therefore Now, R.H.S. is a rational number, since is rational. is rational, are both rational (since are primes). But is irrational, since q is prime. We arrive at a contradiction Our supposition is wrong. Hence is irrational.
In Mathematics, a rational number is any number that can be expressed as the quotient of two integers, with the denominator not equal to zero.
Nature of the decimal expansion of rational numbers
Theorem 1: Let x be a rational number whose decimal expansion terminates. Then we can express in the form , where and are co-primes, and the prime factorisation of is of the form , where are non-negative integers. Theorem 2: Let be a rational number, such that the prime factorisation of is of the form , where are non-negative integers. Then, has a decimal expansion which terminates. Theorem 3: Let be a rational number, such that the prime factorisation of is not of the form , where are non-negative integers. Then, has a decimal expansion which is non-terminating repeating. e.g. (i) we observe that the prime factorisation of the denominator of this rational number is of the form , where are non-negative integers. Hence, has terminating decimal expansion. (ii) we observe that the prime factorisation of the denominator of this rational number is not of the form , where are non-negative integers. Hence has nonterminating and repeating decimal expansion. (iii) So, the denominator 8 of is of the form , where are non-negative integers. Hence has terminating decimal expansion. (iv) Clearly, 455 is not of the form . So, the decimal expansion of is non-terminating repeating.
Building Concepts 17 Without actually performing the long division, find if will have terminating or non-terminating (repeating) decimal expansion. Give reason for your answer. Explanation: Terminating decimal expansion, because and .
Building Concepts 18 A rational number in its decimal expansion is 327.7081. What can you say about the prime factors of , when this number is expressed in the form ? Give reasons. Explanation: Since 327.7081 is a terminating decimal number, so q must be in the form of where are natural numbers.
Numerical Ability 4 The decimal expansion of the rational number will terminate after how many places of decimals? Solution Given rational number will terminate after four places of decimals.
Building Concepts 19 Why is it so that the denominator of the rational number must be in the form (where and are non-negative integers) so as to have the decimal expansion of that rational number as terminating? Explanation: Let be a rational number Let be not in the form of then it can be decomposed into prime factors other than 2 and 5 . Let's say Then the rational number will not terminate because for any terminating decimal its denominator should be of the form , where e.g.
(Session 2025 - 26)