direct method-Math

posted by .

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 method-Math -

    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.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Discrete Math

    1. Assume that n is a positive integer. Use the proof by contradiction method to prove: If 7n + 4 is an even integer then n is an even integer. 2. Prove: n is an even integer iff 7n + 4 is an even integer. (Note this is an if and only …
  2. IB HL Math

    I need to that if there is better way to prove the following: I am trying to prove that x r = k and k is a multiple of x only when x is prime. I said that if x is non-prime, then: Let a = 6 Let r = 4 6! (6 – 4)! 4! = 3(2) x 5 x 4! …
  3. Math

    The question is this: You know that a number is divisible by 6 if it is divisible by both 3 and 2. So why isn't a number divisible by 8 if it is divisible by both 4 and 2?
  4. maths

    can you answer this question: prove that a number 10^(3n+1), where n is a positive integer, cannot be represented as the sum of two cubes of positive integers. with out using this method at all ................................. We …
  5. Math

    Use mathematical induction to prove that 5^(n) - 1 is divisible by four for all natural numbers n. Hint: if a number is divisible by 4, then it has a factor of 4. also, -1 = -5 +4 This is a take home test so I don't want the answer …
  6. Discrete Math

    Use mathematical induction to prove the truth of each of the following assertions for all n ≥1. n³ + 5n is divisible by 6 I really do not understand this to much. This is what I have so far: n = 1, 1³ - 5(1) = 6, which is divisible …
  7. Discrete Math

    Use mathematical induction to prove the truth of each of the following assertions for all n ≥1. 5^2n – 2^5n is divisible by 7 If n = 1, then 5^2(1) - 2^5(1) = -7, which is divisible by 7. For the inductive case, assume k ≥ …
  8. Math PLEASE HELP!!!

    Which of the following is false? a. A number that is divisible by 3 and 20 is divisible by 60. b. A number that is divisible by 4 and 15 is divisible by 60. c. A number that is divisible by 5 and 12 is divisible by 60. d. A number
  9. number theory

    The values A,B,C, and [(A/B)+C], are all integers which are divisible by 3. Then, which of the following statements must be true: A is divisible by 9 B is divisible by 9 C is divisible by 9 A and B are both divisible by 9 A,B,and C …
  10. maths

    The values A,B,C, and [(A/B)+C], are all integers which are divisible by 3. Then, which of the following statements must be true: A is divisible by 9 B is divisible by 9 C is divisible by 9 A and B are both divisible by 9 A,B,and C …

More Similar Questions