Let a and b be relatively prime positive integers. Show that a(b) + b(a) = 1(mod ab).

Q: x² - 2x = 8(mod19) X= (mod19)

A:

Q: Show that if k is a positive integer, then (15k+4)/(10k+3) is in lowest terms.

A: We use the concept of Ring theory that a fraction is in lowest form if the gcd of numerator and…

Q: Suppose that a and b are integers with a = 11(mod 19) and b = 3(mod 19). Find the integer c such…

A:

Q: (a) Prove that 318 = q (mod 19).

A:

Q: 10 Solve 3Y=2 (mod 7) 8 Salutions exist or show that

A: We have to solve given problem:

Q: Prove that the set of numbers Q(√2) = { a+b√2: a, b = Q} is a field.

A:

Q: b) Find an integer x such that 37x = 1 (mod 101).

A:

Q: Assume that an+1 √12+ an with ao = √12. Use induction to show tha an < 4

A:

Q: Show that 2x = 1 (Mod 10) has NO solutions. Show work

A:

Q: Disprove this statement by giving a counterexample. For all nonzero real numbers, a, b, c, and d,…

A: Here a,b,c,d all are non zero real .So (a/b) and (c/d) are defined.  Let,  a = 1 , b = 2 , c = 3 , d…

Q: Prove that for n 2 2, F²r-1-F²n= Fn-1 Fn-2 Where F, denotes the nth Fibonacci number.

A: Facts:F0=0F1=1F2=1F3=2F4= F3+F2=2+1=3etc.Fn = Fn-1 +Fn-2