Scribd
Upload
366 views3 pages

An Introduction To Mathematical Reasonin

This document is an introduction to mathematical reasoning that covers topics like proofs, sets, functions, numbers, and counting. It is divided into six parts that cover mathematical statements and proofs, sets and functions, numbers and counting, arithmetic, modular arithmetic, and prime numbers. Each part contains multiple chapters on specific mathematical concepts like implications, proofs by contradiction, set theory, quantifiers, counting functions, number systems, division, congruence, and prime numbers. The document aims to explain essential concepts in logic and discrete mathematics.

Uploaded by

Gero Nimo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
366 views3 pages

An Introduction To Mathematical Reasonin

This document is an introduction to mathematical reasoning that covers topics like proofs, sets, functions, numbers, and counting. It is divided into six parts that cover mathematical statements and proofs, sets and functions, numbers and counting, arithmetic, modular arithmetic, and prime numbers. Each part contains multiple chapters on specific mathematical concepts like implications, proofs by contradiction, set theory, quantifiers, counting functions, number systems, division, congruence, and prime numbers. The document aims to explain essential concepts in logic and discrete mathematics.

Uploaded by

Gero Nimo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

An Introduction to

Mathematical Reasoning

numbers, sets and functions

Peter J. Eccles
Department of Mathematics
University of Manchester

1CAMBRIDGE
UNIVERSITY PRESS
Contents

Preface page IX
Part I: Mathematical statements and proofs 1
1 The language of mathematics 3
2 Implications 10
3 Proofs 21
4 Proof by contradiction 30
5 The induction principle 39
Problems I 53
Part II: Sets and functions 59
6 The language of set theory 61
7 Quantifiers 74
8 Functions 89
9 Injections, surjections and bijections 101
Problems II 115
Part III: Numbers and counting 121
10 Counting 123
11 Properties of finite sets 133
12 Counting functions and subsets 144
13 Number systems 157
14 Counting infinite sets ; . 170
Problems III 182
Part IV: Arithmetic 189
15 The division theorem 191
16 The Euclidean algorithm 199
17 Consequences of the Euclidean algorithm 207
18 Linear diophantine equations 216
Problems IV 225

Vll
viii Contents
Part V: Modular arithmetic 229
19 Congruence of integers 231
20 Linear congruences 240
21 Congruence classes and the arithmetic of remainders 250
22 Partitions and equivalence relations 262
Problems V 271
Part VI: Prime numbers 275
23 The sequence of prime numbers 277
24 Congruence modulo a prime 289
Problems VI 295
Solutions to exercises 299
Bibliography 345
List of symbols 346
Index 347

You might also like