Solve the congruence 5x≡1(mod12)
Hint: 0≤x≤11
"ax \u2261 b(mod \\space m)"
Step 1
GCD of a and m
GCD of 5 & 12
since 5 is a prime , so the GCD is 1
step 2
1/1=1
So, solutions exists
step 3
"5x \u22611+12n(mod \\space 12)"
where n is a natural number
finding n such that (1+12n) is divided by 5
if n= 1
"5x \u22611+12(mod \\space 12)\\\\\n\n5x \u226113(mod \\space 12)"
for n=2
"5x \u22611+12*2(mod \\space 12)\\\\\n\n5x \u226125(mod \\space 12)\\\\\n\nx \u22615(mod \\space 12)"
So, the solution of n between 0 and 11 will be 5. In general form it will be x = 5+12m
Comments
Leave a comment