Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
22. Evaluation of proofs See the instructions for Exercise (19) on page 100 from Section 3.1. (a) Proposition. For all integers a and b, if (a + 2b) = 0 (mod 3), then (2a + b) = 0 (mod 3). Proof. We assume a, b e Z and (a + 2b) = 0 (mod 3). This means that 3 divides a + 2b and, hence, there exists an integer m such that a +2b = 3m. Hence, a = exists an integer x such that 2a + b = 3x. Hence, 3m – 2b. For (2a +b) = 0 (mod 3), there 2(Зт — 2b) + b %3D 3x бт — 3b — 3х 3(2m – b) = 3xr 2m — b 3D х. Since (2m – b) is an integer, this proves that 3 divides (2a + b) and hence, (2a + b) = 0 (mod 3). (b) Proposition. For each integer m, 5 divides (m –- m). Proof. Let m e Z. We will prove that 5 divides (m³ – m) by proving that (m – m) = 0 (mod 5). We will use cases. For the first case, if m = 0 (mod 5), then m = 0 (mod 5) and, hence, (m³ – m) = 0 (mod 5). For the second case, if m = 1 (mod 5), then m = 1 (mod 5) and, hence, (m – m) = (1 – 1) (mod 5), which means that (m – m) = 0 (mod 5). For the third case, if m = 2 (mod 5), then m = 32 (mod 5) and, hence, (m – m) = (32 – 2) (mod 5), which means that (m3 – m) 0 (mod 5). 000

22. Evaluation of proofs See the instructions for Exercise (19) on page 100 from Section 3.1. (a) Proposition. For all integers a and b, if (a + 2b) = 0 (mod 3), then (2a + b) = 0 (mod 3). Proof. We assume a, b e Z and (a + 2b) = 0 (mod 3). This means that 3 divides a + 2b and, hence, there exists an integer m such that a +2b = 3m. Hence, a = exists an integer x such that 2a + b = 3x. Hence, 3m – 2b. For (2a +b) = 0 (mod 3), there 2(Зт — 2b) + b %3D 3x бт — 3b — 3х 3(2m – b) = 3xr 2m — b 3D х. Since (2m – b) is an integer, this proves that 3 divides (2a + b) and hence, (2a + b) = 0 (mod 3). (b) Proposition. For each integer m, 5 divides (m –- m). Proof. Let m e Z. We will prove that 5 divides (m³ – m) by proving that (m – m) = 0 (mod 5). We will use cases. For the first case, if m = 0 (mod 5), then m = 0 (mod 5) and, hence, (m³ – m) = 0 (mod 5). For the second case, if m = 1 (mod 5), then m = 1 (mod 5) and, hence, (m – m) = (1 – 1) (mod 5), which means that (m – m) = 0 (mod 5). For the third case, if m = 2 (mod 5), then m = 32 (mod 5) and, hence, (m – m) = (32 – 2) (mod 5), which means that (m3 – m) 0 (mod 5). 000

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question
22. Evaluation of proofs See the instructions for Exercise (19) on page 100 from Section 3.1. (a) Proposition. For all integers a and b, if (a + 2b) = 0 (mod 3), then (2а + b) %3D 0 (mod 3). Proof. We assume a, b e Z and (a + 2b) = 0 (mod 3). This means that 3 divides a + 2b and, hence, there exists an integer m such that a + 2b — Зт. Hence, a %3 3m – 2b. For (2a +b) = 0 (mod 3), there exists an integer x such that 2a + b = 3x. Hence, 2(Зт — 2b) + b %3 3x бт — 3Ь — 3х 3(2m – b) = 3x 2m — b 3 х. Since (2m – b) is an integer, this proves that 3 divides (2a + b) and hence, (2a + b) = 0 (mod 3). (b) Proposition. For each integer m, 5 divides (m³ – m). Proof. Let m e Z. We will prove that 5 divides (m³ – m) by proving that (m – m) = 0 (mod 5). We will use cases. For the first case, if m = 0 (mod 5), then m³ = 0 (mod 5) and, hence, (m³ – m) = 0 (mod 5). For the second case, if m = 1 (mod 5), then m³ = 1 (mod 5) and, hence, (m³ – m) = (1 – 1) (mod 5), which means that (m³ – m) 0 (mod 5). For the third case, if m = 2 (mod 5), then m³ = 32 (mod 5) and, hence, (m³ – m) = (32 – 2) (mod 5), which means that (m³ – m) 0 (mod 5). BY NC SA
Transcribed Image Text:22. Evaluation of proofs See the instructions for Exercise (19) on page 100 from Section 3.1. (a) Proposition. For all integers a and b, if (a + 2b) = 0 (mod 3), then (2а + b) %3D 0 (mod 3). Proof. We assume a, b e Z and (a + 2b) = 0 (mod 3). This means that 3 divides a + 2b and, hence, there exists an integer m such that a + 2b — Зт. Hence, a %3 3m – 2b. For (2a +b) = 0 (mod 3), there exists an integer x such that 2a + b = 3x. Hence, 2(Зт — 2b) + b %3 3x бт — 3Ь — 3х 3(2m – b) = 3x 2m — b 3 х. Since (2m – b) is an integer, this proves that 3 divides (2a + b) and hence, (2a + b) = 0 (mod 3). (b) Proposition. For each integer m, 5 divides (m³ – m). Proof. Let m e Z. We will prove that 5 divides (m³ – m) by proving that (m – m) = 0 (mod 5). We will use cases. For the first case, if m = 0 (mod 5), then m³ = 0 (mod 5) and, hence, (m³ – m) = 0 (mod 5). For the second case, if m = 1 (mod 5), then m³ = 1 (mod 5) and, hence, (m³ – m) = (1 – 1) (mod 5), which means that (m³ – m) 0 (mod 5). For the third case, if m = 2 (mod 5), then m³ = 32 (mod 5) and, hence, (m³ – m) = (32 – 2) (mod 5), which means that (m³ – m) 0 (mod 5). BY NC SA
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps with 7 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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,
SEE MORE TEXTBOOKS