[I have helped with questions a. and b.].
a.
But, for all integers , the number is even and is odd. Since an odd number cannot equal an even number, there is no integer solution for this equation.
b.
The elements of the ring of integers modulo 22 () are [m], where .
Let us suppose that [m] is a unit element of . Then, m>0 and there is an [n] such that,
, and 21 is the largest m such that [m] is in .
Since all of the above numbers are odd, neither of m,n can be even. Also, since they are all 1 more than a multiple of 22, and therefore of 11, none of m,n is divisible by 11.
So, for all odd m less than 22, and other than 11, [m] has an inverse, and therefore, is a unit.
The set of units of is .
Let us suppose that [m] is a zero divisor of . Then, m>0 and there is an [n] such that,
, and 21 is the largest m such that [m] is in .
Since all of the above numbers are divisible by 11, atleast one of m,n must be divisible by 11. So, atleast one of m,n must be 11, the only that is divisible by 11.
The set of zero divisors of is .
B3 For this question only let a := C and b := a. Solve 3x + a = 1 (mod b). b. What are the sets of units and zero divisors in the ring of integers modulo ab? (Specify at least the smaller set using set-roster notation.) c. Find a formula for the quotient and the exact remainder when 39 is divided by 5.
I need help with the following Java code Consider a class Fraction of fractions. Each fraction is signed and has a numerator and a denominator that are integers. Your class should be able to add, subtract, multiply, and divide two fractions. These methods should have a fraction as a parameter and should return the result of the operation as a fraction. The class should also be able to find the reciprocal of a fraction, compare two fractions, decide whether two...