Foundations of Logic and Mathematics

Size: px
Start display at page:

Download "Foundations of Logic and Mathematics"

Transcription

1 Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin

2 Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic INTRODUCTION LOGICAL FORMULAE TheEmptySet An Alphabet for Logic Well-Formed Formulae Exercises LOGICAL TRUTH AND CONNECTIVES Logical Truth Logical Connectives Truth Tables Exercises TAUTOLOGIES AND CONTRADICTIONS Examples of Tautologies Contradictions Exercises OTHER METHODS OF PROOF Proofs by Tautologies Proofs by Contradictions Exercises SYNTHESIS OF LOGICAL FORMULAE Design of Logical Formulae with Specified Truth Values Simplification by Distributivity and Excluded Middle Exercises OTHER CONNECTIVES AND APPLICATIONS Other Logical Connectives Logical Connectives in Binary Arithmetic Exercises SYNTHESIS BY KARNAUGH TABLES Karnaugh Tables Exercises AN APPLICATION TO CIRCUITS 52

3 vi CONTENTS 0.9 PROJECTS 53 1 Logic and Deductive Reasoning INTRODUCTION PROPOSITIONAL CALCULUS Formulae, Axioms, Rules, and Proofs Examples of Proofs with Axioms PI and P Exercises CLASSICALIMPLICATIONAL CALCULUS Derived Rules: Implications Subject to Hypotheses Examples of Proofs of Implicational Theorems Exercises PROOFS BY CONTRAPOSITION Examples of Proofs with Axiom P Proofs by Reductio ad Absurdum Exercises OTHER CONNECTIVES Definitions of Other Connectives Examples of Proofs of Theorems with Conjunctions Examples of Proofs of Theorems with Equivalences Examples of Proofs of Theorems with Disjunctions Examples of Proofs with Conjunctions and Disjunctions Exercises OTHER FORMS OF DEDUCTIVE REASONING Conjunctions of Implications Proofs by Cases or by Contradiction Exercises PREDICATE CALCULUS Predicates, Quantifiers, Free or Bound Variables Axioms and Rules for the Predicate Calculus Examples of Proofs with the Predicate Calculus Exercises INFERENCE WITH QUANTIFIERS Proofs with Quantifiers Proofs With Universal Quantifiers and Other Connectives Proofs with Quantifiers and Other Connectives Proofs with Restrictions On a Quantified Variable Proofs with More than One Quantified Variable Exercises FURTHER ISSUES IN LOGIC PROJECTS 96 2 Set Theory INTRODUCTION SETS AND SUBSETS Equality and Extensionality TheEmptySet Subsets and Supersets Exercises PAIRING, POWER, AND SEPARATION Pairing 104

4 CONTENTS vn Power Sets Separation of Sets Exercises UNIONS AND INTERSECTIONS OF SETS UnionsofSets Intersections of Sets Unions and Intersections of Sets Exercises CARTESIAN PRODUCTS AND RELATIONS Cartesian Products of Sets Cartesian Products of Unions and Intersections Mathematical Relations Exercises MATHEMATICAL FUNCTIONS Mathematical Functions Images and Inverse Images of Sets by Functions Exercises COMPOSITE AND INVERSE FUNCTIONS Compositions of Functions Injective, Surjective, Bijective, and Inverse Functions Exercises EQUIVALENCE RELATIONS Reflexive, Symmetrie, Transitive, or Anti-Symmetric Relations Partitions and Equivalence Relations Exercises ORDERING RELATIONS Preorders and Partial Orders Total Orders and Well-Orderings Exercises PROJECTS Induction, Recursion, Arithmetic, Cardinality INTRODUCTION MATHEMATICAL INDUCTION The Axiom oflnfinity The Principleof Mathematical Induction Definitions by Mathematical Induction or Recursion Exercises ARITHMETIC WITH NATURAL NUMBERS Addition with Natural Numbers Multiplication with Natural Numbers Exercises ORDERS AND CANCELLATIONS Orders on the Natural Numbers Laws of Arithmetic Cancellations Exercises INTEGERS Negative Integers Arithmetic with Integers Order on the Integers Non-Negative Integral Powers of Integers. 187

5 viii CONTENTS Exercises RATIONAL NUMBERS Definition of Rational Numbers Arithmetic with Rational Numbers Notation for Sums and Products Order on the Rational Numbers Exercises FINITE CARDINALITY Equal Cardinalities Finite Sets Exercises INFINITE CARDINALITY Infinite Sets Denumerable Sets The Bernstein-Cantor-Schröder Theorem Other Infinite Sets Further Issues in Cardinality Exercises ARITHMETIC IN FINANCE Introduction Percentages and Rates Sales and Income Taxes Compounded Interest Loans, Mortgages, and Savings Plans Perpetuities Exercises PROJECTS Decidability and Completeness INTRODUCTION LOGICS FOR SCIENTIFIC REASONING Scientific Reasoning Hypothesis Testing Brouwer & Heyting's Intuitionistic Logic Kolmogorov & Johansson's Minimal Propositional Calculus Exercises INCOMPLETENESS Tautologies and Theorems Incompleteness of the Implicational Calculus Exercises LOGICS NOT AMENABLE TO TRUTH TABLES Logics with Any Number of Values Practical Logics Not Amenable to Truth Tables Exercises AUTOMATED THEOREM PROVING The Deduction Theorem Example: Law of Assertion from the Deduction Theorem The Provability Theorem The Completeness Theorem Example: Peirce's Law from the Completeness Theorem Exercises 248

6 CONTENTS ix 4.5 TRANSFINITE METHODS Transfinite Induction Transfinite Construction Exercises TRANSITIVE SETS AND ORDINALS Transitive Sets Ordinals Well-Ordered Sets of Ordinals Unions and Intersections of Sets of Ordinals Exercises REGULARITY OF WELL-FORMED SETS Well-Formed Sets Regularity Exercises FURTHER ISSUES IN DECIDABHJTY PROJECTS 262 B Applications Number Theory and Codes INTRODUCTION THEEUCLIDEAN ALGORITHM Division With Integers Greatest Common Divisors Exercises DIGITAL EXPANSION AND ARITHMETIC Expansion of Integers in Powers of an Integral Base Digital Integer Arithmetic Exercises PRIME NUMBERS PrimeNumbers Prime-Number Factorization Primality Testing Exercises MODULAR ARITHMETIC Modular Integers Modular Addition Modular Multiplication Modular Division Divisibility Tests Exercises MODULAR CODES The International Standard Book Number (ISBN) Code The Universal Product Code (UPC) The Bank Identification Code The U.S. postal nine-digit ZIP Code Exercises EUCLID, EULER, &FERMATS THEOREMS Fermat's Little Theorem The Euler-Fermat Theorem 295

7 x CONTENTS Exercises RIVEST-SHAMIR-ADLEMAN (RSA) CODES The Rivest-Shamir-Adleman (RSA) Public-Key ProofoftheCorrectnessoftheRSAAlgorithm Exercises FURTHER ISSUES IN NUMBER THEORY PROJECTS Ciphers, Combinatorics, and Probabilities INTRODUCTION ALGEBRA Definitions and Examples of Mathematical Groups Existence and Uniqueness of Identities and Inverses Bijections of Groups Exercises PERMUTATIONS Permutations and Orbits Transpositions Exercises CYCLIC PERMUTATIONS Cycles Factorization of Permutations by Cycles Exercises SIGNATURESOF PERMUTATIONS Even and Odd Permutations Signatures of Composite Permutations Exercises ARRANGEMENTS Arrangements Without Repetition Arrangements With Repetitions Exercises COMBINATIONS Combinations Without Repetition Combinations With Repetition Permutations With Repetition Exercises PROBABILITY Probability Spaces The Exclusion-Inclusion Principle Conditional Probabilities Applications of Binomial Probabilities Exercises THE ENIGMA MACHINES Design and Operation of the ENIGMA Machines Breaking the ENIGMA Ciphers Reconstructing the ENIGMA Wiring Exercises PROJECTS 359

8 CONTENTS xi 7 Graph Theory INTRODUCTION MATHEMATICAL GRAPHS Directed Graphs Undirected Graphs Degrees of Vertices Exercises PATH-CONNECTED GRAPHS Walks in Graphs Path-Connected Components of Graphs Longer Walks Longest Paths Exercises EULER AND HAMILTONIAN CIRCUITS Circuits Hamiltonian Paths and Circuits Eulerian Paths and Circuits Exercises MATHEMATICAL TREES Trees Spanning Trees Directed Trees and Star-Shaped Graphs Exercises WEIGHTED GRAPHS AND MULTIGRAPHS Weighted Graphs Shortest Path and Minimum-Weight Paths or Trees Maximal Flows in Transportation Graphs Exercises BIPARTITE GRAPHS AND MATCHINGS Bipartite Graphs Maximum Matching Exercises GRAPH THEORY IN SCIENCE TheShapeofMolecules TheShapeofHydrocarbons Sequences of Radioactive Decays Exercises FURTHER ISSUES: PLANAR GRAPHS PROJECTS 398 Bibliography 399 Index 405

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

More information

Handout #1: Mathematical Reasoning

Handout #1: Mathematical Reasoning Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

More information

Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

More information

ML for the Working Programmer

ML for the Working Programmer ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming

More information

ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE. School of Mathematical Sciences

ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE. School of Mathematical Sciences ! ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE School of Mathematical Sciences New Revised COURSE: COS-MATH-200 Discrete Mathematics and Introduction to Proofs 1.0 Course designations

More information

INTRODUCTORY SET THEORY

INTRODUCTORY SET THEORY M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

More information

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121

More information

Examination paper for MA0301 Elementær diskret matematikk

Examination paper for MA0301 Elementær diskret matematikk Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

More information

Discrete Mathematics Problems

Discrete Mathematics Problems Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

More information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

Midterm Practice Problems

Midterm Practice Problems 6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

More information

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

More information

Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES

More information

Lecture 16 : Relations and Functions DRAFT

Lecture 16 : Relations and Functions DRAFT CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

Discrete Mathematics. Hans Cuypers. October 11, 2007

Discrete Mathematics. Hans Cuypers. October 11, 2007 Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

Discrete Math for Computer Science Students

Discrete Math for Computer Science Students Discrete Math for Computer Science Students Ken Bogart Dept. of Mathematics Dartmouth College Scot Drysdale Dept. of Computer Science Dartmouth College Cliff Stein Dept. of Industrial Engineering and Operations

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook. Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

More information

Mathematical Induction. Lecture 10-11

Mathematical Induction. Lecture 10-11 Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

More information

Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved

Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved 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

More information

Today s Topics. Primes & Greatest Common Divisors

Today s Topics. Primes & Greatest Common Divisors Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

More information

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

More information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

Correspondence analysis for strong three-valued logic

Correspondence analysis for strong three-valued logic Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).

More information

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

More information

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

More information

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

More information

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

More information

Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

More information

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

More information

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

More information

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

More information

Abstract Algebra Theory and Applications. Thomas W. Judson Stephen F. Austin State University

Abstract Algebra Theory and Applications. Thomas W. Judson Stephen F. Austin State University Abstract Algebra Theory and Applications Thomas W. Judson Stephen F. Austin State University August 16, 2013 ii Copyright 1997-2013 by Thomas W. Judson. Permission is granted to copy, distribute and/or

More information

COURSE SYLLABUS -----------------------------------------------------------------------------------

COURSE SYLLABUS ----------------------------------------------------------------------------------- Last Reviewed by: Leslie Wurst Date Approved: Date Revised: Fall 2012 COURSE SYLLABUS Syllabus for: MATH 1010 Math for General Studies Former Course and Title: Former Quarter Course(s): Mat 1260 Contemporary

More information

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements. 3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

More information

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S. Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

More information

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00

More information

Discrete Structures. Lecture Notes

Discrete Structures. Lecture Notes Discrete Structures Lecture Notes Vladlen Koltun 1 Winter 2008 1 Computer Science Department, 353 Serra Mall, Gates 374, Stanford University, Stanford, CA 94305, USA; vladlen@stanford.edu. Contents 1

More information

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

More information

A Course in Discrete Structures. Rafael Pass Wei-Lung Dustin Tseng

A Course in Discrete Structures. Rafael Pass Wei-Lung Dustin Tseng A Course in Discrete Structures Rafael Pass Wei-Lung Dustin Tseng Preface Discrete mathematics deals with objects that come in discrete bundles, e.g., 1 or 2 babies. In contrast, continuous mathematics

More information

This chapter is all about cardinality of sets. At first this looks like a

This chapter is all about cardinality of sets. At first this looks like a CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

More information

Master of Arts in Mathematics

Master of Arts in Mathematics Master of Arts in Mathematics Administrative Unit The program is administered by the Office of Graduate Studies and Research through the Faculty of Mathematics and Mathematics Education, Department of

More information

BookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line

BookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line College Algebra in Context with Applications for the Managerial, Life, and Social Sciences, 3rd Edition Ronald J. Harshbarger, University of South Carolina - Beaufort Lisa S. Yocco, Georgia Southern University

More information

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( ) 1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

More information

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

More information

A Beginner s Guide to Modern Set Theory

A Beginner s Guide to Modern Set Theory A Beginner s Guide to Modern Set Theory Martin Dowd Product of Hyperon Software PO Box 4161 Costa Mesa, CA 92628 www.hyperonsoft.com Copyright c 2010 by Martin Dowd 1. Introduction..... 1 2. Formal logic......

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

PRE-CALCULUS GRADE 12

PRE-CALCULUS GRADE 12 PRE-CALCULUS GRADE 12 [C] Communication Trigonometry General Outcome: Develop trigonometric reasoning. A1. Demonstrate an understanding of angles in standard position, expressed in degrees and radians.

More information

Properties of Real Numbers

Properties of Real Numbers 16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

More information

Course Syllabus. MATH 1350-Mathematics for Teachers I. Revision Date: 8/15/2016

Course Syllabus. MATH 1350-Mathematics for Teachers I. Revision Date: 8/15/2016 Course Syllabus MATH 1350-Mathematics for Teachers I Revision Date: 8/15/2016 Catalog Description: This course is intended to build or reinforce a foundation in fundamental mathematics concepts and skills.

More information

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying

More information

Graph Theory Problems and Solutions

Graph Theory Problems and Solutions raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

More information

Math 223 Abstract Algebra Lecture Notes

Math 223 Abstract Algebra Lecture Notes Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course

More information

The Mathematics of GIS. Wolfgang Kainz

The Mathematics of GIS. Wolfgang Kainz The Mathematics of GIS Wolfgang Kainz Wolfgang Kainz Department of Geography and Regional Research University of Vienna Universitätsstraße 7, A-00 Vienna, Austria E-Mail: wolfgang.kainz@univie.ac.at Version.

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

More information

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold: Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

More information

Introduction to Modern Algebra

Introduction to Modern Algebra Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

More information

Alabama Department of Postsecondary Education

Alabama Department of Postsecondary Education Date Adopted 1998 Dates reviewed 2007, 2011, 2013 Dates revised 2004, 2008, 2011, 2013, 2015 Alabama Department of Postsecondary Education Representing Alabama s Public Two-Year College System Jefferson

More information

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES 136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

More information

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers. MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

More information

MODELS OF SET THEORY

MODELS OF SET THEORY MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics

More information

096 Professional Readiness Examination (Mathematics)

096 Professional Readiness Examination (Mathematics) 096 Professional Readiness Examination (Mathematics) Effective after October 1, 2013 MI-SG-FLD096M-02 TABLE OF CONTENTS PART 1: General Information About the MTTC Program and Test Preparation OVERVIEW

More information

LAKE ELSINORE UNIFIED SCHOOL DISTRICT

LAKE ELSINORE UNIFIED SCHOOL DISTRICT LAKE ELSINORE UNIFIED SCHOOL DISTRICT Title: PLATO Algebra 1-Semester 2 Grade Level: 10-12 Department: Mathematics Credit: 5 Prerequisite: Letter grade of F and/or N/C in Algebra 1, Semester 2 Course Description:

More information

A 2-factor in which each cycle has long length in claw-free graphs

A 2-factor in which each cycle has long length in claw-free graphs A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

More information

CRYPTOG NETWORK SECURITY

CRYPTOG NETWORK SECURITY CRYPTOG NETWORK SECURITY PRINCIPLES AND PRACTICES FOURTH EDITION William Stallings Prentice Hall Upper Saddle River, NJ 07458 'jkfetmhki^^rij^jibwfcmf «MMr""'-^.;

More information

Bachelor Degree in Business Administration Academic year 2015/16

Bachelor Degree in Business Administration Academic year 2015/16 University of Catania Department of Economics and Business Bachelor Degree in Business Administration Academic year 2015/16 Mathematics for Social Sciences (1st Year, 1st Semester, 9 Credits) Name of Lecturer:

More information

Applied Liberal Arts Mathematics MAT-105-TE

Applied Liberal Arts Mathematics MAT-105-TE Applied Liberal Arts Mathematics MAT-105-TE This TECEP tests a broad-based overview of mathematics intended for non-math majors and emphasizes problem-solving modeled on real-life applications. Topics

More information

Automata and Formal Languages

Automata and Formal Languages Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

More information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

Group Theory. Contents

Group Theory. Contents Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

More information

STUDENT S SOLUTIONS MANUAL ELEMENTARY NUMBER THEORY. Bart Goddard. Kenneth H. Rosen AND ITS APPLICATIONS FIFTH EDITION. to accompany.

STUDENT S SOLUTIONS MANUAL ELEMENTARY NUMBER THEORY. Bart Goddard. Kenneth H. Rosen AND ITS APPLICATIONS FIFTH EDITION. to accompany. STUDENT S SOLUTIONS MANUAL to accompany ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS FIFTH EDITION Bart Goddard Kenneth H. Rosen AT&T Labs Reproduced by Pearson Addison-Wesley from electronic files supplied

More information

Mathematics for Computer Science Eric Lehman and Tom Leighton 2004

Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 Mathematics for Computer Science Eric Lehman and Tom Leighton 2004 2 Contents 1 What is a Proof? 15 1.1 Propositions..................................... 15 1.2 Axioms........................................

More information

V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005 V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

More information

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

More information

GROUPS ACTING ON A SET

GROUPS ACTING ON A SET GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

More information

Sequence of Mathematics Courses

Sequence of Mathematics Courses Sequence of ematics Courses Where do I begin? Associates Degree and Non-transferable Courses (For math course below pre-algebra, see the Learning Skills section of the catalog) MATH M09 PRE-ALGEBRA 3 UNITS

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

More information

o-minimality and Uniformity in n 1 Graphs

o-minimality and Uniformity in n 1 Graphs o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions

More information

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

More information

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours MAT 051 Pre-Algebra Mathematics (MAT) MAT 051 is designed as a review of the basic operations of arithmetic and an introduction to algebra. The student must earn a grade of C or in order to enroll in MAT

More information

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

More information

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p. Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

More information

Notes on Discrete Mathematics CS 202: Fall 2013

Notes on Discrete Mathematics CS 202: Fall 2013 Notes on Discrete Mathematics CS 202: Fall 2013 James Aspnes 2015-10-20 07:07 Contents Table of contents List of figures List of tables List of algorithms Preface Syllabus Resources Lecture schedule i

More information

! X is a set of strings. ! Instance: string s. ! Algorithm A solves problem X: A(s) = yes iff s! X.

! X is a set of strings. ! Instance: string s. ! Algorithm A solves problem X: A(s) = yes iff s! X. Decision Problems 8.2 Definition of NP Decision problem. X is a set of strings. Instance: string s. Algorithm A solves problem X: A(s) = yes iff s X. Polynomial time. Algorithm A runs in polytime if for

More information

The programme will be delivered by the faculty of respective NITs with additional support from practicing executives from the IT & ITES industry.

The programme will be delivered by the faculty of respective NITs with additional support from practicing executives from the IT & ITES industry. Finishing School programme for Engineering Graduates by National Institutes of Technology - Calicut, Durgapur, Jaipur, Kurushetra, Surathkal, Tiruchirappalli, Warangal & IIT-Roorkee The Programme: With

More information

MATH BOOK OF PROBLEMS SERIES. New from Pearson Custom Publishing!

MATH BOOK OF PROBLEMS SERIES. New from Pearson Custom Publishing! MATH BOOK OF PROBLEMS SERIES New from Pearson Custom Publishing! The Math Book of Problems Series is a database of math problems for the following courses: Pre-algebra Algebra Pre-calculus Calculus Statistics

More information

ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL

ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL ADSS, Volume 3, Number 3, 2013, Pages 45-56 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid

More information

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

More information

Lecture Notes on Discrete Mathematics

Lecture Notes on Discrete Mathematics Lecture Notes on Discrete Mathematics A. K. Lal September 26, 2012 2 Contents 1 Preliminaries 5 1.1 Basic Set Theory.................................... 5 1.2 Properties of Integers.................................

More information

Elementary Number Theory

Elementary Number Theory Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,

More information