Implement the anomaly free solution of arXiv:1905.13729 [PRL]:
Obtain a numpy array z of N integers which satisfy the Diophantine equations
>>> z.sum()
0
>>> (z**3).sum()
0
The input is two lists l and k with any (N-3)/2 and (N-1)/2 integers for N odd, or N/2-1 and N/2-1 for N even (N>4).
The function is implemented below under the name: free(l,k)
$ pip install anomalies
>>> from anomalies import anomaly
>>> anomaly.free([-1,1],[4,-2])
array([ 3, 3, 3, -12, -12, 15])
>>> anomaly.free.gcd
3
>>> anomaly.free.simplified
array([ 1, 1, 1, -4, -4, 5])
A sample for 4<N<13 with integers until |30| with ~400 000 chiral solutions can be download from: 
[JSON]
FAQs
Anomaly cancellation
We found that anomalies demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
The Socket Research Team breaks down a malicious wrapper package that uses obfuscation to harvest credentials and exfiltrate sensitive data.
Research
Security News
Attackers used a malicious npm package typosquatting a popular ESLint plugin to steal sensitive data, execute commands, and exploit developer systems.
Security News
The Ultralytics' PyPI Package was compromised four times in one weekend through GitHub Actions cache poisoning and failure to rotate previously compromised API tokens.