DISCRETE AND COMBINATORIAL MATHEMATICS An Applied Introduction RALPH P. GRIMALDI

Save this PDF as:

Size: px
Start display at page:

Download "DISCRETE AND COMBINATORIAL MATHEMATICS An Applied Introduction RALPH P. GRIMALDI"

Transcription

1 DISCRETE AND COMBINATORIAL MATHEMATICS An Applied Introduction THIRD EDITION RALPH P. GRIMALDI Rose-Hulman Institute of Technology w Addison-Wesley Publishing Company Reading, Massachusetts Menlo Park, California New York Don Mills, Ontario Wokingham, England Amsterdam Bonn Sydney Singapore Tokyo Madrid San Juan Milan Paris

2 Contents PARTI Fundamentals of Discrete Mathematics 1 1 Fundamental Principles of Counting The Rules of Sum and Product Permutations Combinations: The Binomial Theorem Combinations with Repetition: Distributions An Application in the Physical Sciences (Optional) Summary and Historical Review 44 2 Fundamentals of Logic Basic Connectives and Truth Tables Logical Equivalence: The Laws of Logic Logical Implication: Rules of Inference The Use of Quantifiers Quantifiers, Definitions, and the Proofs of Theorems Summary and Historical Review Set Theory Sets and Subsets Set Operations and the Laws of Set Theory Counting and Venn Diagrams A Word of Probability Summary and Historical Review Properties of the Integers: Mathematical Induction The Well-Ordering Principle: Mathematical Induction Recursive Definitions The Division Algorithm: Prime Numbers The Greatest Common Divisor: The Euclidean Algorithm 4.5 The Fundamental Theorem of Arithmetic Summary and Historical Review 238

3 XIV Contents 5 Relations and Functions Cartesian Products and Relations Functions: Piain and One-To-One Onto Functions: Stirling Numbers of the Second Kind Special Functions The Pigeonhole Principle Function Composition and Inverse Functions Computational Complexity Analysis of Algorithms Summary and Historical Review Languages: Finite State Machines Language: The Set Theory of Strings Finite State Machines: A First Encounter Finite State Machines: A Second Encounter Summary and Historical Review Relations: The Second Time Around Relations Revisited: Properties of Relations Computer Recognition: Zero-One Matrices and Directed Graphs Partial Orders: Hasse Diagrams Equivalence Relations and Partitions Finite State Machines: The Minimization Process Summary and Historical Review 394 PART 2 Further Topics in Enumeration The Principle of Inclusion and Exclusion The Principle of Inclusion and Exclusion Generalizations of the Principle Derangements: Nothing Is in Its Right Place Rook Polynomials Arrangements with Forbidden Positions Summary and Historical Review Generating Functions Introductory Examples Definition and Examples: Calculational Techniques Partitions of Integers The Exponential Generating Function The Summation Operator Summary and Historical Review 456

4 Contents xv 10 Recurrence Relations The First-Order Linear Recurrence Relation The Second-Order Linear Homogeneous Recurrence Relation with Constant Coefficients The Nonhomogeneous Recurrence Relation The Method of Generating Functions A Special Kind of Nonlinear Recurrence Relation (Optional) Divide-and-Conquer Algorithms (Optional) Summary and Historical Review 521 P A R T 3 Graph Theory and Applications An Introduction to Graph Theory Definitions and Examples Subgraphs, Complements, and Graph Isomorphism Vertex Degree: Euler Trails and Circuits Planar Graphs Hamilton Paths and Cycles Graph Coloring and Chromatic Polynomials Summary and Historical Review Trees Definitions, Properties, and Examples Rooted Trees Trees and Sorting Weighted Trees and Prefix Codes Biconnected Components and Articulation Points Summary and Historical Review Optimization and Matching Dijkstra's Shortest-Path Algorithm Minimal Spanning Trees: The Algorithms of Kruskal and Prim Transport Networks: The Max-Flow Min-Cut Theorem Matching Theory Summary and Historical Review 694 P A R T 4 Modern Applied Algebra Rings and Modular Arithmetic The Ring Structure: Definition and Examples Ring Properties and Substructures 709

5 xvi Contents 14.3 The Integers Modulo n Ring Homomorphisms and Isomorphisms Summary and Historical Review Boolean Algebra and Switching Functions Switching Functions: Disjunctive and Conjunctive Normal Forms Gating Networks: Minimal Sums of Products: Karnaugh Maps Further Applications: Don't-Care Conditions The Structure of a Boolean Algebra (Optional) Summary and Historical Review Groups, Coding Theory, and Polya's Method of Enumeration Definition, Examples, and Elementary Properties Homomorphisms, Isomorphisms, and Cyclic Groups Cosets and Lagrange's Theorem Elements of Coding Theory The Hamming Metrie The Parity-Check and Generator Matrices Group Codes: Decoding with Coset Leaders Hamming Matrices Counting and Equivalence: Burnside's Theorem The Cycle Index The Pattern Inventory: Polya's Method of Enumeration Summary and Historical Review Finite Fields and Combinatorial Designs Polynomial Rings Irreducible Polynomials: Finite Fields Latin Squares Finite Geometries and Affine Planes Block Designs and Projective Planes Summary and Historical Review 871 Appendix 1 Exponential and Logarithmic Functions A-1 Appendix 2 Matrices, Matrix Operations, and Determinants A-13 Appendix 3 Countable and Uncountable Sets A-27 Solutions S-1 Index 1-1

1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

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

MATH Mathematics-Nursing. MATH Remedial Mathematics I-Business & Economics. MATH Remedial Mathematics II-Business and Economics

MATH 090 - Mathematics-Nursing MATH 091 - Remedial Mathematics I-Business & Economics MATH 094 - Remedial Mathematics II-Business and Economics MATH 095 - Remedial Mathematics I-Science (3 CH) MATH 096

Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

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

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

= 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

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

Genetic Algorithms in Search, Optimization, and Machine Learning

Genetic Algorithms in Search, Optimization, and Machine Learning David E. Goldberg The University of Alabama TT ADDISON-WESLEY PUBLISHING COMPANY, INC. Reading, Massachusetts Menlo Park, California Sydney

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...............................

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

MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

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

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.......................

Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks

Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson

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

Cabrillo College Catalog 2015-2016

MATHEMATICS Natural and Applied Sciences Division Wanda Garner, Division Dean Division Office, Room 701 Jennifer Cass, Department Chair, (831) 479-6363 Aptos Counselor: (831) 479-6274 for appointment Watsonville

L - Standard Letter Grade P - Pass/No Pass Repeatability: N - Course may not be repeated

Course: MATH 26 Division: 10 Also Listed As: 200930, INACTIVE COURSE Short Title: Full Title: DISCRETE MATHEMATIC Discrete Mathematics Contact Hours/Week Lecture: 4 Lab: 0 Other: 0 Total: 4 4 Number of

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

Discrete Structures. Rajmohan Rajaraman Eric Ropiak Chris Burrows Ravi Sundaram

Discrete Structures Harriet Fell Javed A. Aslam Rajmohan Rajaraman Eric Ropiak Chris Burrows Ravi Sundaram Discrete Structures Version 2.1 Harriet Fell Javed A. Aslam Rajmohan Rajaraman Eric Ropiak Chris

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

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

7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

MATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated

194 / Department of Natural Sciences and Mathematics MATHEMATICS (MATH) The Mathematics Program: 1. Provides challenging experiences in Mathematics, Physics, and Physical Science, which prepare graduates

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

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

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

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

Complexity Classes P and NP

Complexity Classes P and NP MATH 3220 Supplemental Presentation by John Aleshunas The cure for boredom is curiosity. There is no cure for curiosity Dorothy Parker Computational Complexity Theory In computer

Precalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES

Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 0-1 Sets There are no state-mandated Precalculus 0-2 Operations

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

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

MATH. ALGEBRA I HONORS 9 th Grade 12003200 ALGEBRA I HONORS

* Students who scored a Level 3 or above on the Florida Assessment Test Math Florida Standards (FSA-MAFS) are strongly encouraged to make Advanced Placement and/or dual enrollment courses their first choices

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document

Math 1050 Khan Academy Extra Credit Algebra Assignment

Math 1050 Khan Academy Extra Credit Algebra Assignment KhanAcademy.org offers over 2,700 instructional videos, including hundreds of videos teaching algebra concepts, and corresponding problem sets. In

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

MyMathLab ecourse for Developmental Mathematics

MyMathLab ecourse for Developmental Mathematics, North Shore Community College, University of New Orleans, Orange Coast College, Normandale Community College Table of Contents Module 1: Whole Numbers and

Thinkwell s Homeschool Algebra 2 Course Lesson Plan: 34 weeks

Thinkwell s Homeschool Algebra 2 Course Lesson Plan: 34 weeks Welcome to Thinkwell s Homeschool Algebra 2! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson

MATHEMATICAL SCIENCES, BACHELOR OF SCIENCE (B.S.) WITH A CONCENTRATION IN APPLIED MATHEMATICS

VCU MATHEMATICAL SCIENCES, BACHELOR OF SCIENCE (B.S.) WITH A CONCENTRATION IN APPLIED MATHEMATICS The curriculum in mathematical sciences promotes understanding of the mathematical sciences and their structures,

Current Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary

Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:

Math 131 College Algebra Fall 2015

Math 131 College Algebra Fall 2015 Instructor's Name: Office Location: Office Hours: Office Phone: E-mail: Course Description This course has a minimal review of algebraic skills followed by a study of

Dynamic programming. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013

Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually

some algebra prelim solutions

some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no

Examples and Exercises

Examples and Exercises Guerino Mazzola January 6, 00 Example of A Rigorous Proof Claim: Let a, b, c be sets. Then we have c (a b) = (c a) (c b). Proof. By definition of equality of sets, we have to prove

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

Concurrent Programming

Concurrent Programming Principles and Practice Gregory R. Andrews The University of Arizona Technische Hochschule Darmstadt FACHBEREICH INFCRMATIK BIBLIOTHEK Inventar-Nr.:..ZP.vAh... Sachgebiete:..?r.:..\).

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

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

it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

Basics of Polynomial Theory

3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where

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

Essential Mathematics for Computer Graphics fast

John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made

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

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

DELAWARE MATHEMATICS CONTENT STANDARDS GRADES 9-10. PAGE(S) WHERE TAUGHT (If submission is not a book, cite appropriate location(s))

Prentice Hall University of Chicago School Mathematics Project: Advanced Algebra 2002 Delaware Mathematics Content Standards (Grades 9-10) STANDARD #1 Students will develop their ability to SOLVE PROBLEMS

Florida Math for College Readiness

Core Florida Math for College Readiness Florida Math for College Readiness provides a fourth-year math curriculum focused on developing the mastery of skills identified as critical to postsecondary readiness

The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

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

Overview of Math Standards

Algebra 2 Welcome to math curriculum design maps for Manhattan- Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse

Mathematics INDIVIDUAL PROGRAM INFORMATION 2014 2015. 866.Macomb1 (866.622.6621) www.macomb.edu

Mathematics INDIVIDUAL PROGRAM INFORMATION 2014 2015 866.Macomb1 (866.622.6621) www.macomb.edu Mathematics PROGRAM OPTIONS CREDENTIAL TITLE CREDIT HOURS REQUIRED NOTES Associate of Arts Mathematics 62

Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

Elementary Differential Equations

Elementary Differential Equations EIGHTH EDITION Earl D. Rainville Late Professor of Mathematics University of Michigan Phillip E. Bedient Professor Emeritus of Mathematics Franklin and Marshall College

Discrete Mathematics: Homework 7 solution. Due: 2011.6.03

EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that

CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

Prerequisites: TSI Math Complete and high school Algebra II and geometry or MATH 0303.

Course Syllabus Math 1314 College Algebra Revision Date: 8-21-15 Catalog Description: In-depth study and applications of polynomial, rational, radical, exponential and logarithmic functions, and systems

C H A P T E R. Logic Circuits

C H A P T E R Logic Circuits Many important functions are naturally computed with straight-line programs, programs without loops or branches. Such computations are conveniently described with circuits,

Integers and division

CS 441 Discrete Mathematics for CS Lecture 12 Integers and division Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Symmetric matrix Definition: A square matrix A is called symmetric if A = A T.

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,

Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

Mathematics (MATH) Satisfies the GE Area B4 requirement for mathematics. Prerequisite:

Mathematics (MATH) MAtH 035 elementary ALgeBrA (4) Real numbers, linear equations and inequalities, quadratic equations, polynomial operations, radical and exponential expressions. Prerequisite: placement

1 Introduction to Cryptography and Data Security 1 1.1 Overview of Cryptology (and This Book) 2 1.2 Symmetric Cryptography 4 1.2.1 Basics 4 1.2.2 Simple Symmetric Encryption: The Substitution Cipher...

SCHAUM S OUTLINE OF. Theory and Problems of DISCRETE MATHEMATICS

SCHAUM S OUTLINE OF Theory and Problems of DISCRETE MATHEMATICS This page intentionally left blank SCHAUM S OUTLINE OF Theory and Problems of DISCRETE MATHEMATICS Third Edition SEYMOUR LIPSCHUTZ, Ph.D.

Just the Factors, Ma am

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

DRAFT. Further mathematics. GCE AS and A level subject content

Further mathematics GCE AS and A level subject content July 2014 s Introduction Purpose Aims and objectives Subject content Structure Background knowledge Overarching themes Use of technology Detailed

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:

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

Notes on Algebraic Structures. Peter J. Cameron

Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Diablo Valley College Catalog 2014-2015

Mathematics MATH Michael Norris, Interim Dean Math and Computer Science Division Math Building, Room 267 Possible career opportunities Mathematicians work in a variety of fields, among them statistics,

PCHS ALGEBRA PLACEMENT TEST

MATHEMATICS Students must pass all math courses with a C or better to advance to the next math level. Only classes passed with a C or better will count towards meeting college entrance requirements. If

School of Mathematics, Computer Science and Engineering. Mathematics* Associate in Arts Degree COURSES, PROGRAMS AND MAJORS

Mathematics School of Mathematics, Computer Science and Engineering Dean: Lianna Zhao, MD Academic Chair: Miriam Castroconde Faculty: Miriam Castroconde; Terry Cheng; Howard Dachslager, PhD; Ilknur Erbas

Prentice Hall Mathematics: Algebra 2 2007 Correlated to: Utah Core Curriculum for Math, Intermediate Algebra (Secondary)

Core Standards of the Course Standard 1 Students will acquire number sense and perform operations with real and complex numbers. Objective 1.1 Compute fluently and make reasonable estimates. 1. Simplify

Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

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:

MATHEMATICS. Administered by the Department of Mathematical and Computing Sciences within the College of Arts and Sciences. Degree Requirements

MATHEMATICS Administered by the Department of Mathematical and Computing Sciences within the College of Arts and Sciences. Paul Feit, PhD Dr. Paul Feit is Professor of Mathematics and Coordinator for Mathematics.

CS & Applied Mathematics Dual Degree Curriculum Content

CS & Applied Mathematics Dual Degree Curriculum Content General Education (41 credits) COMM 101: Written and Oral Communication I COMM 301: Written and Oral Communication II ECON 201: Economic Principles

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

WASSCE / WAEC ELECTIVE / FURTHER MATHEMATICS SYLLABUS

Visit this link to read the introductory text for this syllabus. 1. Circular Measure Lengths of Arcs of circles and Radians Perimeters of Sectors and Segments measure in radians 2. Trigonometry (i) Sine,

Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

REQUIREMENTS FOR A 3-YEAR BA/BSc IN MATHEMATICS

MATHEMATICS (MATH) Updated June 3, 2015 Note: The department/program code MATH replaces the former codes 32. Students cannot hold credit in MATH-xxxx and the former 32.xxxx having the same course number

COURSE SYLLABUS Pre-Calculus A/B Last Modified: April 2015

COURSE SYLLABUS Pre-Calculus A/B Last Modified: April 2015 Course Description: In this year-long Pre-Calculus course, students will cover topics over a two semester period (as designated by A and B sections).

Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

Factoring Polynomials

Factoring Polynomials Factoring Factoring is the process of writing a polynomial as the product of two or more polynomials. The factors of 6x 2 x 2 are 2x + 1 and 3x 2. In this section, we will be factoring

Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can