CBSE Class 12 Applied Mathematics
41 Lernnotizen, von cookie erstellt, in 8 Abschnitten, die den Themen des Kurses folgen.
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.
Was enthalten ist
Die erste Notiz
Numbers, quantification and numerical applications / Modular arithmetic and congruence
The remainder and the modulus
When an integer a is divided by a positive integer m, we write a=qm+r with 0≤r<m. The number r is the remainder, and we write r=amodm. The number m is the modulus, and the process of keeping only the remainder is modular arithmetic.
For example, 17=3×5+2, so 17mod5=2. Negative numbers are handled the same way. Since −3=(−1)×5+2, we have −3mod5=2. The remainder is never negative, so it is always one of 0,1,…,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)mod7, where Monday is counted as 0. Since 100=14×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:
Worked example
Find (13+9)mod7 and (6×8)mod7.
Working with the remainders first, 13mod7=6 and 9mod7=2, so
The check is 22mod7=1, since 22=3×7+1. For the product, 6×8=48=6×7+6, so (6×8)mod7=6.
Division does not work in the same way. Dividing by a number is possible only after multiplying by an inverse modulo m, and that inverse exists only when the number and m 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) for x in {0,1,…,6}.
Testing each value, 3×5=15 and 15=2×7+1, so x=5 is the solution in that range. Every other solution differs from 5 by a multiple of 7.
Congruence modulo m
Two integers a and b are congruent modulo m when they leave the same remainder on division by m. This is written
and it means that m divides a−b. Equivalently, a=b+km for some integer k. The statement is read "a is congruent to b modulo m".
Worked example
Is 29≡5(mod6)? The difference is 29−5=24, and 24=4×6, so 6 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≡b and c≡d(modm), then a+c≡b+d and ac≡bd(modm). This is why the remainder rules work.
Equivalence classes
Congruence modulo m is an equivalence relation: every integer is congruent to itself, if a≡b then b≡a, and if a≡b and b≡c then a≡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=4 there are four classes:
| Class | Members (a few) | Remainder |
|---|---|---|
| [0] | …,−4,0,4,8,… | 0 |
| [1] | …,−3,1,5,9,… | 1 |
| [2] | …,−2,2,6,10,… | 2 |
| [3] | …,−1,3,7,11,… | 3 |
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] 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−1.
For a question about a large power, such as the remainder of 210 on division by 7, repeated reduction is quicker than the full power. Since 23=8≡1(mod7), we have 210=29×2=(23)3×2≡13×2=2(mod7).
Und 40 weitere: Öffne sie über die Liste oben.
Bewertungen
Noch keine schriftlichen Rezensionen. Füge diese Notizen zu deinen hinzu und du kannst die erste Rezension schreiben.