Instant Ebooks Textbook Discrete Mathematics With Applications: Metric Version, Fifth Edition Susanna S. Epp Download All Chapters

Full download test bank at ebook textbookfull.
com
Discrete Mathematics with

Applications: Metric Version, Fifth
CLICK LINK TO DOWLOAD
https://textbookfull.com/product/discrete-
mathematics-with-applications-metric-version-
fifth-edition-susanna-s-epp/
textbookfull
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Discrete Mathematics with Applications: Fifth Edition

Susanna S. Epp
https://textbookfull.com/product/discrete-mathematics-with-
applications-fifth-edition-susanna-s-epp/
Discrete Mathematics and Applications 2nd Edition

Ferland
https://textbookfull.com/product/discrete-mathematics-and-
applications-2nd-edition-ferland/
Discrete mathematics with ducks Second Edition

Belcastro
https://textbookfull.com/product/discrete-mathematics-with-ducks-
second-edition-belcastro/
Discrete Mathematics and Applications 2nd Edition Kevin

Ferland
https://textbookfull.com/product/discrete-mathematics-and-
applications-2nd-edition-kevin-ferland/
Discrete Mathematics and Its Applications 8th Edition
Rosen
https://textbookfull.com/product/discrete-mathematics-and-its-
applications-8th-edition-rosen/
Elementary linear algebra : Metric version Eighth

Edition Ron Larson
https://textbookfull.com/product/elementary-linear-algebra-
metric-version-eighth-edition-ron-larson/
Biota Grow 2C gather 2C cook Loucas
https://textbookfull.com/product/biota-grow-2c-gather-2c-cook-
loucas/
Introduction to Probability and Statistics - Metric

Version, 15e William Mendenhall
https://textbookfull.com/product/introduction-to-probability-and-
statistics-metric-version-15e-william-mendenhall/
Introduction to Probability and Statistics (Metric

Version) 15th Edition William Mendenhall
https://textbookfull.com/product/introduction-to-probability-and-
statistics-metric-version-15th-edition-william-mendenhall/
discrete mathematics
with applications
FiFth editiON, metric VersiON
SUSANNA S. EPP
DePaul University
Australia ● Brazil ● Mexico ● Singapore ● United Kingdom ● United States
Copyright 2020 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
This is an electronic version of the print textbook. Due to electronic rights restrictions,
some third party content may be suppressed. Editorial review has deemed that any suppressed
content does not materially affect the overall learning experience. The publisher reserves the right
to remove content from this title at any time if subsequent rights restrictions require it. For
valuable information on pricing, previous editions, changes to current editions, and alternate
formats, please visit www.cengage.com/highered to search by ISBN#, author, title, or keyword for
materials in your areas of interest.
Important Notice: Media content referenced within the product description or the product
text may not be available in the eBook version.
Cover Photo: The stones are discrete objects placed one on top of another like a chain of careful reasoning. A person who
decides to build such a tower aspires to the heights and enjoys playing with a challenging problem. Choosing the stones takes
both a scientific and an aesthetic sense. Getting them to balance requires patient effort and careful thought. And the tower
that results is beautiful. A perfect metaphor for discrete mathematics!
Discrete Mathematics with Applications, © 2020, 2011, 2004 Cengage Learning, Inc.
Fifth Edition, Metric Version
WCN: 02-300
Susanna S. Epp
ALL RIGHTS RESERVED. No part of this work covered by the copyright
Metric Version Prepared by Qaboos Imran
herein may be reproduced or distributed in any form or by any means,
except as permitted by U.S. copyright law, without the prior written
International Product Director:
permission of the copyright owner.
Timothy L. Anderson
Senior Product Assistant: Alexander Sham

For product information and technology assistance, contact us at
Content Manager: Marianne Groth
Cengage Customer & Sales Support, 1-800-354-9706 or
Associate Content Manager: Amanda Rose support.cengage.com
Associate Marketing Manager: Tori Sitcawich

For permission to use material from this text or product,
Manufacturing Planner: Doug Bertke submit all requests online at www.cengage.com/permissions.
IP Analyst: Reba Frederics
IP Project Manager: Carly Belcher ISBN: 978-0-357-11408-7
Production Service: MPS Limited Cengage International Offices
Compositor: MPS Limited Asia Australia/New Zealand

www.cengageasia.com www.cengage.com.au
Senior Designer: Diana Graham tel: (65) 6410 1200 tel: (61) 3 9685 4111
Cover Image: Katherine Gendreau Brazil India

Photography/Getty Images www.cengage.com.br www.cengage.co.in
tel: (55) 11 3665 9900 tel: (91) 11 4364 1111
Latin America UK/Europe/Middle East/Africa

www.cengage.com.mx www.cengage.co.uk
tel: (52) 55 1500 6000 tel: (44) 0 1264 332 424
Represented in Canada by
Nelson Education, Ltd.
tel: (416) 752 9100 / (800) 668 0671
www.nelson.com
Cengage is a leading provider of customized learning solutions with

office locations around the globe, including Singapore, the United
Kingdom, Australia, Mexico, Brazil, and Japan. Locate your local office at:
www.cengage.com/global.
For product information: www.cengage.com/international

Visit your local office: www.cengage.com/global
Visit our corporate website: www.cengage.com
Printed in the United States of America

Print Number: 01 Print Year: 2018
To my husband, Helmut, and my children,
Amanda, Catherine, and Caroline
Know if you’re
prepared for class!
STUDY SMARTER
93% correlation
between homework
scores and in-class
Ever wonder if you studied enough? WebAssign from
performance
Cengage can help.
WebAssign is an online learning platform for your math,

statistics and science courses. It helps you practice, focus
your study time, and absorb what you learn. When class
comes—you’re way more confident.
With WebAssign you will:
Get instant feedback Know how well you

and grading understand concepts
Watch videos and tutorials Perform better on

when you’re stuck in-class assignments
Ask your instructor today how you can get

access to WebAssign!
cengage.com/webassign
cONteNts
ChAPTER 1 speaking mathematically 1

1.1 Variables 1
Using Variables in Mathematical Discourse; Introduction to Universal, Existential,
and Conditional Statements
1.2 The Language of Sets 6

The Set-Roster and Set-Builder Notations; Subsets; Cartesian Products; Strings
1.3 The Language of Relations and Functions 15

Definition of a Relation from One Set to Another; Arrow Diagram of a Relation;
Definition of Function; Function Machines; Equality of Functions
1.4 The Language of Graphs 24

Definition and Representation of Graphs and Directed Graphs; Degree of a Vertex;
Examples of Graphs Including a Graph Coloring Application
ChAPTER 2 the Logic of compound statements 37

2.1 Logical Form and Logical Equivalence 37
Statements; Compound Statements; Truth Values; Evaluating the Truth of More General
Compound Statements; Logical Equivalence; Tautologies and Contradictions; Summary
of Logical Equivalences
2.2 Conditional Statements 53

Logical Equivalences Involving S; Representation of If-Then As Or; The Negation of
a Conditional Statement; The Contrapositive of a Conditional Statement; The Converse
and Inverse of a Conditional Statement; Only If and the Biconditional; Necessary and
Sufficient Conditions; Remarks
2.3 Valid and Invalid Arguments 66

Modus Ponens and Modus Tollens; Additional Valid Argument Forms: Rules of
Inference; Fallacies; Contradictions and Valid Arguments; Summary of Rules of Inference
2.4 Application: Digital Logic Circuits 79

Black Boxes and Gates; The Input/Output Table for a Circuit; The Boolean Expression
Corresponding to a Circuit; The Circuit Corresponding to a Boolean Expression; Finding
vi ConTenTs
a Circuit That Corresponds to a Given Input/Output Table; Simplifying Combinational

Circuits; NAND and NOR Gates
2.5 Application: Number Systems and Circuits for Addition 93

Binary Representation of Numbers; Binary Addition and Subtraction; Circuits for
Computer Addition; Two’s Complements and the Computer Representation of Negative
Integers; 8-Bit Representation of a Number; Computer Addition with Negative Integers;
Hexadecimal Notation
ChAPTER 3 the Logic of Quantified statements 108

3.1 Predicates and Quantified Statements I I08
The Universal Quantifier: 5; The Existential Quantifier: E; Formal versus Informal
Language; Universal Conditional Statements; Equivalent Forms of Universal and
Existential Statements; Bound Variables and Scope; Implicit Quantification; Tarski’s
World
3.2 Predicates and Quantified Statements II 122

Negations of Quantified Statements; Negations of Universal Conditional Statements;
The Relation among 5, E, `, and ~; Vacuous Truth of Universal Statements; Variants of
Universal Conditional Statements; Necessary and Sufficient Conditions, Only If
3.3 Statements with Multiple Quantifiers 131

Translating from Informal to Formal Language; Ambiguous Language; Negations of
Multiply-Quantified Statements; Order of Quantifiers; Formal Logical Notation; Prolog
3.4 Arguments with Quantified Statements 146

Universal Modus Ponens; Use of Universal Modus Ponens in a Proof; Universal Modus
Tollens; Proving Validity of Arguments with Quantified Statements; Using Diagrams to
Test for Validity; Creating Additional Forms of Argument; Remark on the Converse and
Inverse Errors
ChAPTER 4 elementary Number theory and methods

of Proof 160
4.1 Direct Proof and Counterexample I: Introduction 161
Definitions; Proving Existential Statements; Disproving Universal Statements by
Counterexample; Proving Universal Statements; Generalizing from the Generic
Particular; Method of Direct Proof; Existential Instantiation; Getting Proofs Started;
Examples
4.2 Direct Proof and Counterexample II: Writing Advice 173

Writing Proofs of Universal Statements; Common Mistakes; Examples; Showing That an
Existential Statement Is False; Conjecture, Proof, and Disproof
4.3 Direct Proof and Counterexample III: Rational Numbers 183

More on Generalizing from the Generic Particular; Proving Properties of Rational
Numbers; Deriving New Mathematics from Old
ConTenTs vii
4.4 Direct Proof and Counterexample IV: Divisibility 190

Proving Properties of Divisibility; Counterexamples and Divisibility; The Unique
Factorization of Integers Theorem
4.5 Direct Proof and Counterexample V: Division into Cases and the
Quotient-Remainder Theorem 200
Discussion of the Quotient-Remainder Theorem and Examples; div and mod; Alternative
Representations of Integers and Applications to Number Theory; Absolute Value and the
Triangle Inequality
4.6 Direct Proof and Counterexample VI: Floor and Ceiling 211
Definition and Basic Properties; The Floor of ny2
4.7 Indirect Argument: Contradiction and Contraposition 218

Proof by Contradiction; Argument by Contraposition; Relation between Proof by
Contradiction and Proof by Contraposition; Proof as a Problem-Solving Tool
4.8 Indirect Argument: Two Famous Theorems 228

The Irrationality of Ï2; Are There Infinitely Many Prime Numbers?; When to Use
Indirect Proof; Open Questions in Number Theory
4.9 Application: The handshake Theorem 235

The Total Degree of a Graph; The Handshake Theorem and Consequences; Applications;
Simple Graphs; Complete Graphs; Bipartite Graphs
4.10 Application: Algorithms 244

An Algorithmic Language; A Notation for Algorithms; Trace Tables; The Division
Algorithm; The Euclidean Algorithm
ChAPTER 5 sequences, mathematical induction,

and recursion 258
5.1 Sequences 258
Explicit Formulas for Sequences; Summation Notation; Product Notation; Properties
of Summations and Products; Change of Variable; Factorial and n Choose r Notation;
Sequences in Computer Programming; Application: Algorithm to Convert from Base 10
to Base 2 Using Repeated Division by 2
5.2 Mathematical Induction I: Proving Formulas 275

Principle of Mathematical Induction; Sum of the First n Integers; Proving an Equality;
Deducing Additional Formulas; Sum of a Geometric Sequence
5.3 Mathematical Induction II: Applications 289

Comparison of Mathematical Induction and Inductive Reasoning; Proving Divisibility
Properties; Proving Inequalities; Trominoes and Other Applications
viii ConTenTs
5.4 Strong Mathematical Induction and the Well-Ordering

Principle for the Integers 301
Strong Mathematical Induction; The Well-Ordering Principle for the Integers; Binary
Representation of Integers and Other Applications
5.5 Application: Correctness of Algorithms 314

Assertions; Loop Invariants; Correctness of the Division Algorithm; Correctness of the
Euclidean Theorem
5.6 Defining Sequences Recursively 325

Examples of Recursively Defined Sequences; Recursive Definitions of Sum and Product
5.7 Solving Recurrence Relations by Iteration 340

The Method of Iteration; Using Formulas to Simplify Solutions Obtained by Iteration;
Checking the Correctness of a Formula by Mathematical Induction; Discovering That an
Explicit Formula Is Incorrect
5.8 Second-Order Linear homogeneous Recurrence Relations

with Constant Coefficients 352
Derivation of a Technique for Solving These Relations; The Distinct-Roots Case; The
Single-Root Case
5.9 General Recursive Definitions and Structural Induction 364

Recursively Defined Sets; Recursive Definitions for Boolean Expressions, Strings, and
Parenthesis Structures; Using Structural Induction to Prove Properties about Recursively
Defined Sets; Recursive Functions
ChAPTER 6 set theory 377

6.1 Set Theory: Definitions and the Element Method of Proof 377
Subsets: Introduction to Proof and Disproof for Sets; Set Equality; Venn Diagrams;
Operations on Sets; The Empty Set; Partitions of Sets; Power Sets; An Algorithm to
Check Whether One Set Is a Subset of Another (Optional)
6.2 Properties of Sets 391

Set Identities; Proving Subset Relations and Set Equality; Proving That a Set Is the
Empty Set
6.3 Disproofs and Algebraic Proofs 407

Disproving an Alleged Set Property; Problem-Solving Strategy; The Number of Subsets
of a Set; “Algebraic” Proofs of Set Identities
6.4 Boolean Algebras, Russell’s Paradox, and the halting Problem 414
Boolean Algebras: Definition and Properties; Russell’s Paradox; The Halting Problem
ConTenTs ix
ChAPTER 7 Properties of Functions 425

7.1 Functions Defined on General Sets 425
Dynamic Function Terminology; Equality of Functions; Additional Examples of
Functions; Boolean Functions; Checking Whether a Function Is Well Defined; Functions
Acting on Sets
7.2 One-to-One, Onto, and Inverse Functions 439

One-to-One Functions; One-to-One Functions on Infinite Sets; Application: Hash
Functions and Cryptographic Hash Functions; Onto Functions; Onto Functions on
Infinite Sets; Relations between Exponential and Logarithmic Functions; One-to-One
Correspondences; Inverse Functions
7.3 Composition of Functions 461

Definition and Examples; Composition of One-to-One Functions; Composition of Onto
Functions
7.4 Cardinality with Applications to Computability 473

Definition of Cardinal Equivalence; Countable Sets; The Search for Larger Infinities: The
Cantor Diagonalization Process; Application: Cardinality and Computability
ChAPTER 8 Properties of relations 487

8.1 Relations on Sets 487
Additional Examples of Relations; The Inverse of a Relation; Directed Graph of a
Relation; N-ary Relations and Relational Databases
8.2 Reflexivity, Symmetry, and Transitivity 495

Reflexive, Symmetric, and Transitive Properties; Properties of Relations on Infinite Sets;
The Transitive Closure of a Relation
8.3 Equivalence Relations 505

The Relation Induced by a Partition; Definition of an Equivalence Relation; Equivalence
Classes of an Equivalence Relation
8.4 Modular Arithmetic with Applications to Cryptography 524

Properties of Congruence Modulo n; Modular Arithmetic; Extending the Euclidean
Algorithm; Finding an Inverse Modulo n; RSA Cryptography; Euclid’s Lemma; Fermat’s
Little Theorem; Why Does the RSA Cipher Work?; Message Authentication; Additional
Remarks on Number Theory and Cryptography
8.5 Partial Order Relations 546

Antisymmetry; Partial Order Relations; Lexicographic Order; Hasse Diagrams; Partially
and Totally Ordered Sets; Topological Sorting; An Application; PERT and CPM
x ConTenTs
ChAPTER 9 counting and Probability 564

9.1 Introduction to Probability 564
Definition of Sample Space and Event; Probability in the Equally Likely Case; Counting
the Elements of Lists, Sublists, and One-Dimensional Arrays
9.2 Possibility Trees and the Multiplication Rule 573

Possibility Trees; The Multiplication Rule; When the Multiplication Rule Is Difficult or
Impossible to Apply; Permutations; Permutations of Selected Elements
9.3 Counting Elements of Disjoint Sets: The Addition Rule 589

The Addition Rule; The Difference Rule; The Inclusion/Exclusion Rule
9.4 The Pigeonhole Principle 604

Statement and Discussion of the Principle; Applications; Decimal Expansions of
Fractions; Generalized Pigeonhole Principle; Proof of the Pigeonhole Principle
9.5 Counting Subsets of a Set: Combinations 617

r-Combinations; Ordered and Unordered Selections; Relation between Permutations
and Combinations; Permutation of a Set with Repeated Elements; Some Advice about
Counting; The Number of Partitions of a Set into r Subsets
9.6 r-Combinations with Repetition Allowed 634

Multisets and How to Count Them; Which Formula to Use?
9.7 Pascal’s Formula and the Binomial Theorem 642

Combinatorial Formulas; Pascal’s Triangle; Algebraic and Combinatorial Proofs of
Pascal’s Formula; The Binomial Theorem and Algebraic and Combinatorial Proofs for It;
Applications
9.8 Probability Axioms and Expected Value 655

Probability Axioms; Deriving Additional Probability Formulas; Expected Value
9.9 Conditional Probability, Bayes’ Formula, and Independent Events 662

Conditional Probability; Bayes’ Theorem; Independent Events
ChAPTER 10 theory of Graphs and trees 677

10.1 Trails, Paths, and Circuits 677
Definitions; Connectedness; Euler Circuits; Hamiltonian Circuits
10.2 Matrix Representations of Graphs 698

Matrices; Matrices and Directed Graphs; Matrices and Undirected Graphs; Matrices and
Connected Components; Matrix Multiplication; Counting Walks of Length N
10.3 Isomorphisms of Graphs 713

Definition of Graph Isomorphism and Examples; Isomorphic Invariants; Graph
Isomorphism for Simple Graphs
ConTenTs xi
10.4 Trees: Examples and Basic Properties 720

Definition and Examples of Trees; Characterizing Trees
10.5 Rooted Trees 732

Definition and Examples of Rooted Trees; Binary Trees and Their Properties; Binary
Search Trees
10.6 Spanning Trees and a Shortest Path Algorithm 742

Definition of a Spanning Tree; Minimum Spanning Trees; Kruskal’s Algorithm; Prim’s
Algorithm; Dijkstra’s Shortest Path Algorithm
ChAPTER 11 analysis of algorithm efficiency 760

11.1 Real-Valued Functions of a Real Variable and Their Graphs 760
Graph of a Function; Power Functions; The Floor Function; Graphing Functions Defined
on Sets of Integers; Graph of a Multiple of a Function; Increasing and Decreasing
Functions
11.2 Big-O, Big-Omega, and Big-Theta Notations 769

Definition and General Properties of O-, V-, and Q-Notations; Orders of Power
Functions; Orders of Polynomial Functions; A Caution about O-Notation; Theorems
about Order Notation
11.3 Application: Analysis of Algorithm Efficiency I 787

Measuring the Efficiency of an Algorithm; Computing Orders of Simple Algorithms;
The Sequential Search Algorithm; The Insertion Sort Algorithm; Time Efficiency of an
Algorithm
11.4 Exponential and Logarithmic Functions: Graphs and Orders 800

Graphs of Exponential and Logarithmic Functions; Application: Number of Bits Needed
to Represent an Integer in Binary Notation; Application: Using Logarithms to Solve
Recurrence Relations; Exponential and Logarithmic Orders
11.5 Application: Analysis of Algorithm Efficiency II 813

Binary Search; Divide-and-Conquer Algorithms; The Efficiency of the Binary Search
Algorithm; Merge Sort; Tractable and Intractable Problems; A Final Remark on
Algorithm Efficiency
ChAPTER 12 regular expressions and Finite-state automata 828

12.1 Formal Languages and Regular Expressions 829
Definitions and Examples of Formal Languages and Regular Expressions; The Language
Defined by a Regular Expression; Practical Uses of Regular Expressions
12.2 Finite-State Automata 841

Definition of a Finite-State Automaton; The Language Accepted by an Automaton; The
Eventual-State Function; Designing a Finite-State Automaton; Simulating a Finite-State
xii ConTenTs
Automaton Using Software; Finite-State Automata and Regular Expressions; Regular

Languages
12.3 Simplifying Finite-State Automata 858

*-Equivalence of States; k-Equivalence of States; Finding the *-Equivalence Classes; The
Quotient Automaton; Constructing the Quotient Automaton; Equivalent Automata
APPENDIx A Properties of the real Numbers a-1
APPENDIx B solutions and hints to selected exercises a-4
Index I-1
PreFace
My purpose in writing this book was to provide a clear, accessible treatment of discrete
mathematics for students majoring or minoring in computer science, mathematics, math-
ematics education, and engineering. The goal of the book is to lay the mathematical foun-
dation for computer science courses such as data structures, algorithms, relational database
theory, automata theory and formal languages, compiler design, and cryptography, and for
mathematics courses such as linear and abstract algebra, combinatorics, probability, logic
and set theory, and number theory. By combining discussion of theory and practice, I have
tried to show that mathematics has engaging and important applications as well as being
interesting and beautiful in its own right.
A good background in algebra is the only prerequisite; the course may be taken by stu-
dents either before or after a course in calculus. Previous editions of the book have been
used successfully by students at hundreds of institutions in North and South America,
Europe, the Middle East, Asia, and Australia.
Recent curricular recommendations from the Institute for Electrical and Electronic
Engineers Computer Society (IEEE-CS) and the Association for Computing Machinery
(ACM) include discrete mathematics as the largest portion of “core knowledge” for com-
puter science students and state that students should take at least a one-semester course in
the subject as part of their first-year studies, with a two-semester course preferred when
possible. This book includes the topics recommended by those organizations and can be
used effectively for either a one-semester or a two-semester course.
At one time, most of the topics in discrete mathematics were taught only to upper-level
undergraduates. Discovering how to present these topics in ways that can be understood by
first- and second-year students was the major and most interesting challenge of writing this
book. The presentation was developed over a long period of experimentation during which
my students were in many ways my teachers. Their questions, comments, and written work
showed me what concepts and techniques caused them difficulty, and their reaction to my
exposition showed me what worked to build their understanding and to encourage their
interest. Many of the changes in this edition have resulted from continuing interaction with
students.
Themes of a Discrete Mathematics Course

Discrete mathematics describes processes that consist of a sequence of individual steps.
This contrasts with calculus, which describes processes that change in a continuous fash-
ion. Whereas the ideas of calculus were fundamental to the science and technology of the
industrial revolution, the ideas of discrete mathematics underlie the science and technol-
ogy of the computer age. The main themes of a first course in discrete mathematics are
logic and proof, induction and recursion, discrete structures, combinatorics and discrete
probability, algorithms and their analysis, and applications and modeling.
xiii
xiv PrefACe
Logic and Proof Probably the most important goal of a first course in discrete mathemat-
ics is to help students develop the ability to think abstractly. This means learning to use
logically valid forms of argument and avoid common logical errors, appreciating what it
means to reason from definitions, knowing how to use both direct and indirect arguments
to derive new results from those already known to be true, and being able to work with
symbolic representations as if they were concrete objects.
induction and recursion An exciting development of recent years has been the increased
appreciation for the power and beauty of “recursive thinking.” To think recursively means
to address a problem by assuming that similar problems of a smaller nature have already
been solved and figuring out how to put those solutions together to solve the larger prob-
lem. Such thinking is widely used in the analysis of algorithms, where recurrence relations
that result from recursive thinking often give rise to formulas that are verified by math-
ematical induction.
discrete structures Discrete mathematical structures are the abstract structures that de-
scribe, categorize, and reveal the underlying relationships among discrete mathematical
objects. Those studied in this book are the sets of integers and rational numbers, general
sets, Boolean algebras, functions, relations, graphs and trees, formal languages and regular
expressions, and finite-state automata.
combinatorics and discrete Probability Combinatorics is the mathematics of count-

ing and arranging objects, and probability is the study of laws concerning the measure-
ment of random or chance events. Discrete probability focuses on situations involving
discrete sets of objects, such as finding the likelihood of obtaining a certain number of
heads when an unbiased coin is tossed a certain number of times. Skill in using combina-
torics and probability is needed in almost every discipline where mathematics is applied,
from economics to biology, to computer science, to chemistry and physics, to business
management.
algorithms and their analysis The word algorithm was largely unknown in the middle
of the twentieth century, yet now it is one of the first words encountered in the study of
computer science. To solve a problem on a computer, it is necessary to find an algorithm, or
step-by-step sequence of instructions, for the computer to follow. Designing an algorithm
requires an understanding of the mathematics underlying the problem to be solved. Deter-
mining whether or not an algorithm is correct requires a sophisticated use of mathematical
induction. Calculating the amount of time or memory space the algorithm will need in
order to compare it to other algorithms that produce the same output requires knowledge
of combinatorics, recurrence relations, functions, and O-, V-, and Q-notations.
applications and modeling Mathematical topics are best understood when they are seen
in a variety of contexts and used to solve problems in a broad range of applied situations.
One of the profound lessons of mathematics is that the same mathematical model can be
used to solve problems in situations that appear superficially to be totally dissimilar. A goal
of this book is to show students the extraordinary practical utility of some very abstract
mathematical ideas.
Special Features of This Book

international metric Version This metric version differs from the U.S. version of
Discrete Mathematics with Applications, Fifth Edition as follows: The units of measurement
PrefACe xv
used in the examples and exercises have been converted from the U.S. Customary System
(USCS) of units (also referred to as English or Imperial units) to Metric units. The appen-
dix containing solutions to selected exercises and the instructor’s solutions manual have
been converted to metric where appropriate.
mathematical reasoning The feature that most distinguishes this book from other dis-
crete mathematics texts is that it teaches—explicitly but in a way that is accessible to
first- and second-year college and university students—the unspoken logic and reason-
ing that underlie mathematical thought. For many years I taught an intensively interactive
transition-to-abstract-mathematics course to mathematics and computer science majors.
This experience showed me that while it is possible to teach the majority of students to
understand and construct straightforward mathematical arguments, the obstacles to doing
so cannot be passed over lightly. To be successful, a text for such a course must address
students’ difficulties with logic and language directly and at some length. It must also
include enough concrete examples and exercises to enable students to develop the mental
models needed to conceptualize more abstract problems. The treatment of logic and proof
in this book blends common sense and rigor in a way that explains the essentials, yet avoids
overloading students with formal detail.
spiral approach to concept development A number of concepts in this book appear in

increasingly more sophisticated forms in successive chapters to help students develop the
ability to deal effectively with increasing levels of abstraction. For example, by the time
students encounter the relatively advanced mathematics of Fermat’s little theorem in Sec-
tion 8.4, they have been introduced to the logic of mathematical discourse in Chapters 1,
2, and 3, learned the basic methods of proof and the concepts of mod and div in Chapter
4, explored mod and div as functions in Chapter 7, and become familiar with equivalence
relations in Sections 8.2 and 8.3. This approach builds in useful review and develops math-
ematical maturity in natural stages.
support for the student Students at colleges and universities inevitably have to learn a
great deal on their own. Though it is often frustrating, learning to learn through self-study
is a crucial step toward eventual success in a professional career. This book has a number
of features to facilitate students’ transition to independent learning.
Worked Examples
The book contains over 500 worked examples, which are written using a problem-
solution format and are keyed in type and in difficulty to the exercises. Many solutions
for the proof problems are developed in two stages: first a discussion of how one might
come to think of the proof or disproof and then a summary of the solution, which is
enclosed in a box. This format allows students to read the problem and skip imme-
diately to the summary, if they wish, only going back to the discussion if they have
trouble understanding the summary. The format also saves time for students who are
rereading the text in preparation for an examination.
Marginal Notes and Test Yourself Questions
Notes about issues of particular importance and cautionary comments to help students
avoid common mistakes are included in the margins throughout the book. Questions
designed to focus attention on the main ideas of each section are located between the
text and the exercises. For convenience, the questions use a fill-in-the-blank format,
and the answers are found immediately after the exercises.
xvi PrefACe
Exercises
The book contains almost 2600 exercises. The sets at the end of each section have
been designed so that students with widely varying backgrounds and ability levels will
find some exercises they can be sure to do successfully and also some exercises that
will challenge them.
Solutions for Exercises
To provide adequate feedback for students between class sessions, Appendix B
contains at least one, and often several, complete solutions for every type of exer-
cise in the book. A blue exercise number indicates that there is a solution in Ap-
pendix B; the letter H is added for a solution that is less than complete. When two
or more exercises use the same solution strategy, there is a full solution for the first
and either another full solution or a partial solution for later ones. Exercises with
several parts often have an answer and/or hint for one or more of the parts to help
students determine whether they are on track so that they can make adjustments
if needed.
Students are strongly urged not to consult solutions until they have tried their best
to answer questions on their own. Once they have done so, however, comparing their
answers with those given can lead to significantly improved understanding. There are
also plenty of exercises without solutions to help students learn to grapple with math-
ematical problems in a realistic environment.
Reference Features
Many students have written me to say that the book helped them succeed in their ad-
vanced courses. One even wrote that he had used one edition so extensively that it had
fallen apart, and he actually went out and bought a copy of the next edition, which he
was continuing to use in a master’s program. Figures and tables are included where
doing so would help readers to a better understanding. In most, a second color is used
to highlight meaning. My rationale for screening statements of definitions and theo-
rems, for putting titles on exercises, and for giving the meanings of symbols and a list
of reference formulas in the endpapers is to make it easier for students to use this book
for review in a current course and as a reference in later ones.
support for the instructor I have received a great deal of valuable feedback from in-
structors who have used previous editions of this book. Many aspects of the book have
been improved through their suggestions. In addition to the following items, there is ad-
ditional instructor support on the book’s website, described later in the preface.
Exercises
The large variety of exercises at all levels of difficulty allows instructors great free-
dom to tailor a course to the abilities of their students. Exercises with solutions in
the back of the book have numbers in blue, and those whose solutions are given
in a separate Student Solutions Manual and Study Guide have numbers that are a
multiple of three. There are exercises of every type in the book that have no answer
in either location so that instructors can assign whatever mixture they prefer of
exercises with and without answers. The ample number of exercises of all kinds
gives instructors a significant choice of problems to use for review assignments and
exams. Instructors are invited to use the many exercises stated as questions rather
than in “prove that” form to stimulate class discussion on the role of proof and coun-
terexample in problem solving.
PrefACe xvii
Flexible Sections
Most sections are divided into subsections so that an instructor can choose to cover
certain subsections only and either omit the rest or leave them for students to study on
their own. The division into subsections also makes it easier for instructors to break
up sections if they wish to spend more than one day on them.
Presentation of Proof Methods
It is inevitable that most of the proofs and disproofs in this book will seem easy to
instructors. Many students, however, find them difficult. In showing students how
to discover and construct proofs and disproofs, I have tried to describe the kinds of
approaches that mathematicians use when confronting challenging problems in their
own research.
Complete Instructor Solutions
Complete instructor solutions to all exercises are available to anyone teaching a course
from this book. They are available through the Instructor’s Companion Website.
Highlights of the Fifth Edition

The changes made for this edition are based on suggestions from colleagues and other
long-time users of previous editions, on continuing interactions with my students, and on
developments within the evolving fields of computer science and mathematics.
Reorganization
●● In response to instructor requests to move the introduction of certain topics ear-
lier in the book, Section 1.2 now includes a definition and examples of strings.
In addition, a new Section 1.4 contains definitions and examples of graphs and
includes an introduction to graph coloring and the four-color theorem.
●● The handshake theorem and its applications have been moved from Chapter 10 to
Section 4.9. This gives students an early experience of using direct and indirect
proof in a novel setting and was made possible because the elements of graph
theory are now introduced in Chapter 1.
Improved Pedagogy
●● The exposition has been reexamined throughout and carefully revised as needed.
●● Exercises have been added for topics where students seemed to need addi-
tional practice, and they have been modified, as needed, to address student
difficulties.
●● Additional hints and full answers have been incorporated into Appendix B to
give students more help for difficult topics.

●● The introductory material in Chapter 4 was made more accessible by being di-
vided into two sections. The first introduces basic concepts about proof and dis-
proof in the context of elementary number theory, and the second adds examples
and advice for writing proofs.
Logic and Applications
●● Discussion was added about the role of bound variables and scope in mathemati-
cal writing and computer programming.
●● The section on two’s complements was significantly simplified.
●● Language for expressing universal quantifiers was revised to provide a clearer
basis for the idea of the generic particular in mathematical proof.

●● The material on Boolean algebras was expanded.
xviii PrefACe
Proof and Applications

●● A greater variety of examples and exercises for number theory and set theory
proofs is now included.
●● The directions for writing proofs and the discussion of common mistakes have
been revised and expanded in response to interaction with students.

●● Discussion of historical background and recent mathematical results has been
augmented.
●● Material was added on using cryptographic hash functions to secure the trans-
mission of digital data and on using cryptography to authenticate the sender of a

transmitted message.
Induction and Recursion
●● The sections on ordinary and strong mathematical induction were reorganized
and expanded to increase the emphasis on applications.
●● In the section on recursive definitions, the format used for proofs by structural
induction was revised to parallel the format used for proofs by ordinary and
strong mathematical induction. The set of examples and exercises illustrating
recursive definitions and structural induction was significantly increased. The
recursive definition for the set of strings over a finite set and for the length of a
string were revised, and structural induction proofs for fundamental string prop-
erties are now included.
Graph Theory and the Analysis of Algorithm Efficiency
●● Instructors who wish to give their students an early experience of graph theory
can now do so by combining the introduction to graphs in Chapter 1 with the
handshake theorem in Chapter 4.
●● There is a new subsection on binary search trees in Chapter 10.
●● The discussion of O-, V-, and Q-notations was significantly simplified.
●● Many exercises on algorithm efficiency were added or revised to make the con-
cepts more accessible.
Student Resources
The Student Companion Website for this book includes:
●● A general orientation for each chapter
●● Review materials for each chapter
●● Proof tips
●● A link to the author’s personal website, which contains errata information and links
for interactive animations, tutorials, and other discrete mathematics resources on the
Internet
Instructor’s Resources
login.cengage.com
The Instructor’s Companion Website for this book contains:
●● Suggestions for how to approach the material of each chapter
●● The Complete Instructor’s Solutions Manual
●● Ideas for projects and writing assignments
●● Review materials to share with students
●● Lecture Note PowerPoint slides
●● Images from the book
PrefACe xix
A test bank of questions for exams and quizzes

●●
Migration guide from 4th to 5th edition

●●
Additional resources for the book are available at http://condor.depaul.edu/sepp.
WebAssign
www.webassign.com
WebAssign from Cengage Discrete Mathematics with Applications, Fifth Edition, Metric
Version is an online homework system, which instructors can choose to pair with the
book. For students, it offers tutorial help in solving exercises, including review of rel-
evant material, short instructional videos, and instant feedback on how they are doing.
For instructors, it offers the ability to create customized homework sets, most of which
are graded automatically and produce results directly into an online grade roster. Real-
time access to their students’ performance makes it possible for instructors to adjust the
presentation of material on an ongoing basis.
Student Solutions Manual and Study Guide

(ISBN: 978-0-357-03520-7)
In writing this book, I hoped that the exposition in the text, the worked examples, and the
exercise solutions would provide all that a student would need to successfully master the
material of the course. I continue to believe that any student who understands the solutions
for all the exercises with complete solutions in Appendix B will have achieved an excellent
command of the subject. Nonetheless, in response to requests for supplementary materials,
I developed the Student Solutions Manual and Study Guide, available separately from the
book, which contains complete solutions for all the exercises whose numbers are a multiple
of 3. The guide also includes alternative explanations for some of the concepts and review
questions for each chapter.
Organization
This book may be used effectively for a one- or two-semester course. Chapters contain
core sections, sections covering optional mathematical material, and sections covering
optional applications. Instructors have the flexibility to choose whatever mixture will
best serve the needs of their students. The following table shows a division of the sections
into categories.
Sections Containing Optional Sections Containing Optional

Chapter Core Sections Mathematical Material Computer Science Applications
1 1.1–1.3 1.4 1.4
2 2.1–2.3 2.5 2.4, 2.5
3 3.1–3.4 3.3 3.3
4 4.1–4.5, 4.7 4.6, 4.8, 4.9 4.10
5 5.1, 5.2, 5.6, 5.7 5.3, 5.4, 5.8 5.1, 5.5, 5.9
6 6.1 6.2–6.4 6.1, 6.4
7 7.1, 7.2 7.3, 7.4 7.1, 7.2, 7.4
xx PrefACe
8 8.1–8.3 8.4, 8.5 8.4, 8.5

9 9.1–9.4 9.5–9.9 9.3
10 10.1, 10.4 10.2, 10.3, 10.5 10.1, 10.4–10.6
11 11.1, 11.2 11.4 11.3, 11.5
12 12.1, 12.2 12.3 12.1–12.3
The following tree diagram shows, approximately, how the chapters of this book depend
on each other. Chapters on different branches of the tree are sufficiently independent that
instructors need to make at most minor adjustments if they skip chapters, or sections of
chapters, but follow paths along branches of the tree.
In most cases, covering only the core sections of the chapters is adequate preparation
for moving down the tree.
Acknowledgments
I owe a debt of gratitude to many people at DePaul University for their support and en-
couragement throughout the years I worked on editions of this book. A number of my col-
leagues used early versions and previous editions and provided many excellent suggestions
for improvement. For this, I am thankful to Louis Aquila, J. Marshall Ash, Allan Berele,
Jeffrey Bergen, William Chin, Barbara Cortzen, Constantine Georgakis, Sigrun Goes,
Jerry Goldman, Lawrence Gluck, Leonid Krop, Carolyn Narasimhan, Walter Pranger,
Eric Rieders, Ayse Sahin, Yuen-Fat Wong, and, most especially, Jeanne LaDuke. The
thousands of students to whom I have taught discrete mathematics have had a profound
influence on the presentation of the material in the book. By sharing their thoughts and
thought processes with me, they taught me how to teach them better. I am very grateful for
their help. I owe the DePaul University administration, especially deans, Charles Suchar,
Michael Mezey, and Richard Meister, a special word of thanks for considering the writing
of this book a worthwhile scholarly endeavor.
My thanks go to the reviewers for their valuable suggestions for this edition of the
book: Naser Al-Hasan, Newberry College; Linda Fosnaugh, Midwestern State Univer-
*
Section 8.3 is needed for Section 12.3 but not for Sections 12.1 and 12.2.
PrefACe xxi
sity; Robert Gessel, University of Akron; Juan Henriquez, University of New Orleans;
Amy Hlavacek, Saginaw Valley State University; Kevin Lillis, Saint Ambrose University;
Ramón Mata-Toledo, James Madison University; Bin Shao, University of San Francisco;
Charles Qiao Zhang, Texas Christian University; and Cathleen Zucco-Teveloff, Rowan
University. For their help with previous editions of the book, I am grateful to David Addis,
Texas Christian University; Rachel Esselstein, California State University-Monterrey Bay;
William Marion, Valparaiso University; Michael McClendon, University of Central Okla-
homa; Steven Miller, Brown University; Itshak Borosh, Texas A & M University; Douglas
M. Campbell, Brigham Young University; David G. Cantor, University of California at Los
Angeles; C. Patrick Collier, University of Wisconsin-Oshkosh; Kevan H. Croteau, Francis
Marion University; Irinel Drogan, University of Texas at Arlington; Pablo Echeverria,
Camden County College; Henry A. Etlinger, Rochester Institute of Technology; Melvin
J. Friske, Wisconsin Lutheran College; William Gasarch, University of Maryland; Ladnor
Geissinger, University of North Carolina; Jerrold R. Griggs, University of South Carolina;
Nancy Baxter Hastings, Dickinson College; Lillian Hupert, Loyola University Chicago;
Joseph Kolibal, University of Southern Mississippi; Benny Lo, International Technologi-
cal University; George Luger, University of New Mexico; Leonard T. Malinowski, Finger
Lakes Community College; John F. Morrison, Towson State Unviersity; Paul Pederson,
University of Denver; George Peck, Arizona State University; Roxy Peck, California Poly-
technic State University, San Luis Obispo; Dix Pettey, University of Missouri; Anthony
Ralston, State University of New York at Buffalo; Norman Richert, University of Houston-
Clear Lake; John Roberts, University of Louisville; and George Schultz, St. Petersburg
Junior College, Clearwater. Special thanks are due John Carroll, San Diego State Univer-
sity; Dr. Joseph S. Fulda; and Porter G. Webster, University of Southern Mississippi; Peter
Williams, California State University at San Bernardino; and Jay Zimmerman, Towson
University for their unusual thoroughness and their encouragement.
I have also benefitted greatly from the suggestions of the many instructors who have
generously offered me their ideas for improvement based on their experiences with pre-
vious editions of the book, especially Jonathan Goldstine, Pennsylvania State University;
David Hecker, St. Joseph’s University; Edward Huff, Northern Virginia Community
College; Robert Messer, Albion College; Sophie Quigley, Ryerson University; Piotr
Rudnicki, University of Alberta; Anwar Shiek, Dine College; Norton Starr, Amherst
College; Eng Wee, National University of Singapore; Doug Hogan, University of Illinois
at Chicago; James Vanderhyde, Benedictine University; Ali Shaqlaih, University of North
Texas at Dallas; Sam Needham, Diablo Valley College; Mohamed Aboutabl and Ramon
A. Mata-Toledo, James Madison University; Larry Russ, Stevens Institute of Technology;
Tomas Klos, Delft University; Margaret McQuain, Virginia Polytechnic Institute and State
University; J. William Cupp, Indiana Wesleyan University; Jeffrey Mank, Framingham
State University; Or Meir, University of Haifa; Audrey Julia Walegwa Mbogho, Pwani
University, Kenya; Nariman Ammar, Birzeit University; Joshua T. Guerin, University
of Tennessee at Martin; Jici Huang, Montana State University; Jerry Shi, University of
Connecticut; Phuc Duong, Ton Duc Thang University, Vietnam; Abdul Rehman Abid, Iqra
University, Pakistan; Yogesh More, SUNY Old Westbury; Mark Kaplan, Towson State
University; Eric Neufeld, University of Saskatchewan; and Jeremy Tucker, Montana State
University. Production of the third edition received valuable assistance from Christopher
Novak, University of Michigan, Dearborn, and Ian Crewe, Ascension Collegiate School.
For the third and fourth editions I am grateful for the many excellent suggestions for
improvement made by Tom Jenkyns, Brock University, and for the fifth edition I am
indebted to Roger Lipsett for his knowledgeable and careful attention to detail. I am also
extremely grateful for the many appreciative messages I have received from students who
have used previous editions of the book. They have inspired me to continue to find ever
xxii PrefACe
better ways to meet their needs in this edition, and I thank them for making the effort to
contact me.
I owe many thanks to the Cengage staff, especially my editors, Laura Gallus, Mona
Zeftel, Lynh Pham, and Spencer Arritt, for their thoughtful advice and reassuringly
calm direction of the production process, and my previous editors, Dan Seibert, Stacy
Green, Robert Pirtle, Barbara Holland, and Heather Bennett, for their encouragement
and enthusiasm.
The older I get the more I realize the profound debt I owe my own mathematics teach-
ers for shaping the way I perceive the subject. My first thanks must go to my husband,
Helmut Epp, who, on a high school date (!), introduced me to the power and beauty of the
field axioms and the view that mathematics is a subject with ideas as well as formulas and
techniques. In my formal education, I am most grateful to Daniel Zelinsky and Ky Fan at
Northwestern University and Izaak Wirszup, I. N. Herstein, and Irving Kaplansky at the
University of Chicago, all of whom, in their own ways, helped lead me to appreciate the
elegance, rigor, and excitement of mathematics.
To my family, I owe thanks beyond measure. I am grateful to my mother, whose keen
interest in the workings of the human intellect started me many years ago on the track that
led ultimately to this book, and to my father, whose devotion to the written word has been
a constant source of inspiration. I thank my children and grandchildren for their affection
and cheerful acceptance of the demands this book has placed on my life. And, most of all,
I am grateful to my husband, who for many years has encouraged me with his faith in the
value of this project and supported me with his love and his wise advice.
Susanna Epp
Chapter 1 SPEAKING
MATHEMATICALLY
Therefore O students study mathematics and do not build

without foundations. —Leonardo da Vinci (1452–1519)
The aim of this book is to introduce you to a mathematical way of thinking that can serve
you in a wide variety of situations. Often when you start work on a mathematical prob-
lem, you may have only a vague sense of how to proceed. You may begin by looking at
examples, drawing pictures, playing around with notation, rereading the problem to focus
on more of its details, and so forth. The closer you get to a solution, however, the more
your thinking has to crystallize. And the more you need to understand, the more you need
language that expresses mathematical ideas clearly, precisely, and unambiguously.
This chapter will introduce you to some of the special language that is a foundation
for much mathematical thought, the language of variables, sets, relations, and functions.
Think of the chapter like the exercises you would do before an important sporting event.
Its goal is to warm up your mental muscles so that you can do your best.
1.1 Variables
A variable is sometimes thought of as a mathematical “John Doe” because you can use it
as a placeholder when you want to talk about something but either (1) you imagine that it
has one or more values but you don’t know what they are, or (2) you want whatever you
say about it to be equally true for all elements in a given set, and so you don’t want to be
restricted to considering only a particular, concrete value for it. To illustrate the first use,
consider asking
Is there a number with the following property: doubling it and adding 3
gives the same result as squaring it?
In this sentence you can introduce a variable to replace the potentially ambiguous
word “it”:
Is there a number x with the property that 2x 1 3 5 x2?
The advantage of using a variable is that it allows you to give a temporary name to what
you are seeking so that you can perform concrete computations with it to help discover its
possible values. To emphasize the role of the variable as a placeholder, you might write the
following:
Is there a number n with the property that 2? n 1 3 5 n 2?
The emptiness of the box can help you imagine filling it in with a variety of different val-
ues, some of which might make the two sides equal and others of which might not.
1
2 CHAPTEr 1 SPEAKING MATHEMATICALLY
In this sense, a variable in a computer program is similar to a mathematical variable

because it creates a location in computer memory (either actual or virtual) into which
values can be placed.
To illustrate the second use of variables, consider the statement
No matter what number might be chosen, if it is greater than 2, then its
square is greater than 4.
In this case introducing a variable to give a temporary name to the (arbitrary) number you
might choose enables you to maintain the generality of the statement, and replacing all in-
stances of the word “it” by the name of the variable ensures that possible ambiguity is avoided:
No matter what number n might be chosen, if n is greater than 2, then
n2 is greater than 4.
Example 1.1.1 Writing Sentences Using Variables

Use variables to rewrite the following sentences more formally.
a. Are there numbers with the property that the sum of their squares equals the square of
their sum?
b. Given any real number, its square is nonnegative.
Solution
Note In part (a) the a. Are there numbers a and b with the property that a2 1 b2 5 (a 1 b)2?
answer is yes. For Or: Are there numbers a and b such that a2 1 b2 5 (a 1 b)2?
instance, a 5 1 and b 5 0 Or: Do there exist any numbers a and b such that a2 1 b2 5 (a 1 b)2?
would work. Can you
think of other numbers b. Given any real number r, r 2 is nonnegative.
that would also work? Or: For any real number r, r2 $ 0.
Or: For every real number r, r2 $ 0. ■
Some Important Kinds of Mathematical Statements

Three of the most important kinds of sentences in mathematics are universal statements,
conditional statements, and existential statements:
A universal statement says that a certain property is true for all elements in a set.
(For example: All positive numbers are greater than zero.)
A conditional statement says that if one thing is true then some other thing also
has to be true. (For example: If 378 is divisible by 18, then 378 is divisible by 6.)
Given a property that may or may not be true, an existential statement says that
there is at least one thing for which the property is true. (For example: There is a
prime number that is even.)
In later sections we will define each kind of statement carefully and discuss all of them
in detail. The aim here is for you to realize that combinations of these statements can be
expressed in a variety of different ways. One way uses ordinary, everyday language and
another expresses the statement using one or more variables. The exercises are designed to
help you start becoming comfortable in translating from one way to another.
1.1 VArIAbLES 3
Universal Conditional Statements

Universal statements contain some variation of the words “for every” and conditional
statements contain versions of the words “if-then.” A universal conditional statement is
a statement that is both universal and conditional. Here is an example:
For every animal a, if a is a dog, then a is a mammal.
One of the most important facts about universal conditional statements is that they can be
rewritten in ways that make them appear to be purely universal or purely conditional. For
example, the previous statement can be rewritten in a way that makes its conditional nature
explicit but its universal nature implicit:
If a is a dog, then a is a mammal.
Or: If an animal is a dog, then the animal is a mammal.
The statement can also be expressed so as to make its universal nature explicit and its
conditional nature implicit:
For every dog a, a is a mammal.
Or: All dogs are mammals.
The crucial point is that the ability to translate among various ways of expressing univer-
sal conditional statements is enormously useful for doing mathematics and many parts of
computer science.
Example 1.1.2 rewriting a Universal Conditional Statement

Fill in the blanks to rewrite the following statement:
For every real number x, if x is nonzero then x2 is positive.
a. If a real number is nonzero, then its square .

Note If you introduce x b. For every nonzero real number x, .
in the first part of the sen-
c. If x , then .
tence, be sure to include it
in the second part of the d. The square of any nonzero real number is .
sentence.
e. All nonzero real numbers have .
Solution
a. is positive
b. x2 is positive
c. is a nonzero real number; x2 is positive
d. positive
e. positive squares (or: squares that are positive) ■
Universal Existential Statements

A universal existential statement is a statement that is universal because its first part says
Note For a number b to that a certain property is true for all objects of a given type, and it is existential because its
be an additive inverse for second part asserts the existence of something. For example:
a number a means that
a 1 b 5 0. Every real number has an additive inverse.
4 CHAPTEr 1 SPEAKING MATHEMATICALLY
In this statement the property “has an additive inverse” applies universally to all real num-
bers. “Has an additive inverse” asserts the existence of something—an additive inverse—
for each real number. However, the nature of the additive inverse depends on the real
number; different real numbers have different additive inverses. Knowing that an additive
inverse is a real number, you can rewrite this statement in several ways, some less formal
and some more formal:*
All real numbers have additive inverses.
Or: For every real number r, there is an additive inverse for r.
Or: For every real number r, there is a real number s such that s is an
additive inverse for r.
Introducing names for the variables simplifies references in further discussion. For in-
stance, after the third version of the statement you might go on to write: When r is positive,
s is negative, when r is negative, s is positive, and when r is zero, s is also zero.
One of the most important reasons for using variables in mathematics is that it gives you
the ability to refer to quantities unambiguously throughout a lengthy mathematical argu-
ment, while not restricting you to consider only specific values for them.
Example 1.1.3 rewriting a Universal Existential Statement

Fill in the blanks to rewrite the following statement: Every pot has a lid.
a. All pots .
b. For every pot P, there is .
c. For every pot P, there is a lid L such that .
Solution
a. have lids
b. a lid for P
c. L is a lid for P ■
Existential Universal Statements

An existential universal statement is a statement that is existential because its first part
asserts that a certain object exists and is universal because its second part says that the
object satisfies a certain property for all things of a certain kind. For example:
There is a positive integer that is less than or equal to every positive integer.
This statement is true because the number one is a positive integer, and it satisfies the
property of being less than or equal to every positive integer. We can rewrite the statement
in several ways, some less formal and some more formal:
Some positive integer is less than or equal to every positive integer.
Or: There is a positive integer m that is less than or equal to every
positive integer.
Or: There is a positive integer m such that every positive integer is
greater than or equal to m.
Or: There is a positive integer m with the property that for every
positive integer n, m # n.
*A conditional could be used to help express this statement, but we postpone the additional complexity to a
later chapter.
1.1 VArIAbLES 5
Example 1.1.4 rewriting an Existential Universal Statement

Fill in the blanks to rewrite the following statement in three different ways:
There is a person in my class who is at least as old as every person in
my class.
a. Some is at least as old as .
b. There is a person p in my class such that p is .
c. There is a person p in my class with the property that for every person q in my class,
p is .
Solution
a. person in my class; every person in my class
b. at least as old as every person in my class
c. at least as old as q ■
Some of the most important mathematical concepts, such as the definition of limit of a
sequence, can only be defined using phrases that are universal, existential, and conditional,
and they require the use of all three phrases “for every,” “there is,” and “if-then.” For
example, if a1, a2, a3, Á is a sequence of real numbers, saying that
the limit of an as n approaches infinity is L
means that
for every positive real number «, there is an integer N such that
for every integer n, if n . N then 2« , an 2 L , «.
TEST YoUrSELf
answers to test Yourself questions are located at the end of each section.
1. A universal statement asserts that a certain property 3. Given a property that may or may not be true,
is for . an existential statement asserts that for
which the property is true.
2. A conditional statement asserts that if one
thing then some other thing .
ExErCISE SET 1.1

Appendix B contains either full or partial solutions to all exercises with blue numbers. When the solution is not complete,
the exercise number has an “H” next to it. A “*” next to an exercise number signals that the exercise is more challenging
than usual. Be careful not to get into the habit of turning to the solutions too quickly. Make every effort to work exercises
on your own before checking your answers. See the Preface for additional sources of assistance and further study.
In each of 1–6, fill in the blanks using a variable or variables a. Is there an integer n such that n has ?
to rewrite the given statement. b. Does there exist such that if n is divided
by 5 the remainder is 2 and if ?
1. Is there a real number whose square is 21?
a. Is there a real number x such that ? Note: There are integers with this property. Can you
b. Does there exist such that x2 5 21? think of one?
2. Is there an integer that has a remainder of 2 when 3. Given any two distinct real numbers, there is a
it is divided by 5 and a remainder of 3 when it is real number in between them.
divided by 6?
Another random document with
no related content on Scribd:
gentilz hommez, pour famme, je ne sçay se elle fu vraie ou non, et
d’otel mort comme li dessus noummet, lesquelx on noummoit
messires Henris de Malatrait, messire Guillaumme Bacons, li sirez
de Roche Tisson et messires Richars de Perssi, tout rice homme et
gentil homme durement et de Normendie: dont vous devés savoir
que il despleut grandement à leurs prochains, car encore avoecq
tout che li roys de Franche saisi leurs terrez et maintint que il lez
avoient fourfaittez. De quoy li sirez de Clichon avoit ung jonne
escuier à fil, que on appelloit Olivier. Chilz se traist tantost en
Hainbon avoecq monseigneur Amauri de Clichon, son oncle, et le
jone dammoisiel de Montfort, liquel, quant il vinrent en eage, fissent
depuis très forte guerre en Bretaingne et en Franche, en
contrevengant les mors de leurs pèrez, car voirz fu que li comtez de
Montfort estoit mors ou castiel dou Louvre à Paris. Fº 79 vº.
—Ms. de Rome: Ensi se portèrent, en che temps dont je parole,
les querelles en Bretagne, et se desrompirent ces grans assamblées
sans bataille et sans riens faire. Et prist li rois d’Engleterre congiet à
la contesse de Montfort, et puis entra en sa navie et retourna en
Engleterre, et en remena toutes ses gens. Et esploita tant, par le
plaisir de Dieu et dou vent, que sa navie, sans peril et sans damage,
prissent terre à Pleumude en Engleterre. Et estoit conme prisonniers
en la compagnie dou roi messires Hervis de Lion, et fu amenés en
Engleterre; et qant il fu là venus, recreus courtoisement sus sa foi et
mis en la chité de Londres, et pooit partout aler et venir à sa
plaisance. Aultre constrainte de prison ne li fu faite.
Qant ces coses furent apaisies, et tout chil signeur retrais en lors
lieus, et se tenoient bien ces trieuves en Bretagne entre mesire
Carle de Blois et la contesse et lors gens, ne nuls ne les enfrandoit
ne brisoit, grandes nouvelletés et pités et grans rachines de tous
mauls avinrent ou roiaulme de France. Pluisseur hault baron et
chevalier de Bretagne et de Normendie, et qui loiaument s’estoient
acquité et porté ens ès gerres de Bretagne de la partie des François,
à l’avis et renonmée de tous ceuls qui ensonniiet s’en estoient, ne
qui parler en savoient, furent acuset de trahison, de laquelle
accusation on ot grant mervelle. Et ne s’en porent onques chil
escuser ne purger, qui accuset furent, et les en couvint morir
honteusement: dont tous li linages de ceuls furent grandement
courouchiet, et premiers, li sires de Cliçon, liquels fu en son temps
uns vaillans et loiaus chevaliers, et ne l’avoit on veu en nulle
defaute. Mais, pour le temps dont je parole, li cours de France estoit
si perilleuse à poursievir que li signeur ne s’i savoient conment avoir;
et se laisoient li rois Phelippes et son fil, li dus de Normendie, trop
legierement enfourmer. Et pour ce temps, il i avoit une roine en
France, mère dou roi Jehan, et qui fille avoit esté dou duch de
Bourgongne, trop crueuse fenme, car qui que elle encargoit en
haine, il estoit mors sans merchi. Et son fil, li dus Jehans de
Normendie, qui puis fu rois de France, tint assés de ses oppinions et
resgna hausterement, et fist faire moult de crueuses justices en son
temps. Par quoi li roiaulmes de France, par toutes ses parties, en fu
si grevés et si batus et si persequtés que, deus cens ans à venir, les
traces i parurent, ensi que vous orés recorder avant en l’istore.
Avoecques le signeur de Cliçon qui fu decolés à Paris, et voellent
bien li auqun maintenir que ce fu par envie, pour tant que li rois
d’Engleterre l’avoit delivré de prison, et il avoit retenu messire Hervi
de Lion, furent accuset de traison et mort et exequté à Paris li sires
de Malatrait et ses fils, li sires d’Avaugor et ses fils, mesires Tiebaus
de Montmorillon et jusques à diis chevaliers que barons de
Bretagne, et avoecques ceuls, quatre moult hauls gentils honmes de
Normendie, et liquel estoient aussi de grant linage en Bretagne, loist
à savoir mesire Henri de Malatrait, messires Guillaumes Bacons, li
sires de Roce Tison et li sires de Montboucier. Et n’i eut baron ne
chevalier en France, de leur linage, qui osast aler au devant ne dire:
«C’est mal fait,» tant estoient adonc les coses crueuses et
felenesces. Fº 94 vº.
P. 35, l. 20: li hayne.—Mss. A 1 à 33: l’envie. Fº 109.
P. 36, l. 12: d’Avaugor.—Mss. A 1 à 6, 23 à 33: de Vangour, de
Wangour. Fº 109.—Mss. A 7, 11 à 19: de Vaugour. Fº 104.—Mss. A
8, 20 à 22: d’Avaugor, d’Avaugoure. Fº 100.
P. 36, l. 13: Morillon.—Mss. A 1 à 6, 8 à 14: Montmorillon. Fº 108.
—Mss. A 20 à 22: Montarillon. Fº 161.
P. 36, l. 14: jusques à dix.—Ms. B 6: jusques à quatorse. Fº 235.
P. 36, l. 19: Roce Tison.—Mss. A 1 à 6, 8 à 19, 23 à 33: Roche
Tesson, la Roche Tesson. Fº 109.—Mss. A 7, 20 à 22: Roche
Tisson, Roche Tison. Fº 104.
§ 203. P. 37, l. 1: En ce temps.—Ms. d’Amiens: En ce tamps vint

en pourpos et en vollenté au roy Edouwart d’Engleterre que il feroit
refaire et redefiier le grant castiel de Windesore, que li roys Artus fist
jadis faire et fonder là où premierement fu coumenchie et estorée la
noble Table Reonde, dont tant de bons chevaliers yssirent par le
monde, et feroit li roys une ordonnance de chevaliers de lui et de ses
enffans et des plus preus de sa terre, et seroient en somme jusques
à quarante, et lez nommeroit on les chevaliers du Bleu Gertier, et le
feste d’an en an le jour Saint Gorge. Et pour ceste feste
coummenchier, li roys englès asambla de tout son pays comtes,
barons, chevaliers, et leur dist sen entention et le grant desir que il
avoit de le feste emprendre; se li acordèrent liement. Et là furent
esleu quarante chevalier, par avis et par renommée lez plus preux
de tous lez autres; et saielèrent par foy et par sierment avoecq le roy
à tenir et à pourssuiwir le feste et lez ordonnanches telles que elles
en estoient accordées. Et fist li rois fonder et edefiier une cappelle
de saint Jorge ou castiel de Windesore, et estaubli et mist
chanonnes pour Dieu servir, et les arenta et aprouvenda bien. Et
pour ce que la feste fuist sceue et conneuwe par touttez marches, li
roys englès l’envoya publiier et denunchier par ses hiraux en
Franche, en Escoce, en Bourgoingne, en Flandres, en Braibant, en
Allemaingne et par tout jusqu’en Lombardie; et donnoit à tous
chevaliers et escuiers qui venir y volroient, quinze jours de sauf
conduit apriès le feste. Et devoit estre ceste feste une joustez de
quarante chevaliers dedens atendans [tous autres] et de quarante
escuiers, et seoir, le jour Saint Jorge prochain venant que on
compteroit l’an mil trois cens quarante quatre, ens ou castiel de
Windesore. Et devoit estre la roynne d’Engleterre acompaignie de
trois cens dammes et dammoiselles, tout pour son corps, touttes
noblez et gentilz dammez, et parées d’uns paremens sannables. Fos
79 vº et 80.
—Ms. de Rome: En ce temps vint en pourpos et en volenté au roi
d’Engleterre de faire redefiier le grant chastiel de Windesore, lequel
li rois Artus fist jadis faire et fonder, et là où premierement la Table
Reonde fu conmenchie, dont tant de bons et vaillans chevaliers
issirent et travillièrent en armes et en proèces par le monde; et feroit
li dis rois une ordenance de chevaliers de li et de ses enfans et des
plus preus et renonmés d’Engleterre et d’autres pais aussi, qui
estoient en son service, et seroient en sonme jusques à quarante, et
seroient nonmé li chevalier dou Bleu Gertier, et porteroient tous jours
continuelment en lor senestre jambe une ordenance dou Bleu
Gertier, et feroit faire et edefiier en l’onnour de Dieu et de saint
Gorge une capelle ou chastiel de Windesore, et le jour Saint Gorge
seroient tout li chevalier à la feste qui bonnement i poroient estre, et
là aueroit douse chanonnes bien aprouvendés qui feroient le service
de Dieu et priieroient pour les chevaliers de l’ordenance dou Bleu
Gertier. Qant la promotion de ceste feste faire vint en avis au roi
d’Engleterre, il manda une partie des nobles de son roiaulme, et
qant il furent venu, il leur dist son intension: «Il me vient en plaisance
et en devotion, de faire une ordenance en l’onnour de Dieu et de
saint Gorge par tèle et tèle manière;» et se leur compta tout au lonc
la matère et ordenance de l’emprise, ensi que ichi desus vous l’avés
oï. Li baron et li chevalier, qui là estoient à ce recort, s’i acordèrent et
dissent que che seroit bien fait. Ensi fu la feste de saint Gorge ens
ou chastiel de Windesore edefiie et conmenchie, et la capelle des
douse chanonnes tantos pourjettée. Et ausi fu li grans ouvrages dou
chastiel de Windesore conmenchiés et pourjettés à manière de un
grant palais de salles, de cambres et de toutes ordenances, si
plentiveusement que pour logier le roi et son estat, et la roine et son
estat, et les prelas, barons et chevaliers d’Engleterre, et tout à lor
aise. Et encores demoroient tout li viel ouvrage entier, qui
comprendoient grant fuisson, le dongnon de Windesore et les
cambres et le grande sale où li rois Artus faisoit au temps de son
resgne son tinel et tenoit son estat de chevaliers aventureus, de
dames et de damoiselles. Et pour avanchier les ouvrages de
Windesore, qui furent empris pour faire et conmenchiet l’an de grace
mille trois cens et quarante trois, ouvrier furent envoiiet querre parmi
tout le roiaulme d’Engleterre, et mis en oeuvre et paiiet et delivret au
samedi. Et eurent chil ouvrier un clerc qui entendoit sus euls et qui
les faisoit paiier, lequel on appella Willaume Wiqam. Et chils fu
depuis si grans mestres en Engleterre que evesques et canceliers,
et se passoient toutes coses par lui, et fu tellement en la grace dou
roi que par lui, son temps durant, fu tout fait en Engleterre, et sans li
n’estoit riens fait.
En celle edification de feste qui fu emprise sus la fourme que je
vous di, ot ou chastiel de Windesore joustes solempnèles de
chienqante chevaliers et de chienqante esquiers dedens. Et fu la
feste prononchie et criie et segnefiie par hiraus ens ou roiaulme
d’Escoce, en Alemagne, en Flandres, en Hainnau, en Braibant et
ens ès marces d’Aquitainnes. Et fu la roine Phelippe d’Engleterre,
acompagnie de deus cens dames nobles, parées et bien vesties, si
ricement conme elles pooient estre. Et avoit pour lors li fils dou roi
Edouwart d’Engleterre, Edouwars, li ainnés de tous ses enfans,
trèse ans d’eage ou environ, et fu là à celle feste creés et nonmés
prinches de Galles; et l’en fu baillie la signourie et aministration, et
en tint et entra lors en l’estat, et sera en avant nonmés prinches de
Galles. Li contes de Hainnau et son oncle, li sires de Biaumont,
furent mandé et priiet pour estre à celle feste et de l’ordenance dou
Bleu Gertier, mais point n’i furent, car il estoient ensonniiet aillours;
mais li sires d’Enghien, li sires de Haverec et li sires de
Gonmegnies, messires Oulfars de Ghistelles et pluisseur aultre i
furent. Et furent ces festes continuées en joies et en esbatemens, en
dons et en larguèches, car li rois Edouwars d’Engleterre et la roine
Phelippe sa fenme, en lors temps, furent moult large en dons et
courtois et plentiveus dou lour, et sceurent moult bien acquerir
l’amour et la grace de toutes gens. Fº 95.
§ 204. P. 38, l. 12: Entrues que.—Ms. d’Amiens: Entroes que li

roys englès faissoit son grant appareil pour recepvoir seigneurs,
dammes et dammoiselles qui à se feste venroient, li vinrent les
certainnes nouvellez de le mort monsigneur Olivier de Clichon et des
autres chevaliers desus nommés, encouppés de fauseté et de
traisson. De ces nouvellez fu li roys englès durement courouciés, et
li sambla que li roys de Franche l’ewist fait en son despit, et tint que,
parmy ce fait, les trieuwes acordées en Bretaingne estoient fallies et
brisies de par le dit roy Phelippe. Si eut en penssée de faire le
samblant fait del corps monseigneur Hervy de Lyon, que il tenoit
pour son prisonnier; et fait l’ewist en son irour et tantost, es ne fust
ses cousins li comtes Derbi qui li blamma durement et li moustra
devant son consseil tant de bellez raissons pour sen onneur garder
et son corage afrenner, et li pria souverainnement que il volsist
mettre le chevalier à raenchon soufissant et raisonnable, ensi que il
volroit que on fesist des siens en cas sannable. Il fu avis au roy que
ses cousins li comtez Derbi le conssilloit loyaument, et que tout ce
que il en disoit et prioit, il li venoit de grant gentilèce et noblèce de
coer; si refrenna son corrage et s’i acorda, et manda le dit
monseigneur Hervi par devant lui, liquel, sachiéz, y vint en grant
paour; car il cremmoit et supposoit que on le deuist mettre à mort
villainnement, ensi que on l’en avoit enfourmet. Quant li roys le vit
devant lui, il li dist: «Ha! messire Hervy, messire Hervy, li roys
Phelippes de Vallois a moustret se felonnie trop crueusement, quant
il a fait mettre à si villainne mort en mon despit et à grant tort si
nobles chevaliers, par famme et par fausses souppechons, comme
estoient li sirez de Clichon, li sires d’Avaugor, li sirez de Malatrait, li
sires de Roche Tisson et li autre de Bretaingne et de Normendie,
dont chacuns homs doit avoir pité. Et se je volloie regarder à se
fellonnie, je feroie de vous le sannable cas; car vous m’avés fait plus
de contraires en Bretaingne que nulx autres, mès je m’en soufferay
et li lairay faire ses vollentés, et garderay men honneur à mon pooir.
Et vous laisseray venir à raenchon legière et gracieuse seloncq
vostre estat, pour l’amour de mon cousin le comte Derbi qui chi est,
qui en a priiet, mès que vous voeilliés faire chou que je diray.»
Li chevaliers eut grant joie, quant il entendi qu’il n’aroit garde de
mort; si dist que il feroit vollentiers à son pooir tout ce que li
coummanderoit. Lors li dist li roys ensi: «Messire Hervy, je say bien
que vous estes ungs dez rices chevaliers de Bretaingne, et que je
aroie bien de vous une mout grant ranchon, se je vous volloie
presser, de trente mil escus et plus. Si diray que vous ferés: vous
yrés deviers le roy Phelippe de Vallois et li dirés de par moy que,
pour tant qu’il a mis à mort villainne si gentilz chevaliers comme chil
estoient et en men despit, je di et voeil porter oultre qu’il a enfraint et
brisiet les trieuwes, ce me samble, que nous avions enssamble; si y
renunche de mon costet et le deffie de ce jour en avant. Et
coumment que je sace veritablement que vous me paieriez bien
trente mil escus, je vous laisseray quitte pour dix mil escus, et les
vous creray sus vo foy à renvoiier à Londrez dedens quatre mois, ou
de revenir tenir prison.»—«Monseigneur, dist li chevaliers, Dieux
vous voeille merir le courtoisie que vous me faittez, et à
monseigneur le comte Derbi ossi. Et sachiés, monseigneur, que
vostre messaige feray je vollentiers, et le raenchon paieray dedens
le jour, et le vous meteray en sauf lieu à Bruges, et il vous
souffisse.» Dist li roys: «Il me plaist bien.»
Depuis ne demora mies plenté que li chevaliers tous joians
ordonna ses besoingnes pour partir. Et quant il fu prês, il vint
prendre congiet au roy, liquelx roys li dounna vollentiers, et li dist
encorrez enssi: «Monseigneur Hervi, nonobstant che que vos rois
m’ait courchiet et à son tort, et que par vous je li mande deffianchez,
vous dirés à tous chevalierz et escuiers de par delà que pour ce il ne
laissent mies à venir à nostre feste; car il y seront volentiers veus et
liement recheu, et n’y aront point de dammaige.»—«Sire, che
respondi messires Hervi, je feray tout ce que vous me
coummandés.» Lors se parti messires Hervi dou roy et s’en vint à
Douvrez, et là monta en mer pour venir à Bouloingne. Mès adonc
uns tempestes et fortunne le prist sour mer, si grande qu’il le couvint
sejourner sus l’aige et en grant peril tous les jours l’espasse de cinq
jours. Et fu si tourmentés et si demenés de la mer, que noient il
n’avoit apris, que une maladie le prist, de laquelle il morut à Paris
assés tost apriès ce qu’il eut fait son messaige, et parmy tant il fu
quittes de sa raenchon. Fº 80.
—Ms. de Rome: En ceste feste durant, vinrent au roi d’Engleterre
les certainnes nouvelles de la mort le signeur de Cliçon, et des
aultres chevaliers desus nonmés, accusés en France de fauseté et
de trahison. De ces nouvelles fu li rois d’Engleterre durement
courouchiés, et li sambla que li rois de France l’euist fait en son
despit, et tint que parmi ce fait les trieuwes acordées et données
devant Vennes en Bretagne estoient enfraintes et brisies. Si eut en
pensée et imagination de faire le parel fait dou corps mesire Hervi de
Lion, que il tenoit pour son prisonnier; et fait l’euist en sen irour et
tantos, se n’euist esté son cousin li contes Derbi, qui l’en reprist
durement et li remoustra devant son consel tant de belles raisons
pour son honnour garder et son corage affrener, que riens n’en fu
fait. Mais avint que tantos apriès la feste passée, et les signeurs et
les dames retrais et retournés en lors lieus, li rois d’Engleterre vint à
Wesmoustier, car là ot un grant parlement des nobles de son pais,
pour avoir consel sus l’estat de ses besongnes.
Ce parlement seant, li rois d’Engleterre, en la presence des
signeurs, fist venir mesire Hervi de Lion devant lui, et li dist ensi:
«Ha! messire Hervi! messire Hervi! mon adversaire Phelippe de
Valois a moustré sa felonnie trop crueusement, qant il a fait morir
vilainnement tels chevaliers que le signeur de Cliçon et tels et tels»
(et li nonma par noms, ensi conme il en estoit enfourmés), «laquelle
cose me desplaist grandement, et samble à auquns de ma partie, et
à moi aussi, que il l’a fait en mon despit. Et se je voloie regarder à sa
felonnie, je feroie de vous le samblable cas, et trueve bien qui le me
conselle; car vous m’avés fait plus de contraires en Bretagne, et à
mes gens, que nuls aultres chevaliers. Mais je m’en soufferai et li
laisserai faire ses volentés, et li osterai ce point inraisonnable et
garderai mon honnour, et vous laisserai passer parmi courtoise
raençon et legière, selonch vostre estat, pour l’amour de mon cousin
le conte Derbi, qui chi est, qui en a priiet bien acertes, mais que vous
voelliés faire ce que je vous dirai.» Li chevaliers fu tous resjois et se
reconforta en soi meismes, qant il entendi que il n’aueroit garde de
mort. Si respondi en li humeliant: «Très chiers sires, je ferai à mon
pooir loiaument tout ce que vous me conmanderés.» Lors dist li rois:
«Mesire Hervi, je sçai bien que vous estes uns des rices chevaliers
de Bretagne et que, se je vous voloie presser, vous paiieriés bien
trente mille ou quarante mille esqus. Je vous dirai que vous ferés.
Vous irés deviers mon adversaire Phelippe de Valois et li dirés de
par moi que, pour tant que il a mis à mort vilainne si vaillans
chevaliers et si gentils que chil estoient, de Bretagne et de
Normendie, en mon despit, je di et voel porter oultre que il a enfraint
et brisiet les trieuves que nous avions ensamble: si i renonche de
mon costé et le deffie de ce jour en avant. Et parmi tant que vous
ferés ce message, je vous laisserai passer sus diis mille esqus que
paierés ou envoierés en la ville de Bruges, cinq mois apriès ce que
vous auerés rapasset la mer.»
Li chevaliers remercia le roi de ceste parole et le tint à grant
courtoisie, et ordonna ses besongnes dou plus tos qu’il peut, et se
departi de Londres et vint à Douvres. Et là monta en mer et prist le
cemin pour venir à Boulongne; mais sus la mer li vens li fu si
contraires, et ot ils et sa compagnie tant de fortunes et de
tempestes, que il furent cinq jours sus la mer. Au sisime, il prissent
terre au Crotoi, et de là il vinrent à Abeville. Mesires Hervis de Lion
fu si grevés de la mer que il ne pot souffrir le cevauchier, et fu mis en
une litière et ensi amenés à Paris. Li là venu, il ala deviers le roi
Phelippe, et fist le message dont il estoit cargiés. Point n’i ot de
defaute, et s’aquita deviers le roi d’Engleterre de tous poins, et au
retour il s’alita à Angiers et là morut. Ensi avint de mesire Hervi de
Lion.
Li sires de Cliçon, qui fu decolés à Paris, avoit fil et fille. Le fil, on
l’envoia en Engleterre, et le retint li rois et le mist avoecques le jone
conte de Montfort. Et tout doi furent de la delivrance et ordenance
dou conte Derbi, car li rois de France, avoecques ce que il osta la
vie au signeur de Cliçon, il saisi tous ses hiretages de Bretagne et
de Poito, et les donna et departi aillours à sa plaisance. Fos 95 vº
et 96.
P. 39, l. 17: Malatrait.—Le ms. B 6 ajoute: le signeur de Quintin.
Fº 238.
P. 40, l. 5: escus.—Mss. A 15 à 17: frans. Fº 111 vº.
P. 40, l. 14: escus.—Mss. A 1 à 6, 15 à 17: frans. Fº 110.
P. 40, l. 30 et P. 41, l. 1: dix jours et plus.—Mss. A 1 à 6, 11 à 33:
plus de quinze jours. Fº 110 vº.—Mss. A 7 à 10: plus de cinq jours.
Fº 105.
P. 41, l. 6: Abbeville.—Mss. A 1 à 6: Aubeville. Fº 110 vº.
P. 41, l. 11: mès morut.—Le ms. B 6 ajoute: Dieu en ait l’ame! Ensi
fina messire Henry de Lion dont la contesse de Montfort fut moult lie,
car che lui estoit ung grant ennemy en Bretaigne. Fº 240.
P. 41, l. 12: d’Angiers.—Les mss. A 1 à 6, 11 à 14, 18, 19 ajoutent:
Dieu en ait l’ame par sa sainte pitié et misericorde! Fº 110 vº.—Ms. A
7: Diex en ait l’ame! Fº 105 vº.—Mss. A 20 à 22: Dieux en ait l’ame
par sa douce grace! Fº 163.—Mss. A 23 à 33: Dieu en ait l’ame par
sa grace. Amen. Fº 128 vº.
§ 205. P. 41, l. 13: Et approça.—Ms. d’Amiens: Or approcha li

jours Saint Jorges que ceste grande feste se devoit tenir à
Windesore, et y fist li roys grant appareil; et y furent de son pays
comte, baron, chevalier, dammes, dammoiselles. Et là fu la feste
moult grans et mout noble, bien festiée et bien joustée, et dura par le
tierme de quinze jours. Et y vinrent pluisseurs chevaliers de dechà le
mer, de Flandrez, de Haynnau et de l’Empire; mès de Franche n’en
y eult nulx. La feste durant et seant, pluisseurs nouvellez vinrent au
roy de pluisseurs pays. Et par especial il y vinrent chevaliers de
Gascoingne, li sire de Lespare, li sirez de Chaumont et li sirez de
Mouchident, envoiiés de par le seigneur de Labreth, et le seigneur
de Pumiers et les seigneurs gascons qui pour englès se tenoient, et
en leur compaignie six bourgois especiaux de le cité de Bourdiaux,
liquel furent moult bien venu et conjoi dou roy et de son consseil. Et
remoustrèrent li dessus dit au roy coumment petitement et
foiblement ses bons pays de Gascoingne et si bon amit, ossi la
bonne cité de Bourdiaux, estoient conforté et secourut de lui; et se
briefment n’i envoioit si puissamment gens qu’il fuissent fort de
resister as Franchois, il metoit tout ce que il y tenoit en grant
aventure: si ques li roys en respondi moult liement, et leur dist que il
leur bailleroit un très bon cappittainne, fort et puissant, pour resister
contre ses ennemis de par delà, parmi les bonnes gens d’armes et
archiers, ossi que il li chargeroit des parolles le roy. Et de se
proummesse se contentèrent bien li baron de Gascoingne.
Et avint que, celle feste durant, li roys ordonna et noumma chiaux
qu’il volloit qui alaissent en Gascoingne et desquelz li comtez Derbi
seroit chiés, et y devisa le comte de Pennebrucq, le comte de
Kenfort, le baron de Stanfort, monseigneur Gautier de Mauni,
monseigneur Francke de Halle, monseigneur Jehan de Lille, messire
Jehan de Grea, messire Jehan de la Souche, messire Thomas Kok,
le seigneur de Ferrièrez, lez deux frères de Lindehalle, le Lieuvre de
Braibant, messire Ainmon dou Fort, messire Huon de Hastinges,
menseigneur Estievenon de Tomby, monseigneur Richart de
Hebedon, monseigneur Normant de Sinefroide, messire Robert
d’Eltem, monseigneur Jehan de Norvich, monseigneur Richart de
Roclève, monseigneur Robert de Qantonne et pluisseurs aultres. Et
furent bien trois cens chevaliers et escuiers, six cens hommez
d’armes et deux mil archiers. Et dist li roys à son cousin le comte
Derbi que il presist assés or et argent pour tenir son estat grant et
estoffet et pour bien paiier tous saudoiiers.
Encorres ordounna li roys, celle feste durant, monseigneur
Thummas d’Anghourne pour aller en Bretaingne deviers le comtesse
de Montfort, à lui aidier à garder et à deffendre son pays, quoyque
les trieuwes y fuissent, car il se doubtoit que li roys Phelippes n’y
fesist guerre sus lez parollez qu’il li avoit remandées par
monseigneur Hervy de Lyon. Pour tant y envoya il monseigneur
Thumas à cent hommes d’armes et cinq cens archiers.
Encorres ordonna li roys monseigneur Guillaumme de Montagut,
comte de Sallebrin, à aller sus lez marches d’Irlande et lui tenir en le
conté de Luuestre, car li Irois estoient durement revelé contre lui et
avoient ars en le dessus dite comté grant fuison de villes, pour che
que il se tenoient englèz. Si y envoya li rois le dessus dit comte à
deux cens hommes d’armes et cinq cens archiers. Fº 80 vº.
—Ms. de Rome: En celle grande feste, qui fu à Windesore le jour
Saint Gorge en l’an dessus dit, furent de Gascongne auquns barons,
tels que li sires de Labreth, li sires de Ponmiers, li sires de
Mouchident et li sires de Copane. Et les avoit conjois et honnourés li
rois d’Engleterre de tout son pooir, et aussi avoit fait la roine
d’Engleterre sa fenme, et li baron et dames d’Engleterre. Et avoient
requis chil signeur au roi que il vosist de là en Giane envoiier
auqunes gens d’armes et archiers de par li, pour tenir et faire
frontière à l’encontre d’auquns rebelles barons et chevaliers dou
pais, qui constraindoient ses honmes et ses obeissans ou pais de
Bourdelois, d’Auberoce, de Bregerac et de la Riole, par quoi on euist
vraie connissance en Giane que li rois d’Engleterre estoit lors sires.
Li rois d’Engleterre avoit respondu à ces barons de Gascongne et dit
ensi que volentiers il i envoieroit, car il i estoit tenus et voloit
conforter ses bonnes gens des lontainnes marces aussi bien que les
prochainnes. Or estoient chil signeur parti dou roi d’Engleterre tout
content et retourné en lor pais, et recordé as chevaliers et esquiers
des frontières de Bourdiaus ces nouvelles. Et assés tos apriès lor
departement, il ordonna, par la deliberation de son consel, gens
d’armes et archiers pour aller en Gascongne et viseter les
forterèces, et nonma son cousin, le conte Derbi, à chapitainne et
souverain de toutes ces gens d’armes, et avoecques li le conte de
Pennebruq, le conte de Kenfort, le baron de Stanfort, mesire Gautier
de Mauni, messire Franqe de Halle, messire Jehan de Lille, mesire
Jehan de Grea, mesire Jehan de la Souce, mesire Guillaume
Penniel, mesire Huge de Hastinges, mesire Thomas Kok, le signeur
de Ferrières, les deus frères de Lindehalle, mesire Richart de
Hebedon, mesire Normant de Senefroide, mesire Estievene de
Tombi, mesire Robert d’Eltem, mesire Jehan de Nordvich, mesire
Richart de Roclève, mesire Robert de Qantonne, mesire Ainmon dou
Fort et pluisseurs aultres. Et furent bien trois cens chevaliers et
esquiers, siis cens honmes d’armes et deus mille archiers. Fº 96.
P. 41, l. 15: Et y furent.—Ms. B 6: Et y eult plus de trois cens
chevaliers joustant et bien quatre cens dames et demoiselles, et fu
la feste bien ordonnée. Et fourjousta de cheulx de dedens messire
Franque de Halle, et de cheulx de dehors le conte de Mons en
Allemaigne et ung escuiier d’Escoche qui se nomoit Alixandre de
Ramesay, et de ceulx dedens le prinche de Galles. Fº 240.
P. 41, l. 28: Pumiers.—Mss. A 8, 9, 15 à 17, 23 à 29: Pommier,
Pommiers. Fº 101.
P. 41, l. 28 et 29: Monferant.—Mss. A 8, 9: Montferrat. Fº 101.
P. 41, l. 29: Landuras.—Ms. A 24: Duras.
P. 41, l. 29: Courton.—Mss. A 23 à 29: Curton. Fº 129.—Mss. A 15
à 17: Courron. Fº 112.
P. 42, l. 1: Longerem.—Mss. A 1 à 7, 11 à 14, 18 à 22: Longueren,
Longuerem. Fº 110 vº.—Ms. A 8: Longueran. Fº 101.—Mss. A 15 à
17: Langoran. Fº 112.—Mss. A 23 à 29: Langurant. Fº 128 vº.
P. 42, l. 16: ordonna.—Ms. B 6: Adonc ordonna le dit conte Derby
de aller en Gascongne à quatre cens hommes d’armes et mil archiés
pour garder les frontières. D’aultre part, le conte de Pennebruck eut
cherghe de deux cens hommes d’armes et quatre cens archiés, le
conte de Kenfort deux cens hommes d’armes et deux cens archiés,
et furent prins tous en Engleterre. Fº 241.
P. 42, l. 24: Grea.—Mss. A 20 à 22: Gea. Fº 163 vº.
P. 42, l. 24 et 25: Jehan de la Souce.—Ce nom manque dans les
mss. A.
P. 42, l. 25: Thumas Kok.—Mss. A 20 à 22: Thomas Rally.
Fº 163 vº.
P. 42, l. 26: Lindehalle.—Mss. A 20 à 22: Landehalle. Fº 163 vº.
P. 42, l. 27: Aymon dou Fort.—Ce nom manque dans les mss. A.
P. 42, l. 28: Tonrby.—Mss. A 15 à 19: Comby. Fº 112 vº.—Mss. A
20 à 22: Tomboy. Fº 163 vº.
P. 42, l. 29: Manne.—Mss. A 20 à 22: Name. Fº 163 vº.
P. 42, l. 29: Hebedon.—Ms. A 8: Hedebon. Fº 101 vº.
P. 42, l. 30: Finefroide.—Mss. A 8, 15 à 17: Sinefroide. Fº 101 vº.
—Mss. A 20 à 22: Sineroide. Fº 163 vº.
P. 42, l. 31: d’Eltem.—Mss. A 1 à 6, 11 à 14, 18, 19: d’Altem.
Fº 111.—Mss. A 20 à 22: d’Atam. Fº 163 vº.
P. 42, l. 31: Norvich.—Mss. A 20 à 22: Lorwich. Fº 163 vº.
P. 42, l. 32: Rocleve.—Ms. A 8: Noclene. Fº 101 vº.—Mss. A 15 à
17: Nocleve. Fº 112 vº.—Mss. A 1 à 6, 11 à 14, 18, 19: Rochene.
Fº 111.—Mss. A 20 à 22: Roclerie. Fº 163 vº.—Mss. A 23 à 29:
Rociens. Fº 129.
P. 43, l. 1: Quantonne.—Mss. A 1 à 6: Quatonne. Fº 111.
P. 43, l. 3: deux mille.—Mss. A 20 à 22: trois mille. Fº 163 vº.
P. 43, l. 3: arciers.—Ms. B 6: Adonc pria le conte Derby à messire
Gautier de Mauny que en che voyage il vaulsist estre son
compaignon, car le dit conte le tenoit pour tout le milleur chevalier
d’Engleterre... Car très donc en devant avoit messire Gautier à son
commandement grant foison de bons compaignons et d’archiés,
quant il volloit aller en une armée, car tout le servoient vollentiers
pour les hardies emprises de luy, sa proèche et son eur. Car
oncques ne fut le dit Gautier en plache qui ne fust pour luy et pour
ses gens. Celle fortune ot il tout son vivant: dont ly chevaliers et
escuiers et les compaignons de guerre l’en amoient de mieulz. Fos
241 et 242.
P. 43, l. 9: d’Augourne.—Mss. A 1 à 6, 8, 18 à 22, 30 à 33:
Angorne, Angourne. Fº 111.—Mss. A 15 à 17, 23 à 29: d’Agorne.
Fº 112 vº.
P. 43, l. 12: li rois Phelippes.—Mss. A 20 à 22: messire Charles de
Bloiz. Fº 163 vº.
P. 43, l. 19: de Dulnestre.—Mss. A 1 à 6, 8, 15 à 19, 23 à 33: de
Duluestre. Fº 111.—Ms. A 7: d’Uluestre. Fº 106.—Mss. A 11 à 14: de
Luestre. Fº 106.—Mss. A 20 à 22: Deulnestre. Fº 164.
P. 43, l. 19: li Irois.—Mss. A 1 à 7, 11 à 14, 18, 19, 30 à 33: les
Escos. Fº 111.—Mss. A 20 à 29: les Escoçois. Fº 164.
P. 43, l. 21 et 22: de Dulnestre.—Mss. A 1 à 19, 23 à 33: de
Duluestre. Fº 111.—Mss. A 20 à 22: d’Ulnestre. Fº 164.
§ 206. P. 43, l. 25: Ensi que.—Ms. d’Amiens: Ensi que vous me
povés oyr, departi li roys englès ses gens, chiaux qui yroient en
Gascoingne, chiaux qui yroient en Bretaingne, et chiaux qui yroient
en Yrlande. Et fist delivrer par sez tresoriers as chappittainnes assés
or et argent pour tenir leur estat et paiier les compaignons de leurs
gages: chil se partirent enssi que ordonné estoient.
Or parlerons premierement dou comte Derbi, car il eut le plus
grant carge et ossi lez plus bellez aventures d’armez. Quant touttes
sez besoingnes furent pourveues et ordonnées, et sez gens venus,
et si vaissiel freté, cargiet et abilliet, il prist congiet au roy et s’en vint
à Hantonne, et là monta en mer avoecq le kerke dessus ditte; et
singlèrent tant au vent et as estoilles qu’il arivèrent à Baione, une
bonne ville, forte et grosse, qui toudis s’est tenue au roy englès. Si y
prissent terre et descargièrent touttez leurs pourveanches le
cinquime jour de juing l’an mil trois cens quarante quatre. Et furent
liement recheu et requeilliés des bourgois de Baionne et des bonnes
gens de le ville, et trouvèrent là aucuns chevaliers et escuiers.
Quant li comtes Derbi eut sejourné en le bonne ville de Baionne
par six jours et touttes ses gens ossi, et il s’i furent bien rafreski, si
s’en parti et remerchia tous les bourgois de le bonne feste que fait li
avoient; et fist tant qu’il vint en le bonne chité de Bourdiaux, là où on
l’atendoit, et eurent grant joie de sa venue, car moult l’avoient
desiret. Si vinrent contre lui à grant pourcession, et l’amenèrent
dedens le cité à grant quantité de trompes et de pluisseurs
menestrandies. Si fu li corps dou comte logiés en l’abbeie de Saint
Andrieu, et li autre parmy le chité: il trouvèrent bien ù et coumment,
car elle est grande assés pour bien aisier une grant ost. Or vinrent
lez nouvellez au comte de Laille, qui se tenoit en Bregerach à quatre
lieuwez de là, que li comtez Derbi estoit venus à Bourdiaux et avoit
moult grant fuisson de gens d’armes et d’archiers, et estoit fors
assés pour tenir lez camps, et de assaillir, assegier et prendre
castiaux et bonnes villes. Ces nouvelles oyes dou dessus dit comte,
il manda tantost le comte de Commingnes, le comte de Pieregorth,
le visconte de Quarmaing, le viscomte de Villemur, monseigneur
Carle de Poitiers, comte de Valentinois, et tous lez barons et
chevaliers qui ens ou pays se tenoient de par le roy de France.
Quant il furent tout venu, il leur remoustra le venue dou comte Derbi
et se puissanche par oïr dire: si en demanda à avoir consseil. Et chil
seigneur respondirent que, pour yaux bien acquitter, il se tenroient
en le ville de Bregerach, car elle est clés et entrée de ce pays sus le
rivière de Geronde, et que il supposoient assés que li Englès se
trairoient celle part. Chilz consseil fu tenus. Il fissent leur amas et
leur assamblée de leurs aidans en Bregerach. Et se logièrent li
seigneur ens ès fourbours, qui sont grant et loncq et fort et enclos de
le rivière, et y atraissent le plus grant plenté de leurs pourveanches.
Fos 80 vº et 81.
—Ms. de Rome: Tout chil signeur fissent lors pourveances de ce
que il lor besongnoit, à Pleumude et à Dardemude, et là se traissent
petit à petit et trouvèrent navie toute preste que li rois lor delivroit. Si
entrèrent dedens, qant toutes lors pourveances furent prestes, et se
desancrèrent et tournèrent lors singles deviers Gascongne. Et
costiièrent Bretagne, Rocelle et Poito, et entrèrent ens ou havene de
la Geronde, et vinrent à Bourdiaus et là ancrèrent, et puis issirent
des vassiaus. Li seneschaus dou lieu pour le temps, mesires
Thomas Fouque, et li maires de la ville et tout li honme bourgois de
la chité de Bourdiaus les requellièrent doucement et liement, et lor
amenistrèrent ce que il lor besongnoit. Si missent hors des vassiaus
lors pourveances et tout ce que passet avoient. Et tout furent logiet
en la chité de Bourdiaus et s’i rafresqirent. Et se pourveirent de
chevaus ceuls qui nuls n’en avoient, et fissent remettre à point lors
selles et lors harnois et lors armeures. Fº 96.
P. 43, l. 28: Irlande.—Mss. A 1 à 6: Hillande. Fº 111.
P. 44, l. 12: ou havene de Bayonne.—Ms. B 6: au havre de
Bourdiauls. Fº 242.
P. 44, l. 23 et 24: Saint Andrieu.—Mss. A 1 à 6: Saint Andrey.
Fº 111 vº.
P. 44, l. 26: ou plus.—Les mss. A 11 à 14 ajoutent: mais par toute
l’isle. Fº 106.
P. 44, l. 28: en Bregerach.—Ces mots manquent dans les mss. A
1 à 7, 11 à 14, 18 à 33.
P. 45, l. 3: Lille.—Mss. A 20 à 22: Laigle. Fº 164.
P. 45, l. 4: Commignes.—Mss. A 7, 23 à 33: Commines. Fº 106.
P. 45, l. 5: Carmaing.—Mss. A 20 à 22: Carmaigne. Fº 164.
P. 45, l. 6: le visconte de Villemur.—Mss. A 1 à 6, 18, 19: le conte
de Villemur. Fº 111 vº.
P. 45, l. 7: Murendon.—Mss. A 1 à 6: Miradam. Fº 111 vº.—Mss. A
7, 11 à 14, 18 à 33: Muredam, Murdam, Muredain. Fº 106.—Mss. A
15 à 17: Murendon. Fº 113.—Ms. A 8: Ajurendon. Fº 102.
P. 45, l. 8: Taride.—Mss. A 1 à 6: Lestarde. Fº 111 vº.—Mss. A 11
à 14, 18, 19: Tarde. Fº 106 vº.
P. 45, l. 9: Chastielbon.—Mss. A 1 à 7, 11 à 14, 18 à 33:
Chastillon. Fº 111 vº.
P. 45, l. 10: Lescun.—Mss. A 1 à 33: Lescut. Fº 111 vº.—Les mss.
A 15 à 17 ajoutent: le seigneur de Tannay Boutonne. Fº 113.
P. 45, l. 16 et 17: Garone.—Mss. A 1 à 6: Gironde. Fº 111 vº.
§ 207. P. 45, l. 26: Quant li contes.—Ms. d’Amiens: Et quant li

comtes Derbi eut sejourné en le cité de Bourdiaux environ sept
jours, il s’en parti et entendi que li comtez de Laille se tenoit en
Bregerach; si fist tuit son charoy et son host arouter et traire de celle
part. Et vinrent celle première nuit gesir à ung castiel qui se tenoit
pour yaux, que on claimme Monkuk, à une lieuwe de Bregerach; et
s’y tinrent che soir tuit aise, car il avoient bien de quoy. L’endemain
bien matin, allèrent leur foureur sus le castelerie de Bregerach, et
trouvèrent assés à fourer et revinrent à leur host qui encorres se
tenoit à Monkuk, car li seigneur y volloient disner pour savoir
coumment il se maintenroient, et y disnèrent assés matin.
Endementroes que on seoit à table, messires Gautiers de Mauni
regarda deviers le comte Derbi et dist: «Monseigneur, se nous
estions bien appert et droite gens d’armes, nous buverions à ce
soupper des vins de ces seigneurs de Franche qui se tiennent en
garnison en Bregerach.» Et quant li comtez Derbi eut oy enssi parler
le dit monseigneur Gautier, il leva le chief et respondi: «Jà pour moy
ne demoura que nous n’en buvions.» Li compaignon qui oïrent le
comte ensi parler, missent leurs testez ensamble et dissent lis uns
as autrez: «Allons nous armer, nous chevaucherons tantost deviers
Bregerach.»
Il n’y eut plus dit ne plus fait: tout furent armet, et li chevaux
enssiellet en bien briefve espasse. Et quant li comtes Derbi les vit de
celle vollenté, si en fu tous joyans et dist: «Or chevauchons, ou nom
de Dieu et de saint Jorge, deviers Bregerach.» Dont s’aroutèrent
touttez mannières de gens, et chevauchièrent, bannierres
desploiiées, deviers le cité, en le plus grant calleur dou jour, et
fissent tant que il vinrent devant les bailles des faubours qui
n’estoient mies legier à prendre, car une partie de la rivierre de
Geronde les environne. Et si y avoit d’autre part bonnes gens
d’armes, qui estoient bien tailliéz dou garder et dou deffendre. Fº 81.
—Ms. de Rome: Quant li contes Derbi ot sejourné en la chité de
Bourdiaus environ quinze jours, il li prist volenté de cevauchier. Si le
fist segnefiier par ses hiraus à tout honme, et que casquns fust prês:
il le furent et se departirent un jour de Bourdiaus en grant arroi, et fist
marescal de son hoost mesire Gautier de Mauni. Et prissent le
cemin de Bregerach, et n’i a que quatre lieues de Bourdiaus, et
vinrent à un chastiel seans à une lieue priès, lequel on nonme
Montquq. Et se tenoit pour euls et en estoit chapitainne et gardiiens,
uns chevaliers de Gascongne qui se nonmoit mesires Rainmons de
Copane, qui rechut les Englois liement et lor amenistra tout ce que il
lor besongnoit. Si se reposèrent là les Englois une nuit. Et à
lendemain li contes Derbi envoia courir par mesire Gautier de Mauni
et mesire Franqe de Halle, à tout deus cens lances et trois cens
archiers, devant Bregerach et lever la proie. Et reboutèrent toutes
gens dedens; ne nuls de ceuls qui dedens estoient, ne s’osèrent
bougier ne issir, pour resqourre la proie. Qant mesires Gautiers de
Mauni et li Englois orent fait lor emprise, il retournèrent à Montquq,
et se traissent les chapitainnes deviers le conte Derbi. Là dist
mesires Gautiers de Mauni une chevalereuse parole: «Se nous
estions bien preu, et se nous faisions nostre devoir, ensi que gens
d’armes doient faire, qant il sont venu en un pais pour guerriier, nous
souperions encore à nuit en Bregerach dou vin de ces François.» Li
contes Derbi rechut ceste parole en grant joie et dist: «En moi ne
demorra pas que nous n’en faisoions, Gautier, Gautier, nostre
acquit.» Adonc fist li contes sonner les tronpettes et aparillier tout
honme, armer et monter à cheval. Et issirent de Montquq gens
d’armes et archiers, et ceminèrent viers Bregerach, et tantos i furent.
Si s’arestèrent devant la ville, qui est forte assés et doit estre par
raison, car la rivière de la Dourdonne, qui vient là d’amont de
Roergue, de Qersi et des frontières d’Agen et de Limosin, rentre là
en la Geronde. Fº 96 vº.
P. 46, l. 4: ordonna ses besongnes.—Ms. B 6: Et y vint le sire de
Monferant, le sire de Chaumont, messire Alixsandre son frère, le sire
de Courton, le sire de Chastre, le sire de Condon... Quant il furent
tous assamblet et qu’il se trouva le dit conte Derby acompaigniés de
douze cens hommes d’armes, quatre mille archiés et trois mille
brigans à lanches et à pavais, sy se party de Bourdieaulx. Fº 243.
P. 46, l. 7: trois liewes.—Mss. A 20 à 22: quatre lieues. Fº 164 vº.
P. 46, l. 9: Montkuk.—Mss. A 8, 15 à 17, 20 à 22: Moncuq,
Moncucq. Fº 102.—Mss. A 11 à 14: Monbruq. Fº 106 vº.—Ms. A 24:
Monkoulier.
P. 46, l. 9: à une petite liewe.—Mss. A 23 à 29: à huit petites
lieues. Fº 130.
§ 208. P. 47, l. 7: Ces gens d’armes.—Ms. d’Amiens: Si tost que li

Englès furent venus devant Bregerach, il coummenchièrent à
assaillir, et li archier à traire si espessement et si ouniement que nulx
ne s’osoit amoustrer pour deffendre, et gens d’armes apriès yaux à
aprochier. Là eut grant assaut et merveilleusement fort, car li Englès,
qui estoient fresch et nouvellement venus ou pays, se prendoient
priès de bien faire le besoingne, affin que il en ewissent le grace de
leur cappittainne. D’autre part, li Gascon franchois qui là estoient, se
deffendirent vassaumment et bien. Et dura chilz assaux, toudis
lanchant, traiant et assailant, jusquez à basses vesprez.
Finablement il fu si continués et si bien poursuivis des Englès, que
par force il gaegnièrent ces faubours où toutte ceste bonne gent
d’armes se tenoient, et les couvint de force retraire et rentrer ou
corps de le ville. Et sachiés que ou rentrer il y eut une moult villainne
et dure escarmuche, et moult de gentilz hommes en grant peril. Et
par especial il y fu mors ungs grans barons de Gascoingne et de
Pieregort, que on appelloit monseigneur Huge de Mirepois, et ne
peut oncquez venir à ranchon, car messires Gautiers de Mauni
l’avoit ainssi ordonné: le cause pourquoy, je le vous recorderai quant
nous venrons au conquèz de le Riolle.
Au rentrer dedens le ville de Bregerach, eult mout grant encauch
et moult dur, et pluisseurs hommes mors et blechiés. Touttesfois,
quant il furent ensi que tout retret et li gentil homme remis en le ville,
il cloirent leur portez et refremèrent les baillez. Et li Englèz se tinrent
ens ès faubours, qui bien se saisirent de ce qu’il trouvèrent, et
passèrent celle nuit en grant reviel. Fº 81.
—Ms. de Rome: Li gentilhonme, qui pour lors estoient en
Bregerach, orent consel de widier lor ville et de euls rengier et
ordonner devant les barrières et escarmuchier et asaiier la
poissance des Englois. Et avoient fait carpenter une bastide où il
pooient bien cinq cens honmes, et jà i estoient il entré pour
deffendre le cemin, et quidoient faire mervelles. Mais sitos que les
Englois furent venus, chil de Bregerach ne tinrent nuls conrois; car
les Englois vinrent, lances abaisies, et conmencièrent à asallir ces
François et ces Bidaus qui là estoient, et archier à traire d’autre part.
Tantos la bastide fu delivrée, et maint honme mort et blechiet et
reversé par terre. Fº 96 vº.
P. 48, l. 12: Lille.—Mss. A 7, 18, 19, 23 à 33: Laille. Fº 107.—Mss.
A 20 à 22: Laigle. Fº 165 vº.
P. 48, l. 13: contes.—Mss. A 1 à 6, 8, 15 à 19: viconte. Fº 112.

Instant Ebooks Textbook Discrete Mathematics With Applications: Metric Version, Fifth Edition Susanna S. Epp Download All Chapters

Uploaded by

Copyright:

Available Formats

Instant Ebooks Textbook Discrete Mathematics With Applications: Metric Version, Fifth Edition Susanna S. Epp Download All Chapters

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Instant Ebooks Textbook Discrete Mathematics With Applications: Metric Version, Fifth Edition Susanna S. Epp Download All Chapters

Uploaded by

Copyright:

Available Formats

Full download test bank at ebook textbookfull.

Discrete Mathematics with

CLICK LINK TO DOWLOAD

Discrete Mathematics with Applications: Fifth Edition

Discrete Mathematics and Applications 2nd Edition

Discrete mathematics with ducks Second Edition

Discrete Mathematics and Applications 2nd Edition Kevin

Elementary linear algebra : Metric version Eighth

Biota Grow 2C gather 2C cook Loucas

Introduction to Probability and Statistics - Metric

Introduction to Probability and Statistics (Metric

Australia ● Brazil ● Mexico ● Singapore ● United Kingdom ● United States

Senior Product Assistant: Alexander Sham

Associate Marketing Manager: Tori Sitcawich

Manufacturing Planner: Doug Bertke submit all requests online at www.cengage.com/permissions.

IP Analyst: Reba Frederics

IP Project Manager: Carly Belcher ISBN: 978-0-357-11408-7

Production Service: MPS Limited Cengage International Offices

Compositor: MPS Limited Asia Australia/New Zealand

Cover Image: Katherine Gendreau Brazil India

Latin America UK/Europe/Middle East/Africa

Cengage is a leading provider of customized learning solutions with

For product information: www.cengage.com/international

Printed in the United States of America

WebAssign is an online learning platform for your math,

With WebAssign you will:

Get instant feedback Know how well you

Watch videos and tutorials Perform better on

Ask your instructor today how you can get

ChAPTER 1 speaking mathematically 1

1.2 The Language of Sets 6

1.3 The Language of Relations and Functions 15

1.4 The Language of Graphs 24

ChAPTER 2 the Logic of compound statements 37

2.2 Conditional Statements 53

2.3 Valid and Invalid Arguments 66

2.4 Application: Digital Logic Circuits 79

a Circuit That Corresponds to a Given Input/Output Table; Simplifying Combinational

2.5 Application: Number Systems and Circuits for Addition 93

ChAPTER 3 the Logic of Quantified statements 108

3.2 Predicates and Quantified Statements II 122

3.3 Statements with Multiple Quantifiers 131

3.4 Arguments with Quantified Statements 146

ChAPTER 4 elementary Number theory and methods

4.2 Direct Proof and Counterexample II: Writing Advice 173

4.3 Direct Proof and Counterexample III: Rational Numbers 183

4.4 Direct Proof and Counterexample IV: Divisibility 190

4.7 Indirect Argument: Contradiction and Contraposition 218

4.8 Indirect Argument: Two Famous Theorems 228

4.9 Application: The handshake Theorem 235

4.10 Application: Algorithms 244

ChAPTER 5 sequences, mathematical induction,

5.2 Mathematical Induction I: Proving Formulas 275

5.3 Mathematical Induction II: Applications 289

5.4 Strong Mathematical Induction and the Well-Ordering

5.5 Application: Correctness of Algorithms 314

5.6 Defining Sequences Recursively 325

5.7 Solving Recurrence Relations by Iteration 340

5.8 Second-Order Linear homogeneous Recurrence Relations