find the number of integer solutions of 3x=1(mod15)
Answers
Answered by
16
Given:
3x = 1 (mod 15)
To find:
The number of integer solutions of 3x = 1( mod 15)
Solution:
The congruence ax = b mod m is solvable if the greatest common divisor (GCD) (d) of a and m is a divisor of b.
if d ∣ b, where d = g.c.d. (a, m)
Since, in the given problem, the g.c.d. (3, 15) = 3 does not divide 5.
Hence the congruence does not have any solution.
Answered by
1
Answer:
done with explanation xtsitso6doydo6do6
Attachments:
Similar questions