Literaturnachweis - Detailanzeige
| Autor/in | Dobbs, David E. |
|---|---|
| Titel | Detecting Prime Numbers via Roots of Polynomials |
| Quelle | In: International Journal of Mathematical Education in Science and Technology, 43 (2012) 3, S.381-387 (7 Seiten)Infoseite zur Zeitschrift
PDF als Volltext |
| Sprache | englisch |
| Dokumenttyp | gedruckt; online; Zeitschriftenaufsatz |
| ISSN | 0020-739X |
| DOI | 10.1080/0020739X.2011.582182 |
| Schlagwörter | Introductory Courses; Number Concepts; Numbers; Algebra; Mathematical Formulas; Numeracy; Classroom Techniques; Teaching Methods; Equations (Mathematics) |
| Abstract | 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. (As Provided). |
| Anmerkungen | Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site: http://www.tandf.co.uk/journals |
| Erfasst von | ERIC (Education Resources Information Center), Washington, DC |
| Update | 2017/4/10 |
Literaturbeschaffung und Bestandsnachweise in Bibliotheken prüfen
Permalink als QR-Code
Inhalt auf sozialen Plattformen teilen (nur vorhanden, wenn Javascript eingeschaltet ist)
Teile diese Seite:
