CRACKU.IN
Cracku Tip 1 - Number systems
▪ Number Systems is one of the important topic in the quantitative
section for IBPS.
▪ The time taken to solve questions from this topic may be more
without knowing the formulas and tricks.
▪ Learning simple tricks like divisibility rules, HCF and LCM and
factors can help you to solve questions from this topic easily.
▪ Odd numbers: All numbers which are not divisible by 2 are known
as odd numbers. For example, 1, 3, 5, etc. are all odd numbers.
▪A pair of prime numbers differing by two are called twin prime Ex. 7,11
and 17,19
Take free IBPS CLERK mock test https://cracku.in/banking/ibps-clerk-mocks
Cracku Tip 6 - Number systems
Properties of Prime numbers
▪ To check if n is a prime number, list all prime factors less than or
equal to √n. If none of the prime factors can divide n then n is a
prime number.
▪ All prime numbers greater than 2 and 3 can be written in the form of
6k+1 or 6k-1
▪ If two numbers have H.C.F = 1 then that two numbers are said to
be co-prime or relatively prime to each other
Take free IBPS PO mock test https://cracku.in/banking/ibps-prelims-mocks
Cracku Tip 7 - Number systems
HCF and LCM
Divisibility
Divisibility
▪ Divisibility by 7: Remove the last digit, double it and subtract it from the
truncated original number. Check if number is divisible by 7
Divisibility
Divisibility properties
Cyclicity
▸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:
1. Find the cyclicity of a, say it is x
2. Find the remainder when n is divided by x, say remainder r
3. Find ar if r>0 and ax when r=0
Take free IBPS PO mock test https://cracku.in/banking/ibps-prelims-mocks
Cracku Tip 20 - Number systems