<s>[INST] Here is an assigned problem:

For any positive integer $n$, let $g(n)$ be the number of pairs of integers $(a,b)$ with $0\leq a<b$ such that the greatest common divisor of $a$ and $b$ is $1$ (i.e. $\gcd(a,b)=1$). Furthermore, let $f(n)$ be the number of positive integers less than or equal to $n$ that have exactly two distinct prime factors. Compute $\frac{f(100)}{g(100)}$.[/INST]