Number Systems INTRODUCTION ‘The chapter on Number Systems is amongst the most important chapters in the entire syllabus of Quantitative Aptitude for the CAT examination (and also for other parallel MBA entrance exams). Students are advised to fo through this chapter with utmost care; understanding teach concept and question type on this topic. The CAT has consistently contained anything between 20-40 percent of the marks based on questions taken from this chapter. Naturally, this chapter becomes one of the most crucial as far as your quest to reach close to the qualification score in the section of Quantitative Aptitude is concemed. Hence, going through this chapter and its concepts properly is imperative for you. It would be a good idea to first go through the basic definitions of all types of numbers. Also, closely follow the solved examples based on various concepts discussed in the chapter. Also, the approach and attitude while solving questions on this chapter is to try to ‘maximise your leaning experience out of every question Hence, do not just try to solve the questions but also try to think of alternative processes in order to solve the same question. Refer to hints or solutions only as a last resort To start of, the following pictorial representation of the types of numbers will help you improve your quality of comprehension of different types of numbers. [DEFINITION Natural Numbers These are the numbers (1, 2, 3, etc.) that are used for counting. In other words, all positive integers are natural numbers ‘There are infinite natural numbers and the number | is the least natural number. Eaamples of natural numbers: 1, 2, 4 8, 32, 23, 4321 and on. Decimats Integers (Numbers havi no decals) a] r T les | Negative Integers Zero Positive Finite oF Infinite oF | t Terminating Non- Decimals Terminating Decimals — mal Non-Recuring zee Positive integers = Natural Numbers The following numbers are examples of numbers that are not natural: ~2, -31, 2.38, 0 and so on. Based on divisibility, there could be two types of natural numbers: Prime and ‘omposite. Prime Numbers A natural number larger than unity is a prime number if it does not have other divisors except for itself and unity, Note: Unity (ie., 1) is not a prime number. The lowest prime number is 2 Number 2 is also the only even prime number. The lowest odd prime number is 3. ‘The remainder when a prime number p > 5 is divided + by 6 is 1 or 5. However, if a number on being divided + by 6 gives a remainder of 1 or 5, the number need not be prime. Thus, this can be referred to as a necessary | but not sufficient condition, In mathematical and | algebraic writing, this logic is represented as: Prime | numbers after 3, would always be of the form 67 + 1} or 6n + 5. It can also be referred to as: Prime numbers | afier 3 would always be of the form: 6n + 1. ;Number Systems a ‘The set of rational numbers encloses the set of jategers and fractions. The rules given above for addition, rracton, multiplication and division also apply on rational numbers. Rational numbers that are not integral will have decimal salves. These values can be of two types: (@ Terminating (or finite) decimal fractions: For cnample, 17/4 = 425, 21/5 = 4.2 and so forth (q) Non-terminating decimal fractions: Amongst non terminating decimal fractions there are two types of decimal values: { Non-terminating periodic fractions: These are non terminating decimal fractions of the type x+a,a,0,a, BPR inci 1 0,0,0,0,0, 0,000.4, 138, 15.23232823, 14.287628762 876 and so on. (ii) Now-terminating non-periodic fractions: These are of the form x-b,b,b,b,...b,c\¢,¢,-..C,, For example: 5.2731687143725186. Of the above categories, terminating decimal and non- terminating periodic decimal fractions belong to the set of rational numbers. Inational Numbers Fractions, that are non-terminating, non-periodic fractions, are irrational numbers. Some examples of irrational numbers are V2, v3, tc. In other words, all square and cube roots of natural ‘numbers that are not squares and cubes of natural numbers se irrational. Other irrational numbers include x, ¢ and so on. ‘Every positive irrational number has a negative irrational umber corresponding to it. All operations of addition, subtraction, multiplication and Aivision applicable to rational numbers are also applicable 10 irational numbers As briefly stated in the Back to School section, an expression contains a rational and an fimational number together, the two have to be carried ‘ogether till the end. In other words, an irrational number ‘Ghee it appears in the solution of a question will continue ‘0 appear till the end of the question. This concept is oh useful in Geometry. For example: If you are the ratio of the area of a circle to that of an eens tinge, you can expect to see a n/V3 in the This is because the area of a circle will always component in it, while that of an equilateral will always have V3, ‘ealise that once an irrational number appears ion of a question, it can only disappear if it is divided by the same irr CONCEPT OF GCD (GREATEST COMMON DIVISOR OR HIGHEST COMMON FACTOR) Consider two natural numbers n, and 1 If the numbers n, and 1, are exactly divisible by the same number x, then x is a common divisor of m, and The highest of all the common divisors of m, and 1, 1s called as the GCD ot the HCF, This is denoted as GCD (non) Rules for Finding the GCD Two Numbers n, and n, 1G) Find the standard form of the numbers m, and 1 ! (b) Write out all prime factors that are common to the standard forms of the numbers n, and (© Raise each of the common prime factors listed above 10 the lesser of the powers in which it appears in the standard forms of the numbers 7 Land m. (@) The product of the results of the previous step will {be the GCD of n, and n,, Mlustration: Find the GCD of 150, 210, 375, Step 1: Writing down the standard form of numbers 3 150 = 5 x5x3x2 210=5x2x7x3 / 375 =5x5x5x3 Step 2: Writing prime factors common to all the three numbers is 5' x 3! Step 3: This will give the same result, i¢., 5! x 9 Step 4: Hence, the HCF will be 5x 3 = 15 For practice, find the HCF of the following: ; (@) 78, 39, 195 (b) 440, 140, 390 (©) 198, 121, 1331 SHORTCUT FOR FINDING THE HCF The above ‘school’ process of finding the HCF (or the GCD) of a set of numbers is, however, extremely cumbersome and time-taking, Let us take a look at a much faster way of finding the HCF of a set of numbe ‘Suppose you were required to find the HCF of 39,78 and 195, ‘Logic The HICF of these numbers would necessarily have to be @ factor (divisor) of the difference between any pair of numbers from the above 3, ie. the HCE has to be f factor of (78 ~ 39 = 39) as well as of (195 ~ 39 = 156) and (195 ~ 78 = 117), Why’ee son wi Cone di 10 Shay tal shout ees yo do? We Me wes er il rat ifyou ha to do the se Now soni wan. nach acs, YOU Wot es amongst S chil 9h cane mer of coooes 60; See va Wo ate each to all the 5 parson You woul ge 1 tool cach ©4118 fhe remainder 4 would have tobe divided in ia ot of would give ise othe dimal 8 and henee 0; Atould give L8 chocolates to each child. That is how ‘Concept of decimals enters mathematics in the fist place. "Taking this concept further, you can realise that the 3:P* ie For s + Prine ogy 29,31, 37 41, 1 5 17 19, 23, 29, 31, 37. 4b 11,73, 79, 83, 89, 97- Prime numbers between 2 Pop nts, 127, 131, 137, 139, 149, 151, 15 173, 179, 181, 191, 193, 197, 199. ‘i "ata and b are any two odd primes then a° — composite. Also, a + b? is composite. ‘5 The remainder of the division of the square of prime umber p > S divided by 12 101, 103, 107, + soe Sl, 157 163 167, [SHORT-CUT PROCESS ‘To Check ‘Prime or Not To check whether a number N is prime, adopt the | following process. (@) Take the square root of the number. !(b) Round of the square root to the immediately higher integer. Call this number z. For example if you have ! to check for 181, its square root will be 13. Hence, ! the value of z, in this case will be 14. : (©) Check for divisibility of the number NV by all prime | {numbers below z. If there is no prime number below | {the value of z which divides V then the number V! will be prime. ; To illustrate :~ The value of 239 lies between 15 to 16. Hence, take the value of z as 16. { ,, rime numbers less than or equal to 16 are 2, 3, 5,7, 1 and 13, 239 is not divisible by any of these. Hence ¥0u can conclude that 239 is a prime number A Brief Look into Why this Works? Suppose you are asked to find the factors ofthe number 40 An untrained mind will find the factors as 8, 10, 20 and 40, 1, 2, 4, 5, Th i . follows, SK Will be performed by a trained mind as 1 x 4 2 x 2 4 «x 10 got Seats discovery of factor one 210 will automatically yield r words, factors will appear in terms xd as factor pairs, The ; > 1 can be calles : 2 of what fil automaticaly pinpoint the gy, factor example above, when you fing ele) — Thus, in ll automatcally get 8 too ar fete you ote take a look again at the pars inthe ge by if you compare the values i cach pair wig Bt £40 (ie. 6.xxx) you will find that for gt, aia in the left column is lower than the gua) by: ASyatils the eet in the right column ig big a Hence, we can now phrase this as: Whenever a tofind the factors of any number, you ill ages’ Pe in pairs (i, factor pairs). Further, the factor pn = such that in each pir of factors, one ofthe fag, be lower than the square root of N while the ogy) Us higher than the square root of WV. a ‘As a result of this fact, one need not make ay, to find the factors of a number above the square» the number. These come automatically. All you nesi: th is to find the factors below the square root of them te Extending this logic, we can say that if we m, able 10 find a factor of a number up to the valuey be square root, we will not be able to find any factors ™ the square root and the number under consideration be a prime number. This is the reason why when ves ™ to check whether a number is prime, we have to che : factors only below the square root. = But, we have said that you need to check fordivist’ only with the prime numbers below (and including square root of the number. c Let us look at an example to understand why your (j to look only at prime numbers below the square root 7 Uptil now, we have deduced that in order 0 & Whether a number is prime, we just need to do af search below (and including) the square root. Thus, for example, in order to find whether 1811 Prime number, we need to check for it’s divisibility + the numbers = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and Ii yy The first thing you will realise, when you first lool jf the list above is that all even numbers will get elimis’ w automatically (since no even number can divide an! eb number and of course you will check a number for & Prime only if it is odd!) a This will leave you with the numbers 3 m 13 to check 181, m ge we not need to check with composite nui a etiaka root? This will again be understood composite nutes cox! of the example above. TH check with ne th lst above is 9. You donot a With 3 you ve ares When you checked 1 for divs? Rae would get either of two cases: 6 # If N is divisible by 3: In such ao 9) will automatically become non-prime and you ca? #