Answer Happy • n Let a, b, n be integers with n > 1. Show that ax = b mod n has a solution if and only if (a, n) divides b.

Page 1 of 1

n Let a, b, n be integers with n > 1. Show that ax = b mod n has a solution if and only if (a, n) divides b.

Posted: Thu May 12, 2022 3:47 pm

by answerhappygod

: N Let A B N Be Integers With N 1 Show That Ax B Mod N Has A Solution If And Only If A N Divides B 1 (36.11 KiB) Viewed 43 times

n Let a, b, n be integers with n > 1. Show that ax = b mod n has a solution if and only if (a, n) divides b.