|
Answer» HCF of two positive integers can be find using the Euclid’s Division Lemma algorithmWe know that for any two integers a. b. we can write following expressiona=bq + r ,\xa00≤r\tS. NoType of NumbersDescription1Natural NumbersN = {1,2,3,4,5 > It is the counting numbers2Whole numberW= {0,1,2,3,4,5> It is the counting numbers + zero3IntegersAll whole numbers including\xa0Negative number\xa0+ Positive number ……-4,-3,-2,-1,0,1,2,3,4,5… so on. Like whole numbers, integers don’t include fractions or decimals.4Positive integersZ+\xa0= 1,2,3,4,5, ……5Negative integersZ–\xa0= -1,-2,-3,-4,-5, ……6Rational NumberA number is called rational if it can be expressed in the form p/q where p and q are integers (q> 0). Ex: P/q, 4/57Irrational NumberA number is called rational if it cannot be expressed in the form p/q where p and q are integers (q> 0). Ex: √2, Pi, … etc8Real NumbersA\xa0real number\xa0is a number that can be found on the number line. Real Numbers are the numbers that we normally use and apply in real-world applications. Real Numbers include Natural Numbers, Whole Numbers, Integers, Fractions, Rational Numbers and Irrational Numbers\t
|
