We analyze the relation R={(a,b):gcd(a,b)=1,2a=b,a,b∈Z}.
Reflexive?
For reflexivity, we need (a,a)∈R for all a∈Z. This requires gcd(a,a)=1 and 2a=a.
gcd(a,a)=∣a∣, which equals 1 only when a=±1. For a=2: gcd(2,2)=2=1. So (2,2)∈/R.
Therefore, R is NOT reflexive.
Symmetric?
For symmetry, if (a,b)∈R, we need (b,a)∈R. We need gcd(b,a)=1 (same as gcd(a,b)=1, so this holds) AND 2b=a.
Consider (1,2): gcd(1,2)=1 and 2(1)=2=b, so (1,2)∈/R (fails 2a=b).
Consider (2,1): gcd(2,1)=1 and 2(2)=4=1, so (2,1)∈R.
But we need the reverse: (1,2). We showed (1,2)∈/R.
So (2,1)∈R but (1,2)∈/R. Therefore, R is NOT symmetric.
Transitive?
For transitivity, if (a,b)∈R and (b,c)∈R, we need (a,c)∈R.
Consider (3,2): gcd(3,2)=1, 2(3)=6=2. So (3,2)∈R.
Consider (2,3): gcd(2,3)=1, 2(2)=4=3. So (2,3)∈R.
Now check (3,3): gcd(3,3)=3=1. So (3,3)∈/R.
We have (3,2)∈R and (2,3)∈R but (3,3)∈/R. Therefore, R is NOT transitive.
The correct answer is Option 4: neither symmetric nor transitive.