Without performing the divisions, determine whether the integers 176521221 and 149235678 are divisible by 9 or 11.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
4
ao = 7aj + 3az +9a3 + Tas+3as +9a6 +7a7+3as (mod 10)
identification number 81504216 would then have check digit
n7.8+3-1+9.5+7.0+3.4+9.2+7-1+3.6=9 (mod 10)
hat 815042169 would be printed on the check.
This weighting scheme for assigning check digits detects any single-digit error
the identification number. For suppose that the digit a, is replaced by a different
" By the manner in which the check digit is calculated, the difference between the
correct ag and the new a is
a9
ag = k(a; - a)
(mod 10)
where k is 7,3, or 9 depending on the position of a. Because k(a; - a)# 0 (mod 10),
it follows that a9 # ag and the error is apparent. Thus, if the valid number 81504216
were incorrectly entered as 81504316 into a computer programmed to calculate
check digits, an 8 would come up rather than the expected 9.
The modulo 10 approach is not entirely effective, for it does not always detect
the common error of transposing distinct adjacent entries a and b within the string
of digits. To illustrate: the identification numbers 81504216 and 81504261 have
the same check digit 9 when our example weights are used. (The problem occurs
b| = 5.) More sophisticated methods are available, with larger moduli
when Ja -
and different weights, that would prevent this possible error.
PROBLEMS 4.3
1. Use the binary exponentiation algorithm to compute both 1953 (mod 503) and 14147
(mod 1537).
2. Prove the following statements:
(a) For any integer a, the units digit of a? is 0, 1, 4, 5, 6, or 9.
(b) Any one of the integers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 can occur as the units digit of a.
(c) For any integer a, the units digit of a is 0, 1, 5, or 6.
(d) The units digit of a triangular number is 0, 1, 3, 5, 6, or 8.
3. Find the last two digits of the number 9.
[Hint: 9° = 9 (mod 10); hence, 99° = 9°+10k, notice that 9° = 89 (mod100).]
4. Without performing the divisions, determine whether the integers 176521221 and
149235678 are divisible by 9 or 11.
3. (a) Obtain the following generalization of Theorem 4.6: If the integer N is represented
in the base b by
N = amb" +
...+azb? + a,b+ ao
0 s ak <b- 1
then b – 1|N if and only if b- 1| (am ++a2 + a1 + ao).
Transcribed Image Text:ao = 7aj + 3az +9a3 + Tas+3as +9a6 +7a7+3as (mod 10) identification number 81504216 would then have check digit n7.8+3-1+9.5+7.0+3.4+9.2+7-1+3.6=9 (mod 10) hat 815042169 would be printed on the check. This weighting scheme for assigning check digits detects any single-digit error the identification number. For suppose that the digit a, is replaced by a different " By the manner in which the check digit is calculated, the difference between the correct ag and the new a is a9 ag = k(a; - a) (mod 10) where k is 7,3, or 9 depending on the position of a. Because k(a; - a)# 0 (mod 10), it follows that a9 # ag and the error is apparent. Thus, if the valid number 81504216 were incorrectly entered as 81504316 into a computer programmed to calculate check digits, an 8 would come up rather than the expected 9. The modulo 10 approach is not entirely effective, for it does not always detect the common error of transposing distinct adjacent entries a and b within the string of digits. To illustrate: the identification numbers 81504216 and 81504261 have the same check digit 9 when our example weights are used. (The problem occurs b| = 5.) More sophisticated methods are available, with larger moduli when Ja - and different weights, that would prevent this possible error. PROBLEMS 4.3 1. Use the binary exponentiation algorithm to compute both 1953 (mod 503) and 14147 (mod 1537). 2. Prove the following statements: (a) For any integer a, the units digit of a? is 0, 1, 4, 5, 6, or 9. (b) Any one of the integers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 can occur as the units digit of a. (c) For any integer a, the units digit of a is 0, 1, 5, or 6. (d) The units digit of a triangular number is 0, 1, 3, 5, 6, or 8. 3. Find the last two digits of the number 9. [Hint: 9° = 9 (mod 10); hence, 99° = 9°+10k, notice that 9° = 89 (mod100).] 4. Without performing the divisions, determine whether the integers 176521221 and 149235678 are divisible by 9 or 11. 3. (a) Obtain the following generalization of Theorem 4.6: If the integer N is represented in the base b by N = amb" + ...+azb? + a,b+ ao 0 s ak <b- 1 then b – 1|N if and only if b- 1| (am ++a2 + a1 + ao).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,