Detecting prime numbers via roots of polynomials

DOI10.1080/0020739X.2011.582182zbMath1241.97001OpenAlexW1976511866MaRDI QIDQ2883977

David E. Dobbs

Publication date: 14 May 2012

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739x.2011.582182

zbMATH Keywords

greatest common divisorpolynomialsdegreeprime numberslittle Fermat theoremcomposite numberscongruence modulo \(n\)Euler \(\phi\) functionmonics

Mathematics Subject Classification ID

Number theory (educational aspects) (97F60)

Cites Work

• Unnamed Item
• On the Prime Divisors of Polynomials

This page was built for publication: Detecting prime numbers via roots of polynomials