콘텐츠로 건너뛰기

CBSE Class 12 Applied Mathematics

Class 12 · CBSEApplied Mathematics노트 41개, 폴더 8개, 158 KB

cookie가 만든 복습 노트 41개예요. 과정의 주제에 따라 8개 섹션으로 구성돼요.

Notes for CBSE Class 12 Applied Mathematics (subject code 241, 2026-27), in folders for the eight units of the Class XII course in the board's order, with one note per topic. Worked examples use rupees with Indian digit grouping.

포함된 내용

첫 번째 노트

Numbers, quantification and numerical applications / Modular arithmetic and congruence

The remainder and the modulus

When an integer aa is divided by a positive integer mm, we write a=qm+ra = qm + r with 0≤r<m0 \le r < m. The number rr is the remainder, and we write r=a mod mr = a \bmod m. The number mm is the modulus, and the process of keeping only the remainder is modular arithmetic.

For example, 17=3×5+217 = 3 \times 5 + 2, so 17 mod 5=217 \bmod 5 = 2. Negative numbers are handled the same way. Since −3=(−1)×5+2-3 = (-1) \times 5 + 2, we have −3 mod 5=2-3 \bmod 5 = 2. The remainder is never negative, so it is always one of 0,1,…,m−10, 1, \ldots, m-1.

Modular arithmetic is useful whenever only the position in a cycle matters. Days of the week repeat every 7 days, clock hours every 12, and a check digit is often a remainder. Asking what day it will be 100 days after a Monday is the same as asking for (100+0) mod 7(100 + 0) \bmod 7, where Monday is counted as 0. Since 100=14×7+2100 = 14 \times 7 + 2, the answer is Wednesday.

Arithmetic rules

Addition, subtraction and multiplication can be done on remainders first, and the result is the same as doing the full calculation and then taking the remainder. This holds because the remainder of a sum depends only on the remainders of the parts. So:

(a+b) mod m=((a mod m)+(b mod m)) mod m (a + b) \bmod m = \big((a \bmod m) + (b \bmod m)\big) \bmod m
(a×b) mod m=((a mod m)×(b mod m)) mod m (a \times b) \bmod m = \big((a \bmod m) \times (b \bmod m)\big) \bmod m
Worked example

Find (13+9) mod 7(13 + 9) \bmod 7 and (6×8) mod 7(6 \times 8) \bmod 7.

Working with the remainders first, 13 mod 7=613 \bmod 7 = 6 and 9 mod 7=29 \bmod 7 = 2, so

(13+9) mod 7=(6+2) mod 7=8 mod 7=1. (13 + 9) \bmod 7 = (6 + 2) \bmod 7 = 8 \bmod 7 = 1.

The check is 22 mod 7=122 \bmod 7 = 1, since 22=3×7+122 = 3 \times 7 + 1. For the product, 6×8=48=6×7+66 \times 8 = 48 = 6 \times 7 + 6, so (6×8) mod 7=6(6 \times 8) \bmod 7 = 6.

Division does not work in the same way. Dividing by a number is possible only after multiplying by an inverse modulo mm, and that inverse exists only when the number and mm share no common factor other than 1. The usual way to solve a linear congruence is to try the possible remainders.

Worked example

Solve 3x≡1(mod7)3x \equiv 1 \pmod 7 for xx in {0,1,…,6}\{0, 1, \ldots, 6\}.

Testing each value, 3×5=153 \times 5 = 15 and 15=2×7+115 = 2 \times 7 + 1, so x=5x = 5 is the solution in that range. Every other solution differs from 5 by a multiple of 7.

Congruence modulo m

Two integers aa and bb are congruent modulo mm when they leave the same remainder on division by mm. This is written

a≡b(modm) a \equiv b \pmod m

and it means that mm divides a−ba - b. Equivalently, a=b+kma = b + km for some integer kk. The statement is read "aa is congruent to bb modulo mm".

Worked example

Is 29≡5(mod6)29 \equiv 5 \pmod 6? The difference is 29−5=2429 - 5 = 24, and 24=4×624 = 4 \times 6, so 66 divides the difference. Both numbers leave remainder 5 on division by 6, so the statement is true.

Congruence behaves well with the operations above. If a≡ba \equiv b and c≡d(modm)c \equiv d \pmod m, then a+c≡b+da + c \equiv b + d and ac≡bd(modm)ac \equiv bd \pmod m. This is why the remainder rules work.

Equivalence classes

Congruence modulo mm is an equivalence relation: every integer is congruent to itself, if a≡ba \equiv b then b≡ab \equiv a, and if a≡ba \equiv b and b≡cb \equiv c then a≡ca \equiv c. Such a relation splits the integers into disjoint groups called equivalence classes. Each class contains all the integers that leave the same remainder.

For m=4m = 4 there are four classes:

ClassMembers (a few)Remainder
[0][0]…,−4,0,4,8,…\ldots, -4, 0, 4, 8, \ldots0
[1][1]…,−3,1,5,9,…\ldots, -3, 1, 5, 9, \ldots1
[2][2]…,−2,2,6,10,…\ldots, -2, 2, 6, 10, \ldots2
[3][3]…,−1,3,7,11,…\ldots, -1, 3, 7, 11, \ldots3

Every integer is in exactly one class, and the four classes together make up the whole set of integers. A class is named by any one of its members. For example, [2]=[10]=[−6][2] = [10] = [-6] because all three leave remainder 2 when divided by 4.

Using the method

Modular arithmetic is the right tool when a question asks what remains after repeated steps, what day or position a long count reaches, or whether two quantities differ by a multiple of a number. A common method is to reduce each number to its remainder first, combine the remainders, and reduce again. This keeps the working small. A student should always check that the final answer lies between 0 and m−1m - 1.

For a question about a large power, such as the remainder of 2102^{10} on division by 7, repeated reduction is quicker than the full power. Since 23=8≡1(mod7)2^3 = 8 \equiv 1 \pmod 7, we have 210=29×2=(23)3×2≡13×2=2(mod7)2^{10} = 2^9 \times 2 = (2^3)^3 \times 2 \equiv 1^3 \times 2 = 2 \pmod 7.

그 밖에 40개 더 있어요. 위 목록에서 원하는 항목을 열어 보세요.

평가

아직 작성된 후기가 없어요. 이 노트를 내 노트에 추가하면 가장 먼저 후기를 남길 수 있어요.