Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
Nossi ch 2
1. Chapter 1 follow-up Check digit division by 9: Usually the sum of the digits are divisible by 9 Mod 9 check digit scheme: Usually the last digit is congruent mod 9 to the sum of the previous digits.
2. Congruent mod 9 Some examples: 22 ≡ 4 mod 9 because 9|22-4 19 ≡ 1 mod 9 because 9|19-1 30 ≡ 3 mod 9 because 9|30-3
3. Congruent mod 9 Find the missing digit using mod 9 73?11 The sum of 7+3+d 3 +1 ≡1 mod 9 11+d 3 ≡1 mod 9
4. Congruent mod 9 Find the missing digit using mod 9 73?11 The sum of 7+3+d 3 +1 ≡ 1 mod 9 11+d 3 ≡ 1 mod 9 The missing digit must be 8 because 19 ≡ 1 mod 9