I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...
This is a preview. Log in through your library . Abstract In a quadratic number field $\mathbf{Q}(\sqrt D), D$ a squarefree integer, with class number 1, any algebraic integer can be decomposed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback