@@ -42,15 +42,16 @@ \chapter*{Introduction}
42
42
infinitude of prime numbers, or the correctness of the Euclidean's
43
43
division algorithm, in a few lines of proof text.
44
44
45
- \paragraph {Acknowledgments. } The authors wish to thank
46
- Reynald Affeldt, Guillaume Allais, Sophie Bernard, Alain Giorgetti,
47
- Laurence Rideau, Lionel Rieg, Damien Rouhling, Michael Soegtrop for
48
- their comments on earlier versions of this text. They are specially
49
- grateful to Simon Boulier, Arthur Charguéraud, Florent Hivert, Pierre
50
- Jouvelot, Darij Grinberg, Guillaume Melquiond, Michael Nahas, Julien
51
- Narboux, Anton Trunov, Yamamoto Mitsuharu and Prashanth Mundkur for
52
- their careful proofreading and for their suggestions. Many thanks to
53
- Hanna for the illustrations.
45
+ \paragraph {Acknowledgments. }
46
+ We thank Yves Bertot and Georges Gonthier, for contributing the first
47
+ and the last chapter of this book. We wish to thank Reynald Affeldt,
48
+ Guillaume Allais, Sophie Bernard, Simon Boulier, Cyril Cohen, Arthur
49
+ Charguéraud, Alain Giorgetti, Darij Grinberg, Florent Hivert, Pierre
50
+ Jouvelot, Marisa Kirisame, Guillaume Melquiond, Sebastian Miele,
51
+ Yamamoto Mitsuharu, Prashanth Mundkur, Michael Nahas, Julien Narboux,
52
+ Laurence Rideau, Lionel Rieg, Damien Rouhling, Michael Soegtrop,
53
+ Laurent Théry, and Anton Trunov for their careful proofreading and for
54
+ their suggestions. Many thanks to Hanna for the illustrations.
54
55
55
56
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
56
57
\section* {Structure of the book }
0 commit comments