Lecture Notes in Discrete Mathematics
Marcel B. Finan
Arkansas Tech University
c All Rights Reserved
2
Preface
This book is designed for a one semester course in discrete mathematics
for sophomore or junior level students. The text covers the mathematical
Applied Econometrics: Computer Problem Sheet 2
Background for the Data Set: This computer session is based on a similar
data set as to that used for Computer Problem Sheet 1 (based on the paper by
John Mullahy in Review of Economics and Statistics, 1997).
(including the agreement of nouns & verbs in grammatical number)
Devised by Jo Killmister, Skills
Enhancement Program, Newcastle
Business School
As weve seen, nouns are words that
represent things.
Sometimes, we want to refer to more than
one thing a grou
Sets
Memorize: A set is a well-dened collection of objects called elements or members of the set. If x is a
member of the set S, we write x S, and if x is a not member of the set S, we write x S
Here, well-dened means that any given object must either be
Chapter 1
Logic
1.1
Statements and Compound Statements
A statement or proposition is an assertion which is either true or false, though
you may not know which. That is, a statement is something that has a truth
value.
Here are some examples of statements.
Discrete Mathematics, Chapter 4:
Number Theory and Cryptography
Richard Mayr
University of Edinburgh, UK
Richard Mayr (University of Edinburgh, UK)
Discrete Mathematics. Chapter 4
1 / 35
Outline
1
Divisibility and Modular Arithmetic
2
Primes and Greatest
STUDY GUIDE FOR THE FIRST DISCRETE MATH EXAM
1. Combinatorics
Go over combinatorics examples in the text.
Review all the combinatorics problems from homework.
Do at least a couple of extra problems given below.
(1) How many (positive integer) divisors