1 Numbers, Quantification

and Numerical
Applications

s
Modulo Arithmetic

ok
Modulo arithmetic is a base of number theory in Pure Mathematics. Modulo arithmetic is used in
many programming languages of computer. It is also used to calculate the check sums for ISBN
(International Standard of Book Numbers).
Let us think of the face of a clock called dial. The dial is divided
into 12 equal parts and these parts are marked as 1, 2, 3 …. 11, 12.
If the time is 9:00 now, then 6 hours later it should be 9 + 6 = 15
i.e. 15:00 but clock wrap around every 12 hours, so it shows 3:00.
bo
It can be understood as, when 15 is divided by 12, the remainder
is 3. This wrapping around a certain integer give rise to modulo
arithmetic which is sometimes called “clock arithmetic.”
Modulo arithmetic is a system of arithmetic for integers where
numbers “wrap around” when reaching a certain value called the
modulus (abbreviated as mod). Modulo arithmetic considers the
remainder when an integer is divided by another integer.
When we divide integer a by integer b, we have a = bq + r, where q, r ∈ I and 0 ≤ r < |b|.
Here, a is dividend, b is divisor, q is quotient and r is remainder.
c

Modulo arithmetic is the arithmetic of remainders. So, it can also be expressed as

a mod b = r
For example, when 14 is divided by 5, the remainder is 4,
ap

so, we write 14 mod 5 = 4.

We know that when an integer is divided by another positive integer n, then remainder may be
0, 1, 2, 3, …, (n – 1) i.e. x mod n may be 0, 1, 2, …, (n – 1).

Illustrative Examples

Example 1. Evaluate the following :

(i) 21 mod 2 (ii) – 8 mod 5 (iii) (9 + 23) mod 12 (iv) (8 × 7) mod 6
(v) 3 mod 10 (vi) 12 mod 4
Solution. (i) To find 21 mod 2, let us divide 21 by 2
2 ) 21 (10
20
1 Remainder
So, 21 mod 2 = 1.

Numbers, Quantification and Numerical Applications 1

 (ii) To find – 8 mod 5, let us divide – 8 by 5

5) –8 (–2
– 10
2 Remainder (Note this step,  0 ≤ r < |b|)

So, – 8 mod 5 = 2.

(iii) To find (9 + 23) mod 12, let us divide 9 + 23 i.e. 32 by 12

12 ) 32 ( 2
24
8 Remainder

s

So, (9 + 23) mod 12 = 8.
(iv) To find (8 × 7) mod 6, let us divide 8 × 7 i.e. 56 by 6

ok
6 ) 56 ( 9
54
2 Remainder
So, (8 × 7) mod 6 = 2.
(v) To find 3 mod 10, let us divide 3 by 10

10 ) 3 ( 0
bo
0
3 Remainder
So, 3 mod 10 = 3.
(vi) To find 12 mod 4, let us divide 12 by 4.

4 ) 12 ( 3
12
0 Remainder
c

So, 12 mod 4 = 0.

Congruence Modulo
ap

Let us find 15 mod 7 and – 6 mod 7.

7 ) 15 ( 2 7) –6 (–1
14  – 7
1 Remainder 1 Remainder

We can see that 15 and – 6 both leave the same remainder when divided by 7.
i.e. 15 is equivalent to – 6 (mod 7).
In other words, we can say that 15 is congruent to – 6 (mod 7). It can be written as
15 ≡ – 6 (mod 7).
So, another way of defining a ≡ b (mod n) is that difference of a and b i.e. (a – b) is an integral
multiple of n i.e. when a – b is divided by n, remainder is zero.
For example, 37 ≡ 12 (mod 5)
Here, 37 – 12 = 25 is an integral multiple of 5.

2 Applied Mathematics-XII
Example 2. It is currently 8:00 A.M. What time (in A.M. or P.M.) will be in next 500 hours?
Solution. We know that time repeats after every 24 hours.
So, we find 500 (mod 24)
 500 = 24 × 20 + 20, so 500 ≡ 20 (mod 24)
\ 500 hours is equivalent to 20 hours.
Now, (8 + 20) ≡ 4 (mod 24).
Hence, it will be 4:00 A.M. in next 500 hours.

Properties of Addition in Modulo Arithmetic

(i) If a + b = c, then a (mod n) + b (mod n) ≡ c (mod n)

s
or (a + b) (mod n) ≡ a (mod n) + b (mod n).
(ii) If a ≡ b (mod n), then (a + k) ≡ (b + k) (mod n), ∀ k ∈ I.
(iii) If a ≡ b (mod n) and c ≡ d (mod n), then (a + c) ≡ (b + d) (mod n).

ok
(iv) If a ≡ b (mod n), then – a ≡ – b (mod n).

Example 3. Find (486 + 729) mod 12.

Solution. We know that
(a + b) (mod n) ≡ a (mod n) + b (mod n).
So, (486 + 729) (mod 12) ≡ 486 (mod 12) + 729 (mod 12)
bo
≡ 6 (mod 12) + 9 (mod 12)
≡ (6 + 9) (mod 12)
≡ 15 (mod 12)
≡ 3 (mod 12)
∴ (486 + 729) (mod 12) ≡ 3.

Example 4. Find the remainder when 672 + 541 + 383 + 295 + 101 + 86 is divided by 3.
Solution. We find (672 + 541 + 383 + 295 + 101 + 86) mod 3
Since 672 ≡ 0 (mod 3)
c

541 ≡ 1 (mod 3)
383 ≡ 2 (mod 3)
295 ≡ 1 (mod 3)
ap

101 ≡ 2 (mod 3)
and 86 ≡ 2 (mod 3).
So, (672 + 541 + 383 + 295 + 101 + 86) mod 3
≡ (0 + 1 + 2 + 1 + 2 + 2) mod 3
≡ 8 (mod 3)
≡ 2 (mod 3).
Hence, the remainder when (672 + 541 + 383 + 295 + 101 + 86) is divided by 3 is 2.

Properties of Multiplication in Modulo Arithmetic

(i) If a . b = c, then a (mod n) . b (mod n) = c (mod n)
or a . b (mod n) ≡ a (mod n) . b (mod n).
(ii) If a ≡ b (mod n), then ka ≡ kb (mod n), ∀ k ∈ I.
(iii) If a ≡ b (mod n) and c ≡ d (mod n), then ac = bd (mod n).

Numbers, Quantification and Numerical Applications 3

Example 5. Find (186 × 93) mod 7.
Solution. We know that
a . b (mod n) ≡ a (mod n) . b (mod n)
So, (186 × 93) mod 7 ≡ 186 (mod 7) . 93 (mod 7)
≡ 4 (mod 7) . 2 (mod 7)
≡ 4 . 2 (mod 7) ≡ 8 (mod 7)
≡ 1 (mod 7)
∴ (186 × 93) (mod 7) ≡ 1.

Example 6. Find the remainder when 783 × 657 × 594 × 432 × 346 × 251 is divided by 5.

s
Solution. We find (783 × 657 × 594 × 432 × 346 × 251) mod 5
Since 783 ≡ 3 (mod 5)
657 ≡ 2 (mod 5)

ok
594 ≡ 4 (mod 5)
432 ≡ 2 (mod 5)
346 ≡ 1 (mod 5)
and 251 ≡ 1 (mod 5).
So, (783 × 657 × 594 × 432 × 346 × 251) mod 5 ≡ (3 × 2 × 4 × 2 × 1 × 1) mod 5
bo
≡ 48 (mod 5) ≡ 3 (mod 5).
Hence, the remainder when (783 × 657 × 594 × 432 × 346 × 251) is divided by 5 is 3.

Example 7. Find the last two digits of the product 2345 × 6789.
Solution. To find the last two digits of the product 2345 × 6789, we find 2345 × 6789 (mod 100).
Since 2345 ≡ 45 (mod 100)
and 6789 ≡ 89 (mod 100).
So, 2345 × 6789 ≡ 45 × 89 (mod 100)
≡ 4005 (mod 100)
c

≡ 05 (mod 100).
Hence, the last two digits of the product 2345 × 6789 are 05.
ap

Example 8. Find the last three digits of the product 1234 × 5678.
Solution. To find the last three digits of the product 1234 × 5678, we find 1234 × 5678 (mod 1000).
Since 1234 ≡ 234 (mod 1000)
and 5678 ≡ 678 (mod 1000).
So, 1234 × 5678 ≡ 234 × 678 (mod 1000)
≡ 158652 (mod 1000)
≡ 652 (mod 1000).
Hence, the last three digits of the product 1234 × 5678 are 652.

Property of Exponent in Modulo Arithmetic

If a ≡ b (mod n), then ak ≡ bk (mod n), ∀ k ∈ N.

Example 9. Find 316 (mod 4).

Solution. As 32 = 9 ≡ 1 (mod 4)
So, (32)8 ≡ 18 (mod 4)

4 Applied Mathematics-XII
 ⇒ 316 ≡ 1 (mod 4)
∴ 316 (mod 4) ≡ 1.

Example 10. Find the last digit of 1212.

Solution. To find the last digit of 1212, we find 1212 (mod 10).
Since 12 ≡ 2 (mod 10) ⇒ 124 ≡ 24 (mod 10)
⇒ 124 ≡ 16 (mod 10) ⇒ 124 ≡ 6 (mod 10)
⇒ (124)3 ≡ 63 (mod 10)
⇒ 1212 ≡ 216 (mod 10)
⇒ 1212 ≡ 6 (mod 10).

s
Hence, the last digit of 1212 is 6.

Exercise 1.1

ok
1. Evaluate the following:
(i) 43 (mod 6) (ii) 97 (mod 5) (iii) –17 (mod 4)
(iv) (57 – 42) mod 11 (v) (62 + 53) mod 7 (vi) (9 × 8) mod 5
2. Find (576 + 789) mod 9.
3. Find (482 × 813) mod 7.
bo
4. Find the remainder when 987 + 876 + 765 + 654 + 543 + 432 + 321 + 210 is divided by 6.
5. Find the remainder when 862 × 783 × 671 × 549 × 411 × 395 × 217 is divided by 8.
6. Find the last two digits of the product 4895 × 6789.
7. Find the last three digits of the product 2345 × 4567.
8. Find the last two digits of the product 123 × 234 × 345.
9. Find the value of 612 (mod 7).
10. Find the last digit of 1717.
11. Find the last two digits of 220.
c

12. It is 7:00 P.M. currently. What time (in A.M. or P.M.) will be in next 1500 hours?

Answers
ap

1. (i) 1 (ii) 2 (iii) 3 (iv) 4 (v) 3 (vi) 2

2. 6 3. 6 4. 0 5. 6 6. 55 7. 615
8. 90 9. 1 10. 7 11. 76 12. 7:00 A.M.

Arithmetic Function
An arithmetic function f is a function whose domain is the set of positive integers and range is a
subset of the complex numbers.
i.e. f : Z+ → C
Arithmetic functions are also known as number theoretic functions.
An example of arithmetic function is the divisor function.
τ (n) = number of positive divisors of n, n ∈ N.

Numbers, Quantification and Numerical Applications 5

 For example, τ (16) = 5.
(Since the positive divisors of 16 are 1, 2, 4, 8, 16.)

Additive and Multiplicative Functions

Most of the arithmetic functions are additive or multiplicative functions.

Additive Function
An arithmetic function f is called additive if for co-prime natural numbers n1 and n2
(i.e. gcd (n1, n2) = 1)
f (n1 . n2) = f (n1) + f (n2).

s
An arithmetic function f is called completely additive if for all natural numbers n1 and n2
f (n1 . n2) = f (n1) + f (n2).

Multiplicative Function

ok
An arithmetic function f is called multiplicative if for co-prime natural numbers n1 and n2
i.e. gcd (n1 , n2) = 1
f (n1 . n2) = f (n1) . f (n2)
An arithmetic function f is called completely multiplicative if for all natural numbers
n1 and n2
f (n1 . n2) = f (n1) . f (n2).
bo
Simple Arithmetic Functions
Some simple arithmetic functions are defined below:
(i) τ (n) = Number of positive divisors of n, n ∈ N.
For example, τ (12) = 6.
(Since positive divisors of 12 are 1, 2, 3, 4, 6, 12.)
n 1 2 3 4 5 6 7 8 9 10 11 12 13 14
τ (n) 1 2 2 3 2 4 2 4 3 4 2 6 2 4
c

From the above table, we can see that

τ (2) = τ (1 . 2) = τ (1) . τ (2) = 1 × 2 = 2; gcd (1, 2) = 1
τ (6) = τ (2 . 3) = τ (2) . τ (3) = 2 × 2 = 4; gcd (2, 3) = 1
ap

τ (10) = τ (2 . 5) = τ (2) . τ (5) = 2 × 2 = 4; gcd (2, 5) = 1

τ (12) = τ (3 . 4) = τ (3) . τ (4) = 2 × 3 = 6; gcd (3, 4) = 1.
Hence, we can say that τ (n) is a multiplicative function.
(ii) σ (n) = Sum of all positive divisors of n, n ∈ N.
For example, σ (6) = 1 + 2 + 3 + 6 = 12
σ (8) = 1 + 2 + 4 + 8 = 15.
n 1 2 3 4 5 6 7 8 9 10 11 12
σ (n) 1 3 4 7 6 12 8 15 13 18 12 28
From the above table, we can see that
σ (3) = σ (1 . 3) = σ (1) . σ (3) = 1 × 4 = 4; gcd (1, 3) = 1
σ (6) = σ (2 . 3) = σ (2) . σ (3) = 3 × 4 = 12; gcd (2, 3) = 1
σ (10) = σ (2 . 5) = σ (2) . σ (5) = 3 × 6 = 18; gcd (2, 5) = 1.
Hence, we can say that σ (n) is a multiplicative function.

6 Applied Mathematics-XII
 (iii) σk (n) = Sum of kth power of all the positive divisors of n, k ∈ N, n ∈ N.
For example, σ2 (6) = 12 + 22 + 32 + 62 = 50
σ2 (10) = 12 + 22 + 52 + 102 = 130.
Also, σ0 (n) = t (n) and σ1 (n) = σ (n)
σk (n) is also a multiplicative function.
(iv) π (n) = Number of primes ≤ n, n ∈ N.
For example, π (7) = 4
Since prime numbers ≤ 7 are 2, 3, 5 and 7.

n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

s
π (n) 0 1 2 2 3 3 4 4 4 4 5 5 6 6 6
Note that
π (2 × 3) = π (6) = 3 and π (2) × π (3) = 1 × 2 = 2 (gcd (2, 3) = 1)

ok
⇒ π (2 × 3) ≠ π (2) × π (3)
⇒ π is not a multiplicative function.
Also, π (3 × 4) = π (12) = 5 and π (3) + π (4) = 2 + 2 = 4 (gcd (3, 4) = 1)
⇒ π (3 × 4) ≠ π (3) + π (4)
⇒ π is not an additive function.
bo
(v) ω (n) = Number of distinct prime factors of n, n ∈ N.
For example, ω (6) = 2 ( 6 = 2 × 3)
ω (8) = 1 ( 8 = 2 × 2 × 2)
ω (30) = 3 ( 30 = 2 × 3 × 5)

n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
ω (n) 0 1 1 1 1 2 1 1 1 2 1 2 1 2 2 1
From the above table, we can see that
ω (6) = ω (2 . 3) = ω (2) + ω (3) = 1 + 1 = 2; gcd (2, 3) = 1
c

ω (10) = ω (2 . 5) = ω (2) + ω (5) = 1 + 1 = 2; gcd (2, 5) = 1
ω (30) = ω (5 . 6) = ω (5) + ω (6) = 1 + 2 = 3; gcd (5, 6) = 1.
ap

Hence, we can say that ω (n) is a additive function.

(vi) Ω (n) = Total number of prime factors of n, n ∈ N.
For example, Ω (6) = 2 ( 6 = 2 × 3)
Ω (8) = 3 ( 8 = 2 × 2 × 2)

n 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Ω (n) 0 1 1 2 1 2 1 3 2 2 1 3 1 2 2 4 1 3 1 3
From the above table, we can see that
Ω (6) = Ω (2 × 3) = Ω (2) + Ω (3) = 1 + 1 = 2; gcd (2, 3) = 1
Ω (8) = Ω (2 × 4) = Ω (2) + Ω (4) = 1 + 2 = 3; gcd (2, 4) = 2
Ω (9) = Ω (3 × 3) = Ω (3) + Ω (3) = 1 + 1 = 2; gcd (3, 3) = 3
Ω (12) = Ω (2 × 6) = Ω (2) + Ω (6) = 1 + 2 = 3; gcd (2, 6) = 2.
Hence, we can say that Ω (n) is a completely additive function.

Numbers, Quantification and Numerical Applications 7

 Illustrative Examples

Example 1. If τ (n) = Number of positive divisors of n ∈ N, then find

(i) τ (15) (ii) τ (20) (iii) τ (24) (iv) τ (30)
Solution. (i)  15 = 1 × 15; 15 = 3 × 5
So, positive divisors of 15 are 1, 3, 5, 15.
∴ τ (15) = 4
(ii)  20 = 1 × 20; 20 = 2 × 10; 20 = 4 × 5
So, positive divisors of 20 are 1, 2, 4, 5, 10, 20.

s
∴ τ (20) = 6
(iii)  24 = 1 × 24; 24 = 2 × 12; 24 = 3 × 8; 24 = 4 × 6
So, positive divisors of 24 are 1, 2, 3, 4, 6, 8, 12, 24.

ok
∴ τ (24) = 8
(iv)  30 = 1 × 30; 30 = 2 × 15; 30 = 3 × 10; 30 = 5 × 6
So, positive divisors of 30 are 1, 2, 3, 5, 6, 10, 15, 30.
∴ τ (30) = 8

Example 2. If σ (n) = Sum of all positive divisors of n, n ∈ N, then find

bo
(i) σ (14) (ii) σ (28) (iii) σ (35) (iv) σ (40)
Solution. (i)  14 = 1 × 14; 14 = 2 × 7
So, positive divisors of 14 are 1, 2, 7, 14.
∴ σ (14) = 1 + 2 + 7 + 14 = 24
(ii)  28 = 1 × 28; 28 = 2 × 14; 28 = 4 × 7
So, positive divisors of 28 are 1, 2, 4, 7, 14, 28.
∴ σ (28) = 1 + 2 + 4 + 7 + 14 + 28 = 56
(iii)  35 = 1 × 35; 35 = 5 × 7
c

So, positive divisors of 35 are 1, 5, 7, 35.

∴ σ (35) = 1 + 5 + 7 + 35 = 48
(iv)  40 = 1 × 40; 40 = 2 × 20; 40 = 4 × 10; 40 = 5 × 8
ap

So, positive divisors of 40 are 1, 2, 4, 5, 8, 10, 20, 40.

∴ σ (40) = 1 + 2 + 4 + 5 + 8 + 10 + 20 + 40 = 90.

Example 3. If σk (n) = Sum of kth powers of all the positive divisors of n, n ∈ N, then find
(i) σ2 (8) (ii) σ3 (6) (iii) σ4 (5)
Solution. (i)  8 = 1 × 8; 8 = 2 × 4
So, positive divisors of 8 are 1, 2, 4, 8.
∴ σ2 (8) = 12 + 22 + 42 + 82
= 1 + 4 + 16 + 64 = 85
(ii)  6 = 1 × 6; 6 = 2 × 3
So, positive divisors of 6 are 1, 2, 3, 6.
∴ σ3 (6) = 13 + 23 + 33 + 63
= 1 + 8 + 27 + 216 = 252

8 Applied Mathematics-XII
 (iii)  5 = 1 × 5
So, positive divisors of 5 are 1, 5.
∴ σ4 (5) = 14 + 54 = 1 + 625 = 626.

Example 4. If π (n) = Number of primes less than or equal to n, n ∈ N, then find

(i) π (20) (ii) π (24) (iii) π (36) (iv) π (45)
Solution. (i) Prime numbers less than or equal to 20 are
2, 3, 5, 7, 11, 13, 17, 19
∴ π (20) = 8
(ii) Prime numbers less than or equal to 24 are

s
2, 3, 5, 7, 11, 13, 17, 19, 23
∴ π (24) = 9
(iii) Prime numbers less than or equal to 36 are

ok
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31
∴ π (36) = 11
(iv) Prime numbers less than or equal to 45 are
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43
∴ π (45) = 14.

Example 5. If ω (n) = Number of distinct prime factors of n, n ∈ N, then find

bo
(i) ω (27) (ii) ω (36) (iii) ω (110) (iv) ω (390)
Solution. (i)  27 = 3 × 3 × 3 ⇒ ω (27) = 1
(ii)  36 = 2 × 2 × 3 × 3 ⇒ ω (36) = 2
(iii)  110 = 2 × 5 × 11 ⇒ ω (110) = 3
(iv)  390 = 2 × 3 × 5 × 13 ⇒ ω (390) = 4.
Example 6. If Ω (n) = Total number of prime factors of n, n ∈ N , then find
(i) Ω (39) (ii) Ω (64) (iii) Ω (126) (iv) Ω (210)
Solution. (i)  39 = 3 × 13 ⇒ Ω (39) = 2
c

(ii)  64 = 2 × 2 × 2 × 2 × 2 × 2 ⇒ Ω (64) = 6
(iii)  126 = 2 × 3 × 3 × 7 ⇒ Ω (126) = 4
(iv)  210 = 2 × 3 × 5 × 7 ⇒ Ω (210) = 4.
ap

Exercise 1.2
1. If τ (n) = Number of positive divisors of n, n ∈ N, then find
(i) τ (16) (ii) τ (28) (iii) τ (36) (iv) τ (45)
2. If σ (n) = Sum of all positive divisors of n, n ∈ N, then find
(i) σ (18) (ii) σ (30) (iii) σ (36) (iv) σ (49)
3. If σk (n) = Sum of kth powers of all the positive divisors of n, n ∈ N, then find
(i) σ2 (12) (ii) σ3 (4) (iii) σ3 (9) (iv) σ4 (3)
4. If π (n) = Number of primes less than or equal to n, n ∈ N, then find
(i) π (24) (ii) π (40) (iii) π (52) (iv) π (63)
5. If ω (n) = Number of distinct prime factors of n, n ∈ N, then find
(i) ω (22) (ii) ω (68) (iii) ω (105) (iv) ω (780)
6. If Ω (n) = Total number of prime factors of n, n ∈ N, then find
(i) Ω (36) (ii) Ω (156) (iii) Ω (221) (iv) Ω (420)

Numbers, Quantification and Numerical Applications 9

Answers
1. (i) 5 (ii) 6 (iii) 9 (iv) 6 2. (i) 39 (ii) 72 (iii) 91 (iv) 57
3. (i) 210 (ii) 73 (iii) 757 (iv) 82 4. (i) 9 (ii) 12 (iii) 15 (iv) 18
5. (i) 2 (ii) 2 (iii) 3 (iv) 4 6. (i) 4 (ii) 4 (iii) 2 (iv) 5

AllIgation or Mixture
Alligation means mixing two or more ingredients in some ratio. Problems based on alligation or
mixture are asked in various competitive exams.
There are mainly two formulas used in alligation.

s
Formula-1
This formula of alligation enables us to find the ratio in which two or more ingredients at the given
prices must be mixed to produce a mixture at desired price.

ok
Suppose we have two ingredients of different prices. The price per unit of cheaper ingredient
is denoted by ‘c’ and the price per unit of dearer ingredient is denoted by ‘d’. We mix these two
ingredients in some ratio to produce a mixture at desired price (also called mean price, say ‘m’,
then
quantity of cheaper ingredient C.P. of dearer − mean price
= .
quantity of dearer ingredient mean price − C.P. of cheaper
The above formula can be represented by the following diagram which is easier to
bo
understand:
C.P. of cheaper ‘c’ C.P. of dearer ‘d’

Mean price ‘m’

(d – m) (m – c)

quantity of cheaper ingredient d−m

Hence, = .
quantity of dearer ingredient m−c
c

Illustrative Examples

Example 1. In what ratio must a shopkeeper mix two types of oranges worth ` 30 per kg and ` 45 per kg
ap

respectively so as to get a mixture at ` 40 per kg?

Solution. Here,
the C.P. of cheaper oranges ‘c’ = ` 30 per kg,
the C.P. of dearer oranges ‘d’ = ` 45 per kg
and the mean price of the mixture ‘m’ = ` 40 per kg.
quantity of cheaper oranges d−m
So, =
quantity of dearer oranges m−c

45 − 40 5 1
= = = .
40 − 30 10 2
Hence, the required ratio is 1 : 2.

Example 2. The cost price of type I rice is ` 60 per kg and that of type II is ` 80 per kg. If both types of rice
are mixed in the ratio 2 : 3 respectively, then find the price per kg of the mixed rice.
Solution. Given, c = ` 60 per kg, d = ` 80 per kg
Quantity of cheaper : Quantity of dearer = 2 : 3

10 Applied Mathematics-XII