Abstract
The Magma code and some computational results of experiments in number theory are given. The experiments concern covering systems with applications to explicit primality tests, the inverse of Euler’s totient function, and class number relations in Galois extensions of ℚ. Some evidence for various conjectures and open problems is given.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
1. R. Baillie, G. Cormack, H. C. Williams, The problem of Sierpiński concerning k · 2n + 1, Math. Comp. 37 (1981), 229–231.
2. Bruce C. Berndt, Ronald J. Evans, Kenneth S. Williams, Gauss and Jacobi sums, Canad. Math. Soc. series of monographs and advanced texts 21, New York: John Wiley and Sons, 1997.
3. Wieb Bosnia, Explicit primality criteria for h · 2k ± 1, Math. Comp. 61 (1993), 97–109.
4. Wieb Bosnia, Cubic reciprocity and explicit primality tests for h · 3k ± 1, pp. 77–89 in: Alf van der Poorten, Andreas Stein (eds.), High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Inst. Commun. 41, Providence: Amer. Math. Soc. 2004.
5. Wieb Bosma, Some computational experiments in elementary number theory, report 05-02 Mathematical Institute, Radboud University Nijmegen, 2005.
6. Wieb Bosma, John Cannon, Catherine Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235–265. See also the Magma home page at http://magma.maths.usyd.edu.au/magma/.
7. Wieb Bosma, Bart de Smit, Class number relations from a computational point of view, J. Symbolic Comput. 31 (2001), 97–112.
8. Wieb Bosma, Bart de Smit, On arithmetically equivalent number fields of small degree, pp. 67–79 in: C. Fieker, D.R. Kohel (eds.), Algorithmic Number Theory Symposium, Sydney, 2002, Lecture Notes in Computer Science 2369, Berlin, Heidelberg: Springer, 2002.
9. R. Brauer, Beziehungen zwischen Klassenzahlen von Teilkörpern eines galoiss-chen Körpers, Math. Nachrichten 4 (1951), 158–174.
10. J. J. Cannon, D. F. Holt, Computing maximal subgroups of a unite group, J. Symbolic Comput. 37 (2004), 589–609.
11. R. D. Carmichael, On Euler's φ-function, Bull. Amer. Math. Soc. 13 (1907), 241–243; Errata: Bull. Amer. Math. Soc. 54 (1948), 1192.
12. R. D. Carmichael, Note on Euler's φ-function, Bull. Amer. Math. Soc. 28 (1922), 109–110; Errata: Bull. Amer. Math. Soc. 55 (1949), 212.
13. S. L. G. Choi, Covering the set of integers by congruence classes of distinct moduli, Math. Comp. 25 (1971), 885–895.
14. R.F. Churchhouse, Covering sets and systems of congruences, pp. 20–36 in: R.F. Churchhouse, J.-C. Herz (eds.), Computers in mathematical research, Amsterdam: North-Holland, 1968.
15. D.W. Erbach, J. Fischer, J. McKay, Polynomials with PSL(2, 7) as Galois group, J. Number Theory 11 (1979), 69–75.
16. Paul Erdös, Some of my favorite problems and results, pp. 47–67 in: Ronald L. Graham, Jaroslav Nešetřil (eds.), The Mathematics of Paul Erdős I, Berlin: Springer, 1997.
17. Paul ErdoUs, Some remarks on Euler's φ function, Acta Arith. 4 (1958), 10–19.
18. F. Gassmann, Bemerkungen zu der vorstehenden Arbeit von Hurwitz (‘Öber Beziehungen zwischen den Primidealen eines algebraischen Körpers und den Substitutionen seiner Gruppe’), Math. Z. 25 (1926), 124–143.
19. Andrew Granville, K. Soundararajan, A binary additive problem of Erdös and the order of 2 mod p2, Ramanujan J. 2 (1998), 283–298.
20. Richard K. Guy, Unsolved problems in number theory, Unsolved problems in intuitive mathematics I, New York: Springer 1994 (2nd edition).
21. Kenneth Ireland and Michael Rosen, A classical introduction to modern number theory, Graduate texts in mathematics 84, New York: Springer, 1982.
22. G. Jaeschke, On the smallest k such that all k · 2N + 1 are composite, Math. Comp. 40 (1983), 381–384; Errata: Math. Comp. 45 (1985), 637.
23. Wilfrid Keller, Factors of Fermât numbers and large primes of the form k · 2n + l, Math. Comp. 41 (1983), 661–673.
24. Wilfrid Keller, The least prime of the form k · 2n + 1, Abstracts Amer. Math. Soc. 9 (1988), 417–418.
25. V. L. Klee, Jr., On a conjecture of Carmichael, Bull. Amer. Math. Soc. 53 (1947), 1183–1186.
26. N. Klingen, Arithmetical similarities, Oxford: Oxford University Press, 1998.
27. Samuel E. LaMacchia, Polynomials with Galois group PSL(2, 7), Comm. Algebra 8 (1980), 983–992.
28. Douglas B. Meade, Charles A. Nicol, Maple tools for use in conjecture testing and iteration mappings in number theory, IMI Research Report 1993:06 (Department of Mathematics, University of South Carolina), 1993.
29. Ryozo Morikawa, Some examples of covering sets, Bull. Fac. Liberal Arts, Nagasaki Univ. 21 (1981), 1–4.
30. Oystein Ore, J. L. Selfridge, P. T. Bateman, Euler's function: Problem 4995 and its solution, Amer. Math. Monthly 70 (1963), 101–102.
31. R. Perlis, On the equation ςK(s) = ςK'(S) J. Number Theoryy 9 (1977), 342–360.
32. R. Perils, On the class numbers of arithmetically equivalent fields, J. Number Theory 10 (1978), 458–509.
33. A. de Polignac, Recherches nouvelles sur les nombres premiers, C. R. Acad. Sci. Paris Math. 29 (1849), 397–401; 738–739.
34. Carl Pomerance, On Carmichael's conjecture, Proc. Amer. Math. Soc. 43 (1974), 297–298.
35. P. Poulet, Nouvelles suites arithmétiques, Sphinx 2 (1932), 53–54.
36. H. Riesel, Några stora primtal, Elementa 39 (1956), 258–260.
37. Aaron Schlafly, Stan Wagon, Carmichael's Conjecture on the Euler function is valid below 1010000000, Math. Comp. 63 (1994), 415–419.
38. W. Sierpiński, Sur un probléme concernant les nombres k × 2n + l, Elemente der Mathematik 15 (1960), 63–74.
39. Bart de Smit, Robert Perils, Zeta functions do not determine class numbers, Bull. Amer. Math. Soc. 31 (1994), 213–215.
40. R. G. Stanton, Further results on covering integers of the form 1 + k · 2n by primes, pp. 107–114 in: Kevin L. McAvaney (ed.), Combinatorial Mathematics VIII, Lecture Notes in Mathematics 884, Berlin: Springer, 1981.
41. R. G. Stanton, H. C. Williams, Computation of some number-theoretic coverings pp. 8–13 in: Kevin L. McAvaney (ed.), Combinatorial Mathematics VIII, Lecture Notes in Mathematics 884, Berlin: Springer, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Bosma, W. (2006). Some computational experiments in number theory. In: Bosma, W., Cannon, J. (eds) Discovering Mathematics with Magma. Algorithms and Computation in Mathematics, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37634-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-37634-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37632-3
Online ISBN: 978-3-540-37634-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)