Description

Book Synopsis
The purpose of this book is to introduce the basic ideas of mathematical proof to students embarking on university mathematics. The emphasis is on helping the reader in understanding and constructing proofs and writing clear mathematics. This is achieved by exploring set theory, combinatorics and number theory, topics which include many fundamental ideas which are part of the tool kit of any mathematician. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of basic methods of proof, and includes some of the classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. Over 250 problems include questions to interest and challenge the most able student as well as plenty of routine exercises to help familiarize the reader with the basic ideas.

Trade Review
'The book is written with understanding of the needs of students …' European Mathematical Society

Table of Contents
Part I. Mathematical Statements and Proofs: 1. The language of mathematics; 2. Implications; 3. Proofs; 4. Proof by contradiction; 5. The induction principle; Part II. Sets and Functions: 6. The language of set theory; 7. Quantifiers; 8. Functions; 9. Injections, surjections and bijections; Part III. Numbers and Counting: 10. Counting; 11. Properties of finite sets; 12. Counting functions and subsets; 13. Number systems; 14. Counting infinite sets; Part IV. Arithmetic: 15. The division theorem; 16. The Euclidean algorithm; 17. Consequences of the Euclidean algorithm; 18. Linear diophantine equations; Part V. Modular Arithmetic: 19. Congruences of integers; 20. Linear congruences; 21. Congruence classes and the arithmetic of remainders; 22. Partitions and equivalence relations; Part VI. Prime Numbers: 23. The sequence of prime numbers; 24. Congruence modulo a prime; Solutions to exercises.

An Introduction to Mathematical Reasoning Numbers

    Product form

    £33.24

    Includes FREE delivery

    RRP £34.99 – you save £1.75 (5%)

    Order before 4pm tomorrow for delivery by Mon 29 Jun 2026.

    A Paperback by Peter J. Eccles

    15 in stock


      View other formats and editions of An Introduction to Mathematical Reasoning Numbers by Peter J. Eccles

      Publisher: Cambridge University Press
      Publication Date: 12/11/1997 12:00:00 AM
      ISBN13: 9780521597180, 978-0521597180
      ISBN10: 0521597188

      Description

      Book Synopsis
      The purpose of this book is to introduce the basic ideas of mathematical proof to students embarking on university mathematics. The emphasis is on helping the reader in understanding and constructing proofs and writing clear mathematics. This is achieved by exploring set theory, combinatorics and number theory, topics which include many fundamental ideas which are part of the tool kit of any mathematician. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of basic methods of proof, and includes some of the classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. Over 250 problems include questions to interest and challenge the most able student as well as plenty of routine exercises to help familiarize the reader with the basic ideas.

      Trade Review
      'The book is written with understanding of the needs of students …' European Mathematical Society

      Table of Contents
      Part I. Mathematical Statements and Proofs: 1. The language of mathematics; 2. Implications; 3. Proofs; 4. Proof by contradiction; 5. The induction principle; Part II. Sets and Functions: 6. The language of set theory; 7. Quantifiers; 8. Functions; 9. Injections, surjections and bijections; Part III. Numbers and Counting: 10. Counting; 11. Properties of finite sets; 12. Counting functions and subsets; 13. Number systems; 14. Counting infinite sets; Part IV. Arithmetic: 15. The division theorem; 16. The Euclidean algorithm; 17. Consequences of the Euclidean algorithm; 18. Linear diophantine equations; Part V. Modular Arithmetic: 19. Congruences of integers; 20. Linear congruences; 21. Congruence classes and the arithmetic of remainders; 22. Partitions and equivalence relations; Part VI. Prime Numbers: 23. The sequence of prime numbers; 24. Congruence modulo a prime; Solutions to exercises.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account