THE NUMBER OF STEPS IN THE EUCLIDEAN ALGORITHM OVER COMPLEX QUADRATIC FIELDS

被引:1
|
作者
KNOPFMACHER, A
KNOPFMACHER, J
机构
[1] UNIV WITWATERSRAND,DEPT COMPUTAT & APPL MATH,WITS 2050,SOUTH AFRICA
[2] UNIV WITWATERSRAND,DEPT MATH,WITS 2050,SOUTH AFRICA
来源
BIT | 1991年 / 31卷 / 02期
关键词
AMS (1980/85) Classification Numbers: 11R11; 13F07;
D O I
10.1007/BF01931288
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We obtain upper and lower bounds for the number of divisions in the Euclidean algorithm, for almost all pairs of algebraic integers lying in the complex quadratic fields 2 unroofed-radical-sign (-m), for m = 1, 2, 3, 7 and 11. In addition, the order of the average length for almost all such pairs is deduced.
引用
收藏
页码:286 / 292
页数:7
相关论文
共 50 条