Fr. 80.00

Discrete Mathematics and Applications

English · Paperback / Softback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more










This book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employin

List of contents










I Proofs

Logic and Sets

Statement Forms and Logical Equivalences

Set Notation

Quantifiers

Set Operations and Identities

Valid Arguments

Basic Proof Writing

Direct Demonstration

General Demonstration (Part 1)

General Demonstration (Part 2)

Indirect Arguments

Splitting into Cases

Elementary Number Theory

Divisors

Well-Ordering, Division, and Codes

Euclid's Algorithm and Lemma

Rational and Irrational Numbers

Modular Arithmetic and Encryption

Indexed by Integers

Sequences, Indexing, and Recursion

Sigma Notation

Mathematical Induction, An Introduction

Induction and Summations

Strong Induction

The Binomial Theorem

Relations

General Relations

Special Relations on Sets

Basics of Functions

Special Functions

General Set Constructions

Cardinality

II Combinatorics

Basic Counting

The Multiplication Principle

Permutations and Combinations

Addition and Subtraction

Probability

Applications of Combinations

Correcting for Overcounting

More Counting

Inclusion-Exclusion

Multinomial Coecients

Generating Functions

Counting Orbits

Combinatorial Arguments

Basic Graph Theory

Motivation and Introduction

Special Graphs

Matrices

Isomorphisms

Invariants

Directed Graphs and Markov Chains

Graph Properties

Connectivity

Euler Circuits

Hamiltonian Cycles

Planar Graphs

Chromatic Number

Trees and Algorithms

Trees

Search Trees

Weighted Trees

Analysis of Algorithms (Part 1)

Analysis of Algorithms (Part 2)

A Assumed Properties of Z and R

B Pseudocode

C Answers to Selected Exercises


About the author










Kevin Ferland


Summary

This book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employin

Product details

Authors Kevin Ferland, Ferland Kevin
Publisher Taylor & Francis Ltd.
 
Languages English
Product format Paperback / Softback
Released 21.01.2023
 
EAN 9781032476896
ISBN 978-1-0-3247689-6
No. of pages 944
Series Textbooks in Mathematics
Subjects Natural sciences, medicine, IT, technology > IT, data processing > Operating systems, user interfaces

MATHEMATICS / Combinatorics, Combinatorics & graph theory, Combinatorics and graph theory

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.