Safe Haskell | None |
---|---|
Language | Haskell2010 |
We need to find (small) integer substitution such that the denominator in our formula never vanishes.
That is, for n
we need to find n
integers a[i]
such that:
0 /= a[i] - a[j]
0 /= a[i] - (a[j] + a[k])
0 /= (a[i] + a[j]) - (a[k] + a[l])