Every 2-digit number having greatest common divisor 6 with another 2-digit number must itself be divisible by 6, because any common divisor of the two numbers divides their gcd.
Hence write the numbers as m=6a and n=6b with a,b∈N.
Because m and n are 2-digit numbers,
10≤m=6a≤99and10≤n=6b≤99
which gives
610≤a≤699,610≤b≤699
or, after taking integer values,
2≤a≤16,2≤b≤16.
The condition gcd(m,n)=6 becomes gcd(6a,6b)=6, i.e.
gcd(a,b)=1.
Thus we must count ordered pairs (a,b) such that
2≤a<b≤16andgcd(a,b)=1.
Call such pairs “coprime pairs”.
List each value of a and count suitable b values individually:
a=2a=3a=4a=5a=6a=7a=8a=9a=10a=11a=12a=13a=14a=15:b=3,5,7,9,11,13,15:b=4,5,7,8,10,11,13,14,16:b=5,7,9,11,13,15:b=6,7,8,9,11,12,13,14,16:b=7,11,13:b=8,9,10,11,12,13,15,16:b=9,11,13,15:b=10,11,13,14,16:b=11,13:b=12,13,14,15,16:b=13:b=14,15,16:b=15:b=16⇒7⇒9⇒6⇒9⇒3⇒8⇒4⇒5⇒2⇒5⇒1⇒3⇒1⇒1
Adding these counts:
7+9+6+9+3+8+4+5+2+5+1+3+1+1=64.
Therefore there are 64 ordered pairs (a,b), and hence 64 ordered pairs (m,n) with m<n and gcd(m,n)=6 where both m and n are 2-digit numbers.
Final answer: 64.