SOLUTION: Prove that n>1 is prime iff gcd(a,n)=1 or n|a for all a an element of integers

Algebra ->  Problems-with-consecutive-odd-even-integers -> SOLUTION: Prove that n>1 is prime iff gcd(a,n)=1 or n|a for all a an element of integers      Log On


   



Question 729385: Prove that n>1 is prime iff gcd(a,n)=1 or n|a for all a an element of integers
Answer by lynnlo(4176) About Me  (Show Source):