Metadata-Version: 2.4
Name: twosquares
Version: 0.0.7
Summary: A package for very efficiently decomposing a number n into all possible x**2 + y**2 = n solutions.
Author-email: Ryan Heard <ryanwheard@gmail.com>
License: MIT
Project-URL: Repository, https://github.com/rheard/twosquares
Keywords: math
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: Programming Language :: Python :: 3.12
Classifier: Programming Language :: Python :: 3.13
Classifier: Programming Language :: Python :: 3.14
Classifier: Programming Language :: Python :: Implementation :: CPython
Requires-Python: >=3.9
Description-Content-Type: text/markdown
License-File: LICENSE
Requires-Dist: sympy<=1.12.1
Requires-Dist: quadint>=0.0.9
Dynamic: license
Dynamic: license-file

# twosquares

**Deprecated:** `twosquares` has been merged into the `quadint` project as `quadint.sums`.

This package is no longer the recommended way to decompose numbers into sums of two squares. New code should install and import from `quadint` instead:

```bash
python -m pip install quadint
```

```python
from quadint.sums import decompose_prime, decompose_number

print(decompose_prime(19889))
# (17, 140)

print(decompose_number(19890))
# {(69, 123), (57, 129), (3, 141), (87, 111)}
```

## Notes

An explanation of how this package was originally derived can still be found [here](https://github.com/rheard/quadint/tree/main/quadint/sums).
