algebra proof

[languid prairie]

1. Wait patiently for a helper to come along.
2. Once someone helps you, say thank you and close the thread with:

+close

3. Feel free to nominate the person for helper of the week in #helper-nominations
4. Do not ping the mods, unless someone is breaking the rules.
5. If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[native horizon]

well, first define GCD

what is GCD here?

what does the GCD do?

[steady schooner]

try to use contrapositive and bezout theorem?

[frosty falcon]

Gcd is 1

Gcd is the greatest common divisor of a and p

Because p is prime the Gcd has to be 1

Also it can be written as ax+py

So 1 is smallest positive integer in the form ax+py

Not sure how to write in proof that’s what I’m finding hard to do

[native horizon]

not necessarily