Electronic Proceedings of the Twenty-fifth Annual International Conference on Technology in Collegiate Mathematics

Boston, Massachusetts, March 21-24, 2013

Paper C016

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-fifth Annual International Conference on Technology in Collegiate Mathematics, ISBN-10: 0133866726, Copyright (C) 2014 by Pearson Education, Inc.


Faster Square Roots Modulo a Prime on the TI-89

Joseph Fadyn


Southern Polytechnic State University

list of all papers by this author

Click to access this paper: paper.pdf

ABSTRACT

We consider efficient methods of solving the congruence x2 = a (mod p) where p is an odd prime on the TI-89. We look at several deterministic special cases involving the prime p and then compare the efficiency of five different probabilistic algorithms when special cases don't apply on the TI-89.

Keyword(s): number theory, TI-89