Math, asked by romanamalik42, 3 months ago

We define a set of all positive integers less than n and relative prime to n for

Answers

Answered by Anonymous
0

Answer:

Hint:

You have shown for each a coprime to n there is an x so that ax=1 mod n.

Towards a contradiction, assume gcd(x,n)=d≠1. Then any linear combination rx+sn must be divisible by d... What happens if we take r=a? Do you see how to finish the proof from here?

I hope this helps ^_^

please mark me as brainlist

# ItzYourQueen01

Answered by Ankitjayant23
0

Answer:

bhi to kuch nhi hai ki is not a ✋ HH

Similar questions