Proposition 8. Let m be any integer. If 5|(7m), then 5|m. Special directions: You can not use your previous knowledge about prime factorization or prime numbers beyond the definition (primes only have two positive divisors). Note: This is a simplified version of "If p is prime and p|(ab), then p|a or p|6." This theorem is used to prove that integers have a prime factorization, which is why we are not using prime factorization

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

please send step by step handwritten proof of Q8

 

Proposition 8. Let m be any integer. If 5|(7m), then 5|m.
Special directions: You can not use your previous knowledge about prime factorization or prime
numbers beyond the definition (primes only have two positive divisors).
Note: This is a simplified version of "If p is prime and p|(ab), then p|a or pl6." This theorem is used
to prove that integers have a prime factorization, which is why we are not using prime factorization
to prove this proposition.
Hint: There are going to be several ways to prove this. One way is to find integers x and
make 5x + 7y
theorem mentioned in the note above. A third is by cases and using the division algorithm, but
this may not be the easiest.
that
= 1 and use this equation in your proof. Another way is to look at a proof of the
Proof.
Transcribed Image Text:Proposition 8. Let m be any integer. If 5|(7m), then 5|m. Special directions: You can not use your previous knowledge about prime factorization or prime numbers beyond the definition (primes only have two positive divisors). Note: This is a simplified version of "If p is prime and p|(ab), then p|a or pl6." This theorem is used to prove that integers have a prime factorization, which is why we are not using prime factorization to prove this proposition. Hint: There are going to be several ways to prove this. One way is to find integers x and make 5x + 7y theorem mentioned in the note above. A third is by cases and using the division algorithm, but this may not be the easiest. that = 1 and use this equation in your proof. Another way is to look at a proof of the Proof.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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,