The document Number Systems - More Concepts Quant Notes | EduRev is a part of the Banking Exams Course Quantitative Aptitude for SSC CGL.

All you need of Banking Exams at this link: Banking Exams

**Cyclicity**

- At times there are questions that require the students to find the units digit in case of the numbers occurring in powers.
- If anyone asks you to find the unit digit of 3
^{3}, you will easily calculate it also you can calculate for 3^{5, }but if anyone asks you the unit digit of 173^{99}, it will be hard to calculate easily.

- But it’s very simple if we understand that the units digit of a product is determined by whatever is the digit at the units place irrespective of the number of digits.
**Example:**5 × 5 ends in 5 & 625 × 625 also ends in 5. - Now let’s examine the pattern that a number generates when it occurs in powers of itself. See the last digit of different numbers.

**Table: **Showing the Unit Digit of a Number for Different Exponents

From the above table, we can conclude that a number repeats the unit digit after an interval of 1, 2 or 4. Precisely we can say that the universal cyclicity of all the numbers is 4. i.e. after 4, all the numbers start repeating their unit digits.__Therefore, to calculate the unit digit for any exponent of a given number, we have to follow the following steps:__**Step 1:** Divide the exponent of the given number by 4 and calculate the remainder.**Step 2:** The unit digit of the number is the same as the unit digit of the number raised to the power of the calculated remainder.**Step 3:** If the remainder is zero, then the unit digit will be the same as the unit digit of **N ^{4}.**

**Example 1. Find the last digit of (173) ^{99}.**

- We notice that the exponent is 99. On dividing, 99 by 4 we get 24 as the quotient & 3 as the remainder.
- Now, these 24 pairs of 4 each do not affect the no. at the units place So, (173)
^{99}≈ (173)^{3}. Now, the number at the units place is 3^{3}= 27.

Try yourself:Find the Unit digit of 287^{562581}

View Solution

**Factors**

- A factor is a number that divides another number completely.
**Example:**Factors of 24 are: 1, 2, 3, 4, 6, 8, 12, 24.

**➢ Number of Factors**

- If we have a number, N = p
^{a}× q^{b}× r^{c }Where p, q, and r are prime numbers and a, b, and c are the no. of times each prime number occurs, then the number of factors of n is found by (a + 1) (b +1)(c + 1).

**Example: Find the number of factors of 2 ^{4 }× 3^{2}.**

Number of factors = (4 + 1) (2 + 1) = 5(3) = 15

Funda:All the perfect squares have odd number of factors and other number have even number of factors.

**➢ Number of Ways of Expressing a Given Number as a Product of Two Factors**

- When a number is having even number of factors, then it can be written as a product of two numbers in ways.
- But if a number has the odd number of factors, then it can be written as a product of two different numbers in ways and can be written as a product of two numbers (different or similar) in ways.

Examples:(i)148 can be expressed as a product of two factors in 6/2 or 3 ways.

{Because (p + 1) (q + 1) (r + 1) in the case of 148 is equal to 6}.(ii)144 (2^{4}.3^{2}) can be written as a product of two different numbers in, i.e. 7 ways.

**➢ Sum of the Factors of a Number**

- If a number N is written in the form of N = a
^{p}.b^{q}.c^{r}, where a, b & c are prime numbers and p, q & r are positive integers, then the sum of all the factors of the number is given by the formula: - Sum of factors =

**Factorial**

- Factorial is defined for any positive integer. It is denoted by or !. Thus “Factorial n” is written as n! or
- n! is defined as the product of all the integers from 1 to n.
- Thus n! = 1.2.3. …. n. (n! = n(n – 1)!)

**Example 2: Find the largest power of 3 that can divide 95! without leaving any remainder.**

- First look at the detailed explanation and then look at a simpler method for solving the problem.
- When we write 95! in its full form, we have 95 × 94 × 93 ….. × 3 × 2 × 1.
- When we divide 95! by a power of 3, we have these 95 numbers in the numerator. The denominator will have all 3’s. The 95 numbers in the numerator have 31 multiples of 3 which are 3, 6, 9….90, 93. Corresponding to each of these multiplies we can have a 3 in the denominator which will divide the numerator completely without leaving any remainder, i.e. 3
^{31}can definitely divide 95!.- Further, every multiple of 9, i.e. 9, 18, 27, etc. after cancelling out a 3 above, will still have one more 3 left. Hence for every multiple of 9 in the numerator, we have an additional 3 in the denominator. There are 10 multiples of 9 in 95, i.e. 9, 18….81, 90. So we can take 10 more 3’s in the denominator.
- Similarly, for every multiple of 3
^{3}we can take an additional 3 in the denominator.- Since there are 3 multiples of 27 in 91 (they are 27, 54 and 81), we can have three more 3’s in the denominator.
- Next, corresponding to every multiple of 3
^{4,}i.e. 81 we can have one more 3 in the denominator. Since there is one multiple of 81 in 95, we can have one additional 3 in the denominator.- Hence the total number of 3’s we can have in the denominator is 31 + 10 + 3 + 1, i.e., 45. So 3
^{45}is the largest power of 3 that can divide 95! without leaving any remainder.

__The same can be done in a simpler manner, also, which is explained below:__

- Divide 95 by 3 you get a quotient of 31. Divide this 31 by 3 we get a quotient of 10. Divide this 10 by 3 we get a quotient of 3. Divide this quotient of 3 once again by 3 we get a quotient of 1.
- Since we cannot divide the quotient any more by 3, we stop here. Add all the quotients, i.e. 31 + 10 + 3 + 1 which gives 45 which is the highest power of 3.
- Add all the quotients 31 + 10 + 3 + 1, which give 45.

{Note that this type of a division where the quotient of one step is taken as the dividend in the subsequent step is called “Successive Division”. In general, in the successive division, the divisor need not be the same (as it is here). Here, the number 95 is being successively divided by 3}.

Note:

- This method is applicable only if the number whose largest power is to be found out is
a prime number.- If the number is not a prime number, then we have to write the number as the product of relative primes, find the largest power of each of the factors separately for the smallest, among the largest powers of all these relative factors of the given number will give the largest power required.

**Example 3. Find the largest power of 12 that can divide 200!**

- Here we cannot apply the Successive Division method because 12 is not a prime number. Resolve 12 into a set of prime factors.
- We know that 12 can be written as 3 × 4. So, we will find out the largest power of 3 that can divide 200! and the largest power of 4 that can divide 200! and take the LOWER of the two as the largest power of 12 that can divide 200!.
- To find out the highest power of 4, since 4 itself is not a prime number, we cannot directly apply the successive division method. We first have to find out the highest power of 2 that can divide 200!.
- Since two 2’s taken together will give us a 4, half the power of 2 will give the highest power of 4 that can divide 200!. We find that 197 is the largest power of 2 that can divide 200!. Half this figure-98-will be the largest power of 4 that can divide 200!.
- Since the largest power of 3 and 4 that can divide 200! are 97 an 98 respectively, the smaller of the two, i.e., 97 will be the largest power of 12 that can divide 200! without leaving any remainder.

**Example 4. What is the last digit of 2 ^{34} × 3^{34} × 4^{34}.**

- Given = (24)
^{34}- The last digit of 4
^{n}is 6 if n is even.- Answer is 6

**Example 5. What is the rightmost non zero digit of (270) ^{270}**

- The required answer is the last digit of 7
^{270}.- The last digit of 7 powers repeats after every 4.
- So, the last digit of 7
^{270}is the last digit of 7^{2}= 9.

**Example 6. How many factors do 1296 have?**

- 1296 = 4 × 324
- 1296 = 4 × 4 × 81
- 1296 = 2
^{4}× 3^{4}- Number of factors = (4 + 1) (4 + 1) = 25.

**Example 7. If x is the sum of all the factors of 3128 and y is the no of factors of x and z is the number of ways of writing ‘y’ as a product of two numbers, then z =?**

- 3128 = 4 × 782
- 3128 = 4 × 2 × 391
- 3128 = 2
^{3}× 17 × 23- x = 15 × (17 + 1) (23 + 1)
- x = 3 × 5 × 9 × 2 × 8 × 3
- x = 2
^{4}× 3^{4}× 5- ∴ y = (4 + 1) (4 + 1) (1 + 1)
- y = 2 × 5
^{2}

**Example 8. How many co-factors are there for 240, which are less than 240?**

- 240 = 16 × 15
- 240 = 2
^{4}× 3 × 5- Number of co primes to N, which are less than N
- If N = a
^{b}× b^{q}× - - - - (a, b, - - - - are Prime no.s)

**Example 9. What is the sum of all the co primes to 748? Which are less than N?**

- 748 = 4 × 187

748 = 2^{2}× 11 × 17- Sum of all the co primes to N. which are less than N is N/2 (number of co primes to N, which are less than N.
- Sum = 748/2 * 320 = 119680

**Example 10. In how many ways 5544 can be written as a product of 2 co primes?**

- If N = a
^{p}× b^{q}× - - - -, where a, b, - - - - are prime numbers- N can be written as a product of two co primes in 2
^{n-1}ways, where n is the number of prime factors to N.- ∴ 5544 = 11 × 504

= 11 × 9 × 56

= 11 × 9 × 8 × 7

= 2^{3}× 3^{2}× 7 × 11- ∴ Ans
= 2^{4-1}= 2^{3}= 8. (Because, 2, 3, 7 & 11 are four different prime factors).

**➢ Multiplying the Last Two-Digit of the Exponents in Ten Seconds**

- Follow this trick and shortcut method to multiply the numbers in your head. This can be a huge advantage for those preparing for CAT exam or any other MBA entrance exams.
- The tricks used in this video is simple and straight. You might not need a paper and pen to solve this type of question after learning the shortcuts.
**The****last digit of a number in form: a**^{n}

The simple trick followed to know the last digit is to remember the cyclicity of the last digit of the number given. Every digit from 1 to 9 follow a pattern when exponential power is applied. Here is the table that will be handy in solving these type of questions.

Offer running on EduRev: __Apply code STAYHOME200__ to get INR 200 off on our premium plan EduRev Infinity!

54 videos|52 docs|72 tests