Question

prove (a-b)modn = amodn-bmodn

prove (a-b)modn = amodn-bmodn

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
(i)Prove that if ∀a∈A ∃b∈B s.t. a≤b, then supA≤supB. (ii)Prove that if ∀a∈A ∃b∈B s.t. a≥b,...
(i)Prove that if ∀a∈A ∃b∈B s.t. a≤b, then supA≤supB. (ii)Prove that if ∀a∈A ∃b∈B s.t. a≥b, then infB≤infA
Prove: Let a and b be integers. Prove that integers a and b are both even...
Prove: Let a and b be integers. Prove that integers a and b are both even or odd if and only if 2/(a-b)
a) Prove that (0,1)~(0,1] b) Prove that (0,1)~[0,1]
a) Prove that (0,1)~(0,1] b) Prove that (0,1)~[0,1]
8. Let a, b be integers. (a) Prove or disprove: a|b ⇒ a ≤ b. (b)...
8. Let a, b be integers. (a) Prove or disprove: a|b ⇒ a ≤ b. (b) Find a condition on a and/or b such that a|b ⇒ a ≤ b. Prove your assertion! (c) Prove that if a, b are not both zero, and c is a common divisor of a, b, then c ≤ gcd(a, b).
Prove the following: • A'∩(A∪B)=A'∩B • A'∪(A∩B) = A'∪B • if A ⊆ B then B...
Prove the following: • A'∩(A∪B)=A'∩B • A'∪(A∩B) = A'∪B • if A ⊆ B then B ⊆ A • A−(B−A)=A
Prove the following using Field Axioms of Real Numbers. prove (b^(−1))^−1=b
Prove the following using Field Axioms of Real Numbers. prove (b^(−1))^−1=b
Prove that for all sets A, B, C, A ∩ (B ∩ C) = (A ∩...
Prove that for all sets A, B, C, A ∩ (B ∩ C) = (A ∩ B) ∩ C Prove that for all sets A, B, A \ (A \ B) = A ∩ B.
prove that m∗ (A ∪ B) ≤ m∗ (A) + m∗ (B) for any A, B...
prove that m∗ (A ∪ B) ≤ m∗ (A) + m∗ (B) for any A, B ⊂ R. For this problem, use the definition of m∗ to formally prove that this is true?
Prove that if Ax=b and Ax=c are consistent, then so is Ax=b+c. Create and prove a...
Prove that if Ax=b and Ax=c are consistent, then so is Ax=b+c. Create and prove a generalization of this result.
Let A and B be sets. Prove that (A∪B)\(A∩B) = (A\B)∪(B\A)
Let A and B be sets. Prove that (A∪B)\(A∩B) = (A\B)∪(B\A)