2010arXiv (Cornell University)Open access

Extended gcd of quadratic integers

Abdelwaheb Miled, Ahmed Ouertani

Open full text 0 citations

Abstract

Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.

Open-access reader

About this research paper

What this paper is about

Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.

Key concepts: Quadratic equation, Mathematics, Arithmetic, Combinatorics, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
Extended gcd of quadratic integers — Research Paper | ScholarLens