Solution 3b1595fc-2cb6-445b-9245-5e0c7fd380dd

Points: 1 pt

We can use the Euclidean algorithm.
\[
\gcd(199,100)=\gcd(100,-1),
\]
where we use a negative remainder which nonetheless satisfies the base case of the Euclidean algorithm.

Final answer:
\text{199 and 100 are coprime}