Is there any algorithm to find all possible solutions for this equation:

> 
> x1² + x2² + ... + xn² = 1 
> 
> 
> 

Where xi > 0 and n >= 2

To limit solutions we can fix decimal point of x to 1.
For instance:

if n = 2, find all tuples (x1, x2) that satisfies x1² + x2² = 1
The return of this function would be something like (fixing decimal points to 1):

```
[
    [0.1, 1],
    [0.2, 1],
    [0.3, 0.9],
    [0.4, 0.9],
    [0.5, 0.9],
    [0.6, 0.8],
    [0.7, 0.7],
    [0.8, 0.6],
    [0.9, 0.4],
    [1, 0.1],
    [1, 0.2],
    ...
    [0.4, 0.9]
]

```

For n=2 it's easy, but what I need is to generalize for n >= 2.