Solve the equation 65x ≡ 5 (mod 279) by using the extended Euclidean algorithm.

To find the reciprocal of 65 (mod 279) we must first ensure it exists by finding if they have 1 as their greatest common denominator.

gcd(279,65): 279= 65 ⋅ 4+ 19

from here not sure what to do

hmm any help would be appreciated thanks