Question

For all integers a and b, if 3 divides (a^2+b^2) then 3 divides a and 3...

For all integers a and b, if 3 divides (a^2+b^2) then 3 divides a and 3 divides b. (Use Division algorithm and congruence).


Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let a, b, and c be integers such that a divides b and a divides c....
Let a, b, and c be integers such that a divides b and a divides c. 1. State formally what it means for a divides c using the definition of divides 2. Prove, using the definition, that a divides bc.
Prove that if 4 does not divides n, then 8 does not divides n^2. * Use...
Prove that if 4 does not divides n, then 8 does not divides n^2. * Use the division algorithm and proof by cases with r = 1,2 and 3
a,b,c are positive integers if a divides a + b and b divides b+c prove a...
a,b,c are positive integers if a divides a + b and b divides b+c prove a divides a+c
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove...
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove that n91 ≡ n7 (mod 91) for all integers n. Is n91 ≡ n (mod 91) for all integers n ?
Let A be the set of all integers, and let R be the relation "m divides...
Let A be the set of all integers, and let R be the relation "m divides n." Determine whether or not the given relation R, on the set A, is reflexive, symmetric, antisymmetric, or transitive.
List all the ordered pairs in the relation R = {(a, b) | b divides a}...
List all the ordered pairs in the relation R = {(a, b) | b divides a} on the set {1, 2, 3, 4, 5, 6}
Let a, b be an element of the set of integers. Proof by contradiction: If 4...
Let a, b be an element of the set of integers. Proof by contradiction: If 4 divides (a^2 - 3b^2), then a or b is even
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
prove that if n is composite then there are integers a and b such that n...
prove that if n is composite then there are integers a and b such that n divides ab, but n does not divide either a or b.
Let a be prime and b be a positive integer. Prove/disprove, that if a divides b^2...
Let a be prime and b be a positive integer. Prove/disprove, that if a divides b^2 then a divides b.