let n belongs to N and let a, b belong to Z. prove that a is...

let n belongs to N and let a, b belong to Z. prove that a is congruent to b, mod n, if and only if a and b have the same remainder when divided by n.

Solutions

Expert Solution

Here I'm using division algorithm theorem that is if and b any two integer atleast one is nonzero then by division theorem b=aq+r where r is less than a. also q and r are quotient and remainder. solution is below both if and only if .Thank you.

Colby Messinger answered 1 year ago

Next > < Previous

Related Solutions

b belongs to N. Prove that if {7m, m belong to Z} is not belongs to...

b belongs to N. Prove that if {7m, m belong to Z} is not belongs to {ab, a is integer}, then b =1

Let G be a group,a;b are elements of G and m;n are elements of Z. Prove...

Let G be a group,a;b are elements of G and m;n are elements of Z. Prove (a). (a^m)(a^n)=a^(m+n) (b). (a^m)^n=a^(mn)

Let A = Z and let a, b ∈ A. Prove if the following binary operations...

Let A = Z and let a, b ∈ A. Prove if the following binary operations are (i) commutative, (2) if they are associative and (3) if they have an identity (if the operations has an identity, give the identity or show that the operation has no identity). (a) (3 points) f(a, b) = a + b + 1 (b) (3 points) f(a, b) = a(b + 1) (c) (3 points) f(a, b) = x2 + xy + y2

Let A = {a+b*sqrt14: a,b∈Z}. Prove that A ∩ Q = Z. Explain is set A...

Let A = {a+b*sqrt14: a,b∈Z}. Prove that A ∩ Q = Z. Explain is set A countable?

(A) Let a,b,c∈Z. Prove that if gcd(a,b)=1 and a∣bc, then a∣c. (B) Let p ≥ 2....

(A) Let a,b,c∈Z. Prove that if gcd(a,b)=1 and a∣bc, then a∣c. (B) Let p ≥ 2. Prove that if 2p−1 is prime, then p must also be prime. (Abstract Algebra)

Let G be a group. For each x ∈ G and a,b ∈ Z+ a) prove...

Let G be a group. For each x ∈ G and a,b ∈ Z+ a) prove that xa+b = xaxb b) prove that (xa)-1 = x-a c) establish part a) for arbitrary integers a and b in Z (positive, negative or zero)

Let f : Z × Z → Z be defined by f(n, m) = n −...

Let f : Z × Z → Z be defined by f(n, m) = n − m a. Is this function one to one? Prove your result. b. Is this function onto Z? Prove your result

Suppose A = {(a, b)| a, b ∈ Z} = Z × Z. Let R be...

Suppose A = {(a, b)| a, b ∈ Z} = Z × Z. Let R be the relation define on A where (a, b)R(c, d) means that 2 a + d = b + 2 c. a. Prove that R is an equivalence relation. b. Find the equivalence classes [(−1, 1)] and [(−4, −2)].

Bezout’s Theorem and the Fundamental Theorem of Arithmetic 1. Let a, b, c ∈ Z. Prove...

Bezout’s Theorem and the Fundamental Theorem of Arithmetic 1. Let a, b, c ∈ Z. Prove that c = ma + nb for some m, n ∈ Z if and only if gcd(a, b)|c. 2. Prove that if c|ab and gcd(a, c) = 1, then c|b. 3. Prove that for all a, b ∈ Z not both zero, gcd(a, b) = 1 if and only if a and b have no prime factors in common.

(3) Let m be a positive integer. (a) Prove that Z/mZ is a commutative ring. (b)...

(3) Let m be a positive integer. (a) Prove that Z/mZ is a commutative ring. (b) Prove that if m is composite, then Z/mZ is not a field. (4) Let m be an odd positive integer. Prove that every integer is congruent modulo m to exactly one element in the set of even integers {0, 2, 4, 6, , . . . , 2m− 2}

Subjects