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

Orlando, Florida, March 22-25, 2012

Paper C014

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-fourth Annual International Conference on Technology in Collegiate Mathematics, ISBN 0-321-869699, Copyright (C) 2013 by Pearson Education, Inc.


Solving Quartic Congruences 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

The author will present a technique which implements a factoring method of solving the quartic congruence: Ax4 + Bx3 + Cx2 + Dx + E = 0 (mod p) where p is a prime. Discussion will center around the components needed to apply the method in this situation: modular exponentiation, modular inverses and finding square roots and cube roots modulo a prime p.

Keyword(s): number theory