eBook - ePub
A Short Course in Discrete Mathematics
Edward A. Bender, S. Gill Williamson
This is a test
Share book
- 256 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
A Short Course in Discrete Mathematics
Edward A. Bender, S. Gill Williamson
Book details
Book preview
Table of contents
Citations
About This Book
What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.
Frequently asked questions
How do I cancel my subscription?
Can/how do I download books?
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
What is the difference between the pricing plans?
Both plans give you full access to the library and all of Perlegoās features. The only differences are the price and subscription period: With the annual plan youāll save around 30% compared to 12 months on the monthly plan.
What is Perlego?
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weāve got you covered! Learn more here.
Do you support text-to-speech?
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Is A Short Course in Discrete Mathematics an online PDF/ePUB?
Yes, you can access A Short Course in Discrete Mathematics by Edward A. Bender, S. Gill Williamson in PDF and/or ePUB format, as well as other popular books in Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.
Information
Unit IS
Induction, Sequences and Series
Section 1: Induction
Suppose A(n) is an assertion that depends on n. We use induction to prove that A(n) is true when we show that
- itās true for the smallest value of n and
- if itās true for everything less than n, then itās true for n.
In this section, we will review the idea of proof by induction and give some examples. Here is a formal statement of proof by induction:
Theorem 1 (Induction) Let A(m) be an assertion, the nature of which is dependent on the integer m. Suppose that we have proved A(n0) and the statement
āIf n > n0 and A(k) is true for all k such that n0 ā¤ k < n, then A(n) is true.ā
Then A(m) is true for all m ā„ n0.19
Proof: We now prove the theorem. Suppose that A(n) is false for some n ā„ n0. Let m be the least such n. We cannot have m = n0 because one of our hypotheses is that A(n0) is true. On the other hand, since m is as small as possible, A(k) is true for n0 ā¤ k < m. By the inductive step, A(m) is also true, a contradiction. Hence our assumption that A(n) is false for some n is itself false; in other words, A(n) is never false. This completes the proof.
Definition 1 (Induction terminology) āA(k) is true for all k such that n0 ā¤ k < nā is called the induction assumption or induction hypothesis and proving that this implies A(n) is called the inductive step. A(n0) is called the base case or simplest case.
Example 1 (Every integer is a product of primes) A positive integer n > 1 is called a prime if its only divisors are 1 and n. The first few primes are 2, 3, 5, 7, 11, 13, 17, 19, 23. In another unit, we proved that every integer n > 1 is a product of primes. We now redo the proof, being careful with the induction.
We adopt the terminology that a single prime p is a product of one prime, itself. We shall prove A(n):
āEvery integer n ā„ 2 is a product of primes.ā
Our proof that A(n) is true for all n ā„ 2 will be by induction. We start with n0 = 2, which is a prime and hence a product of primes. The induc...