6. Use the method of contrapositive to prove the following. Suppose n ? Z. If 3 \not\mid n^2, then 3 \not\mid n. Note: (3 \not\mid n^2 means 3 does not divide $n^2$ and 3 \not\mid n means 3 does not divide n)
Added by Jose Francisco P.
Close
Step 1
Step 1: Assume that 3 does not divide n. Show more…
Show all steps
Your feedback will help us improve your experience
Manav Bhatia and 83 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove each of the following statements by proving its contrapositive. Begin by writing what is given and what is to be proved. If $n^{2}$ is not a multiple of 3, then $n$ is not a multiple of 3 .
Inequalities and Geometry
Inverses and Contrapositives
Prove or disprove: Let n be an integer: If 3 divides n2 , then 3 divides
Adi S.
Let n be an integer. Show that if n^2 is a multiple of 3, then n must also be a multiple of 3. (a) Prove by contrapositive. (b) Prove by contradiction.
Piyush Kumar G.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD