Posted by Math_stuck on Tuesday, February 26, 2008 at 9:49am.
Prove or disprove the following: If the integer n is divisible by 3 then n^2 is divisible by 3. Use the direct method of proof as outlined in the notes.

direct methodMath  drwls, Tuesday, February 26, 2008 at 10:21am
If n is divisible by 3, it can be written 3a, where a is an integer.
n^2 = 9 a^2, where a^2 is also an integer, is also divisible by three, since 9 = 3 x 3.
I don't have your notes so have no idea what kind of proof they expect.
Answer This Question
Related Questions
 Discrete Math  Use mathematical induction to prove the truth of each of the ...
 maths  can you answer this question: prove that a number 10^(3n+1), where n is ...
 Math  Use mathematical induction to prove that 5^(n)  1 is divisible by four ...
 Discrete Math  1. Assume that n is a positive integer. Use the proof by ...
 Math  The question is this: You know that a number is divisible by 6 if it is ...
 IB HL Math  I need to that if there is better way to prove the following: I am ...
 Math PLEASE HELP!!!  Which of the following is false? a. A number that is ...
 Discrete Math  Use mathematical induction to prove the truth of each of the ...
 math  can you answer this question in a different and more logical way than ...
 Math  Divisibility and Factors  If c and d are integers, d is divisible by 30...
More Related Questions