Theorem: If w, x, y, z are integers where w divides x and y divides z, then wy divides xz. Proof. Let w, x, y, z be integers such that w divides x and y divides z. Since w divides x, then x = kw and w # 0. Since y divides z, then z = jy and y#0. Plug in the expression kw for x and jy for z in the expression xz to get x2 = (kw) (jy) = (kj) (wy) Since k and j are integers, then kj is also an integer. Since w #0 and y # 0, then wy # 0. Since xz equals wy times an integer and wy #0, then wy divides xz. ■ *There is something wrong with the proof, so please do not tell me that the proof is actually correct. Thank you.

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
100%

Hello. Please answer the attached Discrete Mathematics question correctly and follow all directions. Correctly explain where the proof uses invalid reasoning or skips essential steps.

*If you would like for me to give you a thumbs up then just answer the question correctly by yourself and do not copy from outside sources. Thank you.

For each "proof" of the theorem, explain where the proof uses invalid reasoning or skips
essential steps.
Theorem: If w, x, y, z are integers where w divides x and y divides z, then wy divides xz.
Proof.
Let w, x, y, z be integers such that w divides x and y divides z. Since w divides x, then x = kw and w # 0. Since y divides z, then z = jy
and y#0. Plug in the expression kw for x and jy for z in the expression xz to get
(kw)(jy) = (kj)(wy)
XZ =
Since k and j are integers, then kj is also an integer. Since w #0 and y # 0, then wy # 0. Since xz equals wy times an integer and wy
#0, then wy divides xz. ■
*There is something wrong with the proof, so please do not tell me that the proof is actually
correct. Thank you.
Transcribed Image Text:For each "proof" of the theorem, explain where the proof uses invalid reasoning or skips essential steps. Theorem: If w, x, y, z are integers where w divides x and y divides z, then wy divides xz. Proof. Let w, x, y, z be integers such that w divides x and y divides z. Since w divides x, then x = kw and w # 0. Since y divides z, then z = jy and y#0. Plug in the expression kw for x and jy for z in the expression xz to get (kw)(jy) = (kj)(wy) XZ = Since k and j are integers, then kj is also an integer. Since w #0 and y # 0, then wy # 0. Since xz equals wy times an integer and wy #0, then wy divides xz. ■ *There is something wrong with the proof, so please do not tell me that the proof is actually correct. Thank you.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
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,