Zollege is here for to help you!!
Need Counselling

CAT Number System is a vast topic that includes important sub-topics like unit's digit, reminders, digital root, divisibility rules, integers, and number of zeroes etc. Questions are also asked on real numbers, prime numbers, natural numbers, and whole numbers. Check CAT QA Syllabus

CAT Number System topic is known for judging conceptual problems that test the brain of the candidates. One must require a combination of pure mathematical knowledge and logic skills to be strong in this topic. In fact, this chapter begins with the absolute basics of mathematics, i.e, numbers. It explains the different types of numbers and then extends the application of this knowledge to a variety of domains. Check CAT QA Question Papers

Read the article to know more about tips to prepare for the number system for CAT 2021, and also check important formulas along with solved sample questions.

Basics of CAT Number System

Numbers are divided into two types:

  1. Real Numbers
  2. Imaginary Numbers

Real Numbers are further divided into:

  1. Rational Number - have terminating or recurring decimal
  2. Irrational Number - have non-terminating or non-recurring decimal

Further, the Rational Numbers are divided into:

  1. Fractions
  2. Integers

Integers are categorised into: 

  1. Negative Integer 
  2. Neither Negative nor Positive
  3. Positive 

Other important types of Numbers to be Keep in Mind are:

  1. Whole Numbers - 0,1,2,3,4 etc
  2. Prime Numbers - which have only 2 factors i.e. 2,3,5,7 etc
  3. Composite Numbers - which have more than 2 factors
  4. 1 is neither a prime number or a composite number

Quick Links:

Important Topics from CAT QA Number System

The topics from Number System from which questions have appeared in CAT exam in recent years, include:

  • LCM and HCF
  • Prime and composite numbers
  • Properties of prime numbers
  • Theorems on prime numbers like remainder theorem, Euler’s theorem
  • Factorial of numbers
  • The number of zeroes in n!
  • Number of factors
  • Sum of the factors
  • Number of odd or even factors
  • Number of positive integral solutions
  • Divisibility rules
  • Divisibility properties
  • Cyclicity

How to prepare for CAT Number System?

Number Systems is a vast topic and around 1-3 questions are asked in CAT exam. There are various topics under Number Systems. 

  • Topics like, the number of zeroes or the highest power, unit’s place digit, digital root, and Euler number have to be covered completely.
  • Number theory is a topic in which one needs to understand the basics: Factors, Multiples, etc and there are few solving techniques, tips, and shortcuts required which are discussed below. 
  • But the exact way one can score good marks on this topic is by practicing. One must practice knowing all the rules so, practice enough questions.

CAT Preparation Tips for Prime and Composite Numbers

  • Prime numbers are those which have only two factors, 1 and the number itself.
  • Composite numbers have more than 2 factors. Examples are 4, 6, 8, 9.
  • 0 and 1 are neither composite nor prime. There are 25 prime numbers less than 100.

Properties of Prime numbers

  • List all prime factors less than or equal to √n to check if n is a prime number, l. 
  • If none of the prime factors can divide n then n is a prime number.
  • For any integer a and prime number p, ap−a is always divisible by p
  • All prime numbers greater than 2 and 3 can be written as 6k+1 or 6k-1
  • If a and b are co-prime then a(b-1) mod b = 1.
  • Topics like, the number of zeroes or the highest power, unit’s place digit, digital root, and Euler number have to be covered completely.
  • Number theory is a topic in which one needs to understand the basics: Factors, Multiples, etc and there are few solving techniques, tips, and shortcuts required which are discussed below. 
  • But the exact way one can score good marks on this topic is by practicing. One must practice knowing all the rules so, practice enough questions.

Important Theorems on Prime numbers

  • Fermat’s Theorem - Remainder of a^(p-1) when divided by p is 1, where p is a prime
  • Wilson’s Theorem - Remainder when (p-1)! is divided by p is (p-1) where p is a prime
  • Remainder Theorem - If a, b, c are the prime factors of N such that N= ap * bq * cr Then the number of numbers less than N and co-prime to N is
    • ϕ(N)= N (1-1/a) (1 – 1/b) (1 – 1/c).
    • This function is known as Euler’s totient function.
  • Euler’s theorem - If M and N are co-prime to each other then the remainder when Mϕ(N) is divided by N is 1.

Quick Links:

Divisibility Rules to Check the Prime Numbers

Divisibility by (Number)

Details

2

Last digit divisible by 2

4

Last two digits divisible by 4

8

Last three digits divisible by 8

16

Last four digit divisible by 16

3

Sum of digits divisible by 3

9

Sum of digits divisible by 9

27

Sum of blocks of 3 (taken right to left) divisible by 27

7

Remove the last digit, double it and subtract it from the truncated original number. Check if the number is divisible by 7

11

(sum of odd digits) – (sum of even digits) should be 0 or divisible by 11

Divisibility properties for CAT Number System

  • For composite divisors, check if the number is divisible by the factors individually. So, to check if a number is divisible by 6 it must be divisible by 2 and 3.
  • The equation an−bn is always divisible by a-b. If n is even it is divisible by a+b. If n is odd it is not divisible by a+b.
  • The equation an+bn is never divisible by a-b. If n is odd it is divisible by a+b. If n is even it is not divisible by a+b.
  • A decimal number is divisible by b-1 only if the sum of the digits of the number when written in base b are divisible by b-1.

Rules of Cyclicity in CAT Number System

To find the last digit of an, find the cyclicity of a. For Ex. if a=2, we see that

▸21=2 ▸22=4 ▸23=8 ▸24=16 ▸25=32

Hence, the last digit of 2 repeats after every 4th power. Hence cyclicity of 2 = 4. Hence if we have to find the last digit of an, The steps are:

  • Find the cyclicity of a, say it is x
  • Find the remainder when n is divided by x, say remainder r
  • Find ar if r>0 and ax when r=0

Quick Links:

Tricks to Solve Questions on CAT Number system

Candidates should know and learn the basic purpose and concepts of numbers before learning the number system tricks and tips. There is a difference between natural numbers, real numbers, and integers. Try to understand what are these numbers.

  • The last digit of a number in form: an
    Trick to know the last digit is to remember the cyclicity of the last digit of the given number. Each digit from 1 to 9 follow a pattern when exponential power is applied.
  • To find out the number of zeroes
    The number of zeroes at the end of the factorial of at the end of the factorial of any number, divide the number by 5, the quotient attained is again divided by 5 and this is repeated until the last quotient obtained is smaller than 5. The sum of all the quotients is the number of 5s, which then becomes the number of zeroes in the given number.
  • The digital root of any number is the sum of the digits of the number, repeated until it becomes a single-digit number.
  • Like, the digital root of 87983 is 8 + 7 + 9 + 8 + 3 ⇒ 35 = 3 + 5 ⇒ 8.
  • The product of 3 consecutive natural numbers is completely divisible by 6.
  • The product of 3 consecutive natural numbers, the first digit is an even number is perfectly divisible by 24.
  • The sum of a two-digit number and a number formed by reversing the digits is perfectly divisible by 11.
    Like, 27 + 72 = 99, is divisible by 11.
  • Also the difference between the above numbers will be perfectly divisible by 9. e.g. 99– 27 = 72, which is divisible by 9.
  • ∑n = n(n+1)/2, ∑n is the sum of first n natural numbers.
  • ∑n2 = n(n+1)(n+2)/6, ∑n2 is the sum of first n perfect squares.
  • ∑n3 = n2(n+1)2/4 = (∑n)2, ∑n3 is the sum of first n perfect cubes.
  • xn + yn = (x + y) (xn-1 – xn-2.y + xn-3.y2 – … +yn-1) when n is odd. Therefore, if n is odd, xn + yn is perfectly divisible by x + y.
  • xn – yn = (x + y) (xn-1 – xn-2.y + … yn-1) when n is even. Therefore, when n is even, xn – yn is divisible by x + y.xn – yn = (x – y) (xn-1 + xn-2.y + …. + yn-1) for both odd and even n. Therefore, xn – yn is divisible by x – y.

Once, a candidate practices these questions in bulk on topics such as Unit Digit, the process of solving the question will be clear automatically.

CAT Samle Questions on Number System

Ques. N = (18n2 + 9n + 8)/n; N is an integer. How many integral values can N have?

Sol. The expression can be broken as:

⇒ 18n2/n + 9n/n + 8/n.

⇒ 18n + 9 + 8/n.

For all integral value of ‘n’, 18n + 9 will always return an integer.

⇒ It depends upon 8/n

⇒ n can have any integer number i.e. a factor of 8.

⇒ The integers that satisfy are ±1, ±2, ±4 and ±8

⇒ So, n can have 8 possible values.

Ques. What is the number of factors of N, if N = 960 ?

Sol. N is a composite number

Let D be a composite number

a, b, c are prime numbers, and D = ap × bq × cr

⇒ total divisors of D can be given by n is = (p+1)(q+1)(r +1).

⇒ Dividing 960 into prime factors: 26 × 31 × 51, the total number of factors as (6+1) X (1+1) X (1+1) = 28.

Ques. Find the unit’s place digit of (123)34 × (876)456 × (45)86.

Sol. As there is no 5 in the unit’s place

Whenever an even unit digit and a 5 are present at the unit digit, they will always give a 0 at the unit digit.

The unit’s digit will always be 6, in the second number and 5 in the third number.

So, according to the principle discussed

6 X 5 = 30

Hence the unit’s digit is 0.

Ques. Find the number of zeroes at the end of the product of the first 100 natural numbers?

Sol. On dividing 100 by 5 we get 20 as quotient.

Then divide 20 i.e. the quotient by 5 and the new quotient comes as 4,

4 cannot be further divided by 5.

The sum of all these quotients gives the highest power of 5, which divides that number.

The sum comes as 24 which is ans.

Ques. Which number should replace the @ in the number 2347@98, so that it becomes a multiple of 9?

Sol. Using divisibility by 9 rule.

The number is divisible by 9 only if the sum of all the digits is divisible by 9.

Sum = 2 + 3 + 4 + 7 + 9 + 8 = 33 + @

The next multiple of 9 after 33, i.e. 36

So, @ is 3.

Ques. Check and provide that how many factors of the number 1080 are perfect squares?

Sol. 1080 = 23 * 33 * 5.

Factor can be of the form 2a * 3b * 5c.

The possible values ‘a’ are 0 and 2 and of b are 0 and 2,

and possible values of c are 0.

So in total, there are 4 possibilities. 1, 4, 9, and 36.

Quick Links

*The article might have information for the previous academic years, please refer the official website of the exam.

Ask your question