Review Suggested Edit

You can't approve or reject suggested edits because you haven't yet earned the Edit Posts ability.

### SageMath, 58 Byte
```
m=lambda a,b,c:min(gcd(a,b),gcd(a,c),gcd(b,c))<2|(gcd(gcd(b,c),a)>1)
```
~~Returns `False` for Borromean coprimes and `True` for all other numbers. Us it like this `m(6,10,15)`.~~
Using `min` to get the lowest `gcd` of each pair. It is shorter than comparing each to `1` or `2`. Sadly, SageMath `gcd()` doesn't support more than 2 arguments, unlike regular python, so i had to use nest 2 `gcd` calls to test if the total gcd is 1.
There is probably a much shorter solution.

### SageMath, 58 Byte
```
m=lambda a,b,c:min(gcd(a,b),gcd(a,c),gcd(b,c))<2|(gcd(gcd(b,c),a)>1)
```
Returns `False` for Borromean coprimes and `True` for all other numbers. Use it like this `m(6,10,15)`.
Using `min` to get the lowest `gcd` of each pair. It is shorter than comparing each to `1` or `2`. Sadly, SageMath `gcd()` doesn't support more than 2 arguments, unlike regular python, so i had to nest 2 `gcd` calls to test if the total gcd is 1.
There is probably a much shorter solution.