+91 9600 121 800

Plans

Dashboard

Daily & Speed

Quant

Verbal

DILR

Compete

Free Stuff

calendarBack
Quant

/

Numbers

/

Factors & Remainders

Factors And Remainders

MODULES

HCF & LCM
Number of Factors
HCF with Remainders
LCM with Remainders
Operations on Remainders
Euler & Fermat
Special Types
Past Questions

CONCEPTS & CHEATSHEET

Concept Revision Video

SPEED CONCEPTS

Factors & Remainders 1
-/10
Factors & Remainders 2
-/10
Factors & Remainders 3
-/10
Factors & Remainders 4
-/10

PRACTICE

Factors & Remainders : Level 1
-/15
Factors & Remainders : Level 2
-/15
Factors & Remainders : Level 3
-/10
ALL MODULES

CAT 2025 Lesson : Factors & Remainders - Special Types

bookmarked

6. Special Types

Following are some of the common types of questions asked in the entrance tests.

6.1 Difference of squares of positive integers

1) Where
n\bm{n}n is an odd natural number and xxx is the number of factors of nnn, then the number of ways in which nnn can be expressed as the difference of squares of positive integers is x2\dfrac{x}{2}2x​ if xxx is even and x−12\dfrac{x - 1}{2}2x−1​ if xxx is odd.

222) Where n\bm{n}n is divisible by 4 and xxx is the number of factors of n4\dfrac{n}{4}4n​ , then the number of ways in which nnn can be expressed as the difference of squares of positive integers is x2\dfrac{x}{2}2x​ if xxx is even and x−12\dfrac{x - 1}{2}2x−1​ if xxx is odd.

3) Where
n\bm{n}n is an even number not divisible by 4, it can never be written as the difference of squares of positive integers.

Explanation

ab=(a+b2)2−(a−b2)2ab = \left(\dfrac{a + b}{2}\right)^2 - \left(\dfrac{a - b}{2}\right)^2ab=(2a+b​)2−(2a−b​)2

(
a+ba + ba+b) and (a−ba - ba−b) have to be even numbers so that they are divisible by 222. This requires both aaa and bbb to be even or both to be odd.

If
n\bm{n}n is odd, we find the number of ways n\bm{n}n can be written as a product of two numbers.

If
n\bm{n}n is even, we have to ensure that it is written as product of 222 even numbers.

As
aaa and bbb have to be multiples of 222, we find the number of ways n4\bm{\dfrac{n}{4}}4n​ can be written as a product of two numbers.

Note that a number such as
18=21×3218 = 2^1 \times 3^218=21×32 , can never be expressed in this form. (As the power of 222 is 111, one of aaa and bbb will be even, while the other will be odd)

∴\therefore∴ Integers of the form 4k+2\bm{4k} + 24k+2 can never be expressed as difference of squares.

All other numbers, including prime numbers can be expressed in the form of difference of squares.

Example 27

In how many different ways can 484848 be expressed as the difference of squares of two positive integers?

Solution

48=24×348 = 2^4 \times 348=24×3

We assign one
222 each to aaa and bbb to make both of them even.

Therefore, we are left with
22×32^2 \times 322×3 to be split across the two numbers.

Number of ways
22×32^2 \times 322×3 can be written as a product of 222 numbers =Number of factors2= \dfrac{\mathrm{Number \ of \ factors}}{2}=2Number of factors​

=(2+1)(1+1)2=3= \dfrac{(2 + 1)(1 + 1)}{2} = 3=2(2+1)(1+1)​=3

Answer:
333

6.2 Sum of 2 or more consecutive natural numbers

Rule: Number of ways in which
xxx can be expressed as the sum of 222 or more consecutive natural numbers is the number of odd factors of x\bm{x}x other than 1.

Explanation
Sum to nnn terms of Arithmetic Progression =n2[2a+(n−1)d]= \dfrac{n}{2}[2a + (n - 1)d]=2n​[2a+(n−1)d]

nnn is the number of terms, aaa is the first term and ddd is the common difference between two consecutive terms.

Let the number
xxx be expressed as the sum of consecutive natural numbers. In the case of consecutive natural numbers, d=1d = 1d=1. We do not know nnn or aaa.

n2[2a+(n−1)1]=x\dfrac{n}{2}[2a + (n - 1)1] = x2n​[2a+(n−1)1]=x

⇒
n(2a+n−1)=xn(2a + n - 1) = xn(2a+n−1)=x

If
nnn is an even number, then (2a+n−12a + n - 12a+n−1) is an odd number and vice–versa.

∴\therefore∴ For every odd factor of a number (other than 1), there is 1 way in which the number can be expressed as the sum of consecutive natural numbers.

The numbers which cannot be expressed in this form are those without odd factors, which are of the sequence
2,22,23,242, 2^2, 2^3, 2^42,22,23,24, ...

Example 28

In how many ways can you write 120120120 as the sum of 222 or more consecutive natural numbers?

Solution

120=23×3×5120 = 2^3 \times 3 \times 5120=23×3×5

No. of odd factors of
120=120 =120= No. of factors for 3×5=(1+1)×(1+1)=43 \times 5 = (1 + 1) \times (1 + 1) = 43×5=(1+1)×(1+1)=4

As odd numbers other than
111 should be considered, there are 4−1=34 - 1 = 34−1=3 ways in which 120120120 can be written as the sum of 222 or more consecutive natural numbers.

Answer:
333

6.3 Remainder Theorem for Algebraic Expressions

Where
aaa is a constant, the remainder when a polynomial f(x)f(x)f(x) is divided by (x−ax - ax−a), is f(a)\bm{f(a)}f(a).

Example 29

What is the remainder when (x)4−3(x)3+2(x)2−8(x)^4 - 3(x)^3 + 2(x)^2 - 8(x)4−3(x)3+2(x)2−8 is divided by x+3x + 3x+3 ?

Solution

Let f(x)=(x)4−3(x)3+2(x)2−8f(x) = (x)^4 - 3(x)^3 + 2(x)^2 - 8f(x)=(x)4−3(x)3+2(x)2−8

If
x+3=x−kx + 3 = x - kx+3=x−k , then k=−3k = - 3k=−3
f(−3)=(−3)4−3(−3)3+2(−3)2−8f(- 3) = (- 3)^4 - 3(- 3)^3 + 2(- 3)^2 - 8f(−3)=(−3)4−3(−3)3+2(−3)2−8
=81+81+18−8= 81 + 81 + 18 - 8=81+81+18−8
=172= 172=172

Answer:
172172172

Example 30

If (x)3+9(x)2−8x−2(x)^3 + 9(x)^2 - 8x - 2(x)3+9(x)2−8x−2 when divided by (x−2)(x - 2)(x−2) , leaves a remainder of 000, then a possible value of xxx is

(1)
121212               (2) 131313               (3) 151515               (4) 161616

Solution

Substituting the values, even with a calculator, will be time consuming.

Let f(x)f(x)f(x) = (x)3+9(x)2−8x−2 (x)^3 + 9(x)^2 - 8x - 2(x)3+9(x)2−8x−2

f(x)f(x)f(x) when divided by (x−2)(x - 2)(x−2), leaves a remainder of

f(2)=8+9×4−8×2−2=26f(2) = 8 + 9 \times 4 - 8 \times 2 - 2 = 26f(2)=8+9×4−8×2−2=26

∴\therefore∴ Where Q is the quotient, f(x)=Q×(x−2)+26f(x) = Q \times (x - 2) + 26 f(x)=Q×(x−2)+26

If (
x−2x - 2x−2) is a factor of 262626, then (x−2x - 2x−2) will perfectly divide f(x)f(x)f(x).

If
x−2=13 x - 2 = 13x−2=13
⇒
x=15x = \bm{15}x=15

Answer: (3)
151515

6.4 Wilson's Theorem

Where
n\bm{n}n is a prime number, Rem((n−2)!n)=1\mathrm{Rem} \left(\dfrac{(n - 2)!}{n}\right) = 1Rem(n(n−2)!​)=1 and Rem((n−1)!n)=n−1\mathrm{Rem} \left(\dfrac{(n - 1)!}{n}\right) = n - 1Rem(n(n−1)!​)=n−1.

(Note: The second equation above can be derived from the first by applying remainder theorem)

For instance, where
n\bm{n}n = 29\bm{29}29,Rem(27!29)=1\mathrm{Rem} \left(\dfrac{27!}{29}\right) = 1Rem(2927!​)=1 and Rem(28!29)=28\mathrm{Rem} \left(\dfrac{28!}{29}\right) = 28Rem(2928!​)=28

Additionally, note that where
nnn is a composite number and n≠4n \neq 4n=4, Rem((n−2)!n)=Rem((n−1)!n)=0\mathrm{Rem} \left(\dfrac{(n - 2)!}{n}\right) = \mathrm{Rem} \left(\dfrac{(n - 1)!}{n}\right) = 0Rem(n(n−2)!​)=Rem(n(n−1)!​)=0 .

For instance, where
n=28\bm{n = 28}n=28, Rem(27!28)=Rem(26!28)=0\mathrm{Rem} \left(\dfrac{27!}{28}\right) = \mathrm{Rem} \left(\dfrac{26!}{28}\right) = 0Rem(2827!​)=Rem(2826!​)=0

Where
n=4\bm{n = 4}n=4, Rem(2!4)=Rem(3!4)=2\mathrm{Rem} \left(\dfrac{2!}{4}\right) = \mathrm{Rem} \left(\dfrac{3!}{4}\right) = 2Rem(42!​)=Rem(43!​)=2

The following example is of very high difficulty and is unlikely to appear in entrance tests. However, the concepts applied here will enhance your understanding of remainders which would help ace a test.

Example 31

What is the remainder when 25!25!25! is divided by 292929?

Solution

Let Rem(25!29)=x\mathrm{Rem} \left(\dfrac{25!}{29}\right) = xRem(2925!​)=x

Applying Wilson's theorem we get
Rem(27!29)=1\mathrm{Rem} \left(\dfrac{27!}{29}\right) = 1Rem(2927!​)=1

⇒
Rem((27×26×25!)29)=1\mathrm{Rem} \left(\dfrac{(27 \times 26 \times 25!)}{29}\right) = 1Rem(29(27×26×25!)​)=1 ⇒ Rem((29−2)×(29−3)×x29)=1\mathrm{Rem} \left(\dfrac{(29 - 2) \times (29 - 3) \times x}{29}\right) = 1Rem(29(29−2)×(29−3)×x​)=1

⇒
Rem((−2)×(−3)×x29)=1\mathrm{Rem} \left(\dfrac{(- 2) \times (- 3) \times x}{29}\right) = 1Rem(29(−2)×(−3)×x​)=1 ⇒ Rem(6x29)=1\mathrm{Rem} \left(\dfrac{6x}{29}\right) = 1Rem(296x​)=1

Where
kkk is a positive integer, 6x6x6x can be expressed as

6x=29k+16x = 29 k + 16x=29k+1 ⇒ x=(29k+1)6x = \dfrac{(29k + 1)}{6}x=6(29k+1)​

The smallest integral solution is when
k=1k = 1k=1 and x=5x = 5x=5. ∴\therefore∴ The remainder is 5.

Answer:
555

6.5 Remainder when terms are in GP

This is a specific type of question where we need to express the divisor as sum of terms in GP in order to find the remainder.

Example 32

What is the remainder when 2+22+23+...+2502 + 2^{2} + 2^{3} + ... + 2^{50}2+22+23+...+250 is divided by 777?

Solution

7=1+2+4=20+21+227 = 1 + 2 + 4 = 2^{0} + 2^{1} + 2^{2}7=1+2+4=20+21+22

There are a total of
505050 terms in 2+22+23+...+2502 + 2^{2} + 2^{3} + ... + 2^{50}2+22+23+...+250

Sum of any three consecutive terms will be divisible by
(20+21+22)( 2^{0} + 2^{1} + 2^{2} )(20+21+22) and will therefore leave a remainder of 000.

For instance,
Rem(235+236+23720+21+22)=\mathrm{Rem} \left(\dfrac{2^{35} + 2^{36} +2^{37}}{2^{0} + 2^{1} + 2^{2}}\right) =Rem(20+21+22235+236+237​)= Rem(235(20+21+2220+21+22)=0\mathrm{Rem} \left(\dfrac{2^{35}(2^{0} + 2^{1} +2^{2}}{2^{0} + 2^{1} + 2^{2}}\right) = 0Rem(20+21+22235(20+21+22​)=0

As it is easier to work with the smaller terms, the sum of the last
484848 terms (161616 sets of 333 terms each) will leave a remainder of 000. And, we will be left with just the first 222 terms.

Rem(21+22+23+...+25020+21+22)\mathrm{Rem} \left(\dfrac{2^{1} + 2^{2} + 2^{3} + ... + 2^{50}}{2^{0} + 2^{1} + 2^{2}}\right)Rem(20+21+2221+22+23+...+250​)

=Rem(21+22+23(20+21+22)+26(20+21+22)+...+248(20+21+22)20+21+22)= \mathrm{Rem} \left(\dfrac{2^{1} + 2^{2} + 2^{3}(2^{0} + 2^{1} + 2^{2}) + 2^{6}(2^{0} + 2^{1} + 2^{2}) + ... + 2^{48}(2^{0} + 2^{1} + 2^{2})}{2^{0} + 2^{1} + 2^{2}}\right)=Rem(20+21+2221+22+23(20+21+22)+26(20+21+22)+...+248(20+21+22)​)

=Rem(21+2220+21+22)=Rem(67)=6= \mathrm{Rem} \left(\dfrac{2^{1} + 2^{2}}{2^{0} + 2^{1} + 2^{2}}\right) = \mathrm{Rem} \left(\dfrac{6}{7}\right) = 6=Rem(20+21+2221+22​)=Rem(76​)=6

Answer:
666

Want to read the full content

Unlock this content & enjoy all the features of the platform

Subscribe Now arrow-right
videovideo-lock