Electronic Proceedings of the Twentyfifth Annual International Conference on Technology in Collegiate MathematicsBoston, Massachusetts, March 2124, 2013Paper C016
This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twentyfifth Annual International Conference on Technology in Collegiate Mathematics, ISBN10: 0133866726, Copyright (C) 2014 by Pearson Education, Inc. 
Faster Square Roots Modulo a Prime on the TI89 
Click to access this paper:

We consider efficient methods of solving the congruence x
^{2} = a (mod p) where p is an odd prime on the TI89. 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 TI89.
Keyword(s): number theory, TI89