Some computational experiments in number theory

DOI10.1007/978-3-540-37634-7_1MaRDI QIDQ3517204zbMATH OpenOpenAlexFDO

Authors Wieb Bosma

Publication date 12 August 2008

Published in Discovering Mathematics with Magma (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-37634-7_1

zbMATH Keywords

covering systemsimage of Euler's totient functionprimality testsrelations between class numbersSierpińskisubfields of Galois extensions

Mathematics Subject Classification ID

Primality (11Y11) Algebraic number theory computations (11Y40)

Recommendations

• Class number relations from a computational point of view
• Explicit Primality Criteria for h ⋅2 k ± 1
• Strong pseudoprimes, covering systems of congruences and generalized bent functions
• scientific article; zbMATH DE number 3899009
• scientific article; zbMATH DE number 2154273

Cited in

(5)

• Complexity of inverting the Euler function
• scientific article; zbMATH DE number 5138767 (Why is no real title available?)
• scientific article; zbMATH DE number 4041991 (Why is no real title available?)
• scientific article; zbMATH DE number 1222517 (Why is no real title available?)
• Some uses of microcomputers in number theory research

This page was built for publication: Some computational experiments in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517204)