I'm trying to solve an exercise which defines:
The set A = {2,3,4,5,6}
The Relation R on A where R = {(a,b)| gcd(a,b)= 1 ∧ a ≠ b}
The objective of the task is to determine the set R.
I believe I do this by finding the each occurence in the AxA subset where the gcd of each entry equals 1 and at the same time where a and b not equal
Am I on the right path so far - and if so - what would be the most efficient way to determine R from here on?