1. Prove that if n is an integer and n is a multiple of 2, then 4n+ 24 is a multiple of 8. 2. Show that if a = b (mod m) and b = c (mod m) where a and b are non-zero integers and m is a positive integer, then a = c (mod m). (Recommended start: write the congruences as statements of divisibility, and divisility as equalities, then go from there).

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
Question
**Learning Target L5 (Core):** *I can correctly structure a careful mathematical proof including all relevant English and mathematical statements.*

**Please remember** the academic integrity policy that you swore to uphold. Proofs can be challenging. Just try your best. If you don’t get it this week, you have many more opportunities!

1. Prove that if \( n \) is an integer and \( n \) is a multiple of 2, then \( 4n + 24 \) is a multiple of 8.

2. Show that if \( a \equiv b \ (\text{mod} \ m) \) and \( b \equiv c \ (\text{mod} \ m) \) where \( a \) and \( b \) are non-zero integers and \( m \) is a positive integer, then \( a \equiv c \ (\text{mod} \ m) \). (Recommended start: write the congruences as statements of divisibility, and divisibility as equalities, then go from there).

You can use our text, videos, notes etc, posted to Discourse. No other outside resources (including humans) are allowed.
Transcribed Image Text:**Learning Target L5 (Core):** *I can correctly structure a careful mathematical proof including all relevant English and mathematical statements.* **Please remember** the academic integrity policy that you swore to uphold. Proofs can be challenging. Just try your best. If you don’t get it this week, you have many more opportunities! 1. Prove that if \( n \) is an integer and \( n \) is a multiple of 2, then \( 4n + 24 \) is a multiple of 8. 2. Show that if \( a \equiv b \ (\text{mod} \ m) \) and \( b \equiv c \ (\text{mod} \ m) \) where \( a \) and \( b \) are non-zero integers and \( m \) is a positive integer, then \( a \equiv c \ (\text{mod} \ m) \). (Recommended start: write the congruences as statements of divisibility, and divisibility as equalities, then go from there). You can use our text, videos, notes etc, posted to Discourse. No other outside resources (including humans) are allowed.
Expert Solution
Step 1: Description

We will prove sub-part 1 by method of contraposition and sub-part 2 as per given recommendation. 

steps

Step by step

Solved in 4 steps with 2 images

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,