Suppose n in Z. If 3 does not divide n2, then 3 does not divide n.
Added by Terri G.
Step 1
This means that n = 3k for some integer k. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Satyam Gupta and 54 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
Let n is any positive integer if 3 divides (n-2) then 3 divides (n^2+n)
Satyam G.
Prove or disprove: Let n be an integer: If 3 divides n2 , then 3 divides
Adi S.
For n a nonnegative integer, either n ≡ 0 mod 3 or n ≡ 1 mod 3 or n ≡ 2 mod 3. In each case, fill out the following table with the canonical representatives modulo 3 of the expressions given: n mod 3 | n^3 mod 3 | 2n mod 3 | n^3 + 2n mod 3 0 | | | 1 | | | 2 | | | From this, we can conclude: A. Since n^3 + 2n ≡ 0 mod 3 for all n, we conclude that 3 divides n^3 + 2n for any nonnegative integer n. B. Since n^3 + 2n ≢ 0 mod 3 for all n, we conclude that 3 does not necessarily divide n^3 + 2n for all nonnegative integers n.
Vincenzo Z.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD