Document Type
Technical Report
Publication Date
1-1-1989
Technical Report Number
PCS-TR89-140
Abstract
We study the worst-case behavior of three iterative algorithms- Eisenstein's algorithm, Lebesgue's algorithm, and the "ordinary" Jacobi symbol algorithm - for computing the Jacobi symbol. Each algorithm is similar in format to the Euclidean algorithm for computing gcd (u,v).
Dartmouth Digital Commons Citation
Shallit, Jeffrey, "On the Worst Case of Three Algorithms for Computing the Jacobi Symbol" (1989). Computer Science Technical Report PCS-TR89-140. https://digitalcommons.dartmouth.edu/cs_tr/42