Elementary Number Theory
- David H. Bailey and Jonathan M. Borwein, Experimental mathematics: Examples, methods and implications, Notices Amer. Math. Soc. 52 (2005), no. 5, 502–514.[MR]
- Wieb Bosma, Some computational experiments in number theory, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 1–30.[MR]
- Richard P. Brent and Paul Zimmermann, Ten new primitive binary trinomials, Math. Comp. 78 (2009), no. 266, 1197–1199.[MR]
- Henri Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol. 138, Springer-Verlag, Berlin, 1993, pp. xii+534.[MR]
- Henri Cohen, Advanced Topics in Computational Number Theory, Graduate Texts in Mathematics, vol. 193, Springer-Verlag, New York, 2000, pp. xvi+578.[MR]
- J. E. Cremona, Unimodular integer circulants, Math. Comp. 77 (2008), no. 263, 1639–1652.[MR]
- Vassil S. Dimitrov and Everett W. Howe, Lower bounds on the lengths of double-base representations, preprint 2010, 8 pages.[arXiv]
- Graham Everest and Valéry Mahé, A generalization of Siegel's theorem and Hall's conjecture, Experiment. Math. 18 (2009), no. 1, 1–9.[MR/arXiv]
- Alina Ostafe and Igor E. Shparlinski, Pseudorandomness and dynamics of Fermat quotients, preprint (2010).[arXiv]
- Emmanuel Royer, Evaluating convolution sums of the divisor function with quasimodular forms, Int. J. Number Theory 3 (2007), no. 2, 231–261.[arXiv]
- J. Sándor and B. Crstici, Handbook of Number Theory II, Kluwer Academic Publishers, Dordrecht, 2004, pp. ii+637.[MR]