workwithisad

let p be a positive prime and q is positive integer. find gcd(p,q) under each of the following assumption:

a. 1<=q<p

b. p/q

c. q = mp+r with 0< r < pand with m and r in Z.

d. q is prime and q cannot be p

If p > 5 is prime, and p is divided by 10 (that is, p = 10q + r, with 0 ≤ r < 10), show that the only possible remainders are r = 1,3,7,9.

Can anyone answer these questions