Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site pucc-i Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!ihnp4!inuxc!pur-ee!CS-Mordred!Pucc-H:Pucc-I:ags From: ags@pucc-i (Seaman) Newsgroups: net.math Subject: Re: polynomials in modulo arithmetic Message-ID: <199@pucc-i> Date: Tue, 14-Feb-84 14:19:06 EST Article-I.D.: pucc-i.199 Posted: Tue Feb 14 14:19:06 1984 Date-Received: Fri, 17-Feb-84 03:55:00 EST References: <2510@rabbit.UUCP> Organization: Purdue University Computing Center Lines: 16 > Does anyone on the net know of any texts on modulo arithmetic? In > particular, I need to solve for coefficients of a polynomial in terms > of x, with y a list of numbers modulo N (N constant). All pointers > appreciated. Arithmetic modulo N is a special case of ring theory. If N is prime, then you have a field. Any algebra textbook that deals with rings and/or fields should help you. -- Dave Seaman ..!pur-ee!pucc-i:ags "Against people who give vent to their loquacity by extraneous bombastic circumlocution."