FIND THE ANSWERS

Let f, g, h and n be integers with n > 1. If h = gcd (f,n) and h divides g, then there is an integer t such that ft = g (mod n)?

Answer this question

  • Let f, g, h and n be integers with n > 1. If h = gcd (f,n) and h divides g, then there is an integer t such that ft = g (mod n)?


Answers