NotesFAQContact Us
Search Tips
Back to results
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ992901
Record Type: Journal
Publication Date: 2012
Pages: 7
Abstractor: As Provided
Reference Count: 4
ISSN: ISSN-0020-739X
Detecting Prime Numbers via Roots of Polynomials
Dobbs, David E.
International Journal of Mathematical Education in Science and Technology, v43 n3 p381-387 2012
It is proved that an integer n [greater than or equal] 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z[subscript n], the ring of integers modulo n, such that each element of Z[subscript n] is a root of f. This classroom note could find use in any introductory course on abstract algebra or elementary number theory.
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Journal Articles; Reports - Descriptive
Education Level: Higher Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A