The files in this directory contain the code from the papers in the book Discovering Mathematics with Magma. The names of these files have the form: PaperNN PaperNN.m PaperNN_funcs PaperNN_README where NN is the chapter number (01 through to 14). E.g., for the first paper (Some computational experiments in number theory, by Wieb Bosma) we have the files Paper01, Paper01_funcs, Paper01_README (there is no Paper01.m). PaperNN is the interactive portion of the code, which should include all statements beginning with the Magma prompt in the book. It will load or attach other files if necessary. PaperNN.m contains any intrinsics defined or required by the paper. PaperNN_funcs contains any functions defined or required by the paper. PaperNN_README gives the details of the paper, approximate timings, any special notes about the Magma code, and lists any changes made to the code since V2.11 of Magma. Changes have been made to ensure compatibility across versions of Magma, as well as some minor improvements in some instances. Paper 01: Some computational experiments in number theory by Wieb Bosma Paper 02: Applications of the class field theory of global fields by Claus Fieker Paper 03: Some ternary Diophantine equations of signature (n, n, 2) by Nils Bruin Paper 04: Studying the Birch and Swinnerton-Dyer conjecture for modular abelian varieties using Magma by William Stein Paper 05: Computing with the analytic Jacobian of a genus 2 curve by Paul B. van Wamelen Paper 06: Graded rings and special K3 surfaces by Gavin Brown Paper 07: Constructing the split octonions by Donald E. Taylor Paper 08: Support modules for varieties by Jon F. Carlson Paper 09: When is projectivity detected on subalgebras? by Jon F. Carlson Paper 10: Cohomology and group extensions in Magma by Derek F. Holt Paper 11: Computing the primitive permutation groups of degree less than 1000 by Colva M. Roney-Dougal and William R. Unger Paper 12: Computer aided discovery of a fast algorithm for testing conjugacy in braid groups by Volker Gebhardt Paper 13: Searching for linear codes with large minimum distance by Markus Grassl Paper 14: Colouring planar graphs by Paulette Lieby