DISCRETE MATHEMATICS WITH COMPUTER SCIENCE APPLICATIONS Fall 2009
|
|
- Emery Wilson
- 7 years ago
- Views:
Transcription
1 MATH E-104 DISCRETE MATHEMATICS WITH COMPUTER SCIENCE APPLICATIONS Fall 2009 Instructor: Dr. Thomas Koshy Telephone: (O) 1. TEXT: K. H. Rosen, Discrete Mathematics and Its Applications, 6th edition, McGraw-Hill, New York, OBJECTIVES: 1. Gaining factual knowledge. Learning the fundamental concepts, notations, and facts in discrete mathematics. 2. Learning fundamental principles, theories, or generalizations. Predicting conclusions via inductive reasoning. Establishing the validity of such conclusions. Following and appreciating the development of proofs of theorems. Applying the course material in problem-solving. 3. Improving rational thinking, decision-making, and problem-solving. Sharpening problem-solving skills and techniques. Creating simple and short proofs. Developing computational and writing skills. Enhancing the ability for rational thinking. 4. Developing a sense of mathematical maturity. 5. Developing a sense of personal responsibility. 6. Gaining a broad understanding and appreciation of intellectual pursuit. 7. Raising the intellectual curiosity level. 3. COURSE OUTLINE: Chapters 1-4, 6, and 8 Topics Discussed: LOGIC: Symbolic logic, fuzzy logic, arguments, and proof techniques. SETS: Sets, set operations, fuzzy sets, cardinality, recursively defined sets, and formal languages. FUNCTIONS AND MATRICES: Functions, special functions, properties of functions, pigeonhole principle, composition, the summation and product notations, and matrices.
2 ALGORITHMS and THEIR COMPLEXITIES: Standard searching and sorting algorithms, Division algorithm, divisibility properties, Euclidean algorithm, nondecimal bases, induction, algorithm correctness, growth of functions, big-oh, big-omega, and big-theta notations, and complexities of algorithms. RECURSION: Recursion, Fibonacci and Lucas numbers, Pell and Pell Lucas numbers, Pell walks, solving recurrence relations, recursive algorithms, correctness and complexities of recursive algorithms, and generating functions. COMBINATORICS: Fundamental counting principles, permutations, derangements, combinations, permutations and combinations with repetitions, binomial theorem, and the numbers of surjections and derangements. GRAPHS: Graph terminology, paraffins and Pascal-like triangles, isomorphic graphs, paths, cycles, circuits, Eulerian and Hamiltonian graphs, planar graphs, graph coloring, and Fibonacci trees. CATALAN NUMBERS: Catalan numbers, permutations revisited, rail road tracks, and binary and full binary trees. 3. EXAMINATIONS (all closed book): Hour Exams: Sept. 22, Oct. 20, Nov. 17 Final Exam (cumulative): Tuesday, Dec. 15, points each 200 points 4. HOMEWORK: 100 points Homework problems are assigned every week and are due every Tuesday. They are due in class and no late arrivals are accepted, except in case of emergency or death in immediate family (see the para on make-ups). They are worth 100 points. All assignments must be done independently without any outside help; in other words, no collaborative work is acceptable. Solutions must be complete with complete justifications for full credit. Solutions that look similar will be assigned zero grade. 5. PROGRAMMING ASSIGNMENTS: 100 points Mandatory for graduate students. Penalized at 5% per weekday for late arrivals. Not accepted two weeks after due dates. Last day for submitting assignments is January 06, MAKEUPS: All tests must be taken on time. No make-ups will be given except in the case of a real emergency, serious illness, or death in the immediate family, which must be substantiated. In such a case, the instructor must
3 be contacted as soon as possible. If you fall ill on a test day, a physician's note to the effect that you would not be able to attend the class, must be produced. In the case of a death, a copy of an obituary must be presented. All make-ups, if applicable, must be taken on the first day you return to the class. Schedule your appointments to avoid conflicts with the class meetings, especially, the tests. 7. SCIENTIFIC CALCULATORS: A scientific calculator is strongly recommenced for use in class and on examinations. Get used to the various function keys and refer to a manual as often as needed. If you need to buy one, get a graphing calculator, say, TI-89; it is a good investment into the future! 8. ATTENDANCE: Not mandatory, but can be very helpful. If you miss a class, it is your responsibility to find out from others in class to find out what was said, discussed, and assigned in class. 9. OFFICE HOURS: Every Tuesday 5:00-5:30 p.m., after class, or by appointment. 10. TEACHING ASSISTANT: TBA 11. REVIEW SECTIONS: TBA 12. SUGGESTED REFERENCES: K. P. Bogart, Discrete Mathematics, D. C. Heath, J. Bradley, Introduction to Discrete Mathematics, Addison-Wesley J. A. Dossey, et al, Discrete Mathematics, HarperCollins, Glenview, Illinois, R. L. Graham, et al, Concrete Mathematics, Addison-Wesley, R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 5th ed., Pearson, R. Johnsonbaugh, Discrete Mathematics, Macmillan, K. Kalmanson, An Introduction to Discrete Structures and its applications, Addison-Wesley, B. Kolman, et al, Discrete Mathematical Structures, 4th edition,
4 Prentice-Hall, T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley, New York, T. Koshy, Discrete Mathematics with Applications, Elsevier, Burlington, MA, T. Koshy, Elementary Number Theory with Applications, 2nd edition, Academic Press, Boston, T. Koshy, Catalan Numbers with Applications, Oxford University Press, New York, F. S. Roberts, Applied Combinatorics, Prentice-Hall, Englewood Cliffs, NJ, S. Roman, An Introduction to Discrete Mathematics, 2nd edition, Harcourt Brace Jovanovich, New York, K. A. Ross and C. R. B. Wright, Discrete Structures, 3rd ed., Prentice-Hall, Englewood Cliffs, NJ, GRADING: Total Number of Points: Hour-Exams 300 points Homework 100 Programming Assignments 100 Final Exam (cumulative) 200 Total: 700 Grading Policy: Your grade for the course depends on the number of points you will have earned by the end of the course, as defined by the following table: Range in percentage letter grade A A B B B C C C D D D E A Final Word: Study the material every day; review the material every weekend; do the assignments in advance; score as many points as possible in each category. Factors such as class participation could contribute to your
5 final grade, especially if yours is a borderline case. MATH E-104 HOMEWORK Fall 2009 All homework solutions must be legible, complete, and independent, written on regular 8½ 11 paper. If more than one sheet is needed, staple all sheets together in an orderly fashion. All assignments are due in class and no late arrivals will be entertained. 1. Exercises 20, 26c, 28f, 30e, 38, 60 p Exercises 10d, 30, 32, 50a, 50b p Exercises 6e, 6f, 8c, 8d, 14, 24 p Exercises 4, 8, 12a-h p Exercises 2, 4d, 4e, 14a p Exercises 18d, 18e, 24, 26c, 36, 50 p Exercises 10c, 10f, 14d, 16d, 18b p Exercises 8, 14, 20 p Exercises 16, 26, 28, 32 p Exercises 6, 14, 16, 26, 28 p Exercises 4c, 4d, 6, 8b, 18, 24d, 26 p Exercises 6, 12, 16 p Exercises 2c, 4c, 8b, 12, 26a, 48c p Exercises 22, 4d, 6g, 10, 20 p Exercises 4a, 4f, 14 p Exercises 12, 16,, 20, 30, 32d p Exercises 8, 12, 18, 20, 22 p Exercises 10, 12, 14, 16a, 16b p Exercises 14, 26, 28, 48 p Exercises 2, 8, 12, 18, 24, 34, 40 p Exercises 4, 26, 32, 36 p Exercises 4, 8, 20, 24 p Exercises 4, 8, 18, 20 p. 673
6 PROGRAMMING ASSIGNMENTS Your programs must be your own independent creations. They must have all standard features, such as prologues, detailed comments, indentation, error-checking, modular, and tabular output with proper headings. They must be as general as possible and should never abort. Assignment I Due: Sept Check if a (p q) (q r) (r s) (p s) is a tautology. 2. Determine if (p (q (r s))) (p q) (r s). Assignment II Due: Sept Read in two sets A and B, where U = {1,2,, n}. Print the bit-representations of A and B. Use them to find the elements in A B, A B, A, A B, A B, and A B, and their cardinalities. 4. Read in an arbitrary sequence of characters that include left and right parentheses, each containing at most 31 characters. Determine if each sequence is consists of legally paired parentheses. Assignment III Due: Oct January 1, 2000 fell on a Saturday. Determine the day of the week of January 1, 1776 and January 1, Print the calendar for February for the years 2999 and Place two queens on an 8 8 chessboard, if possible, such that one cannot attack the other. Print the total number of solutions, if they exist. Assignment IV Due: Oct Suppose you place one grain of wheat on the first square of a chess board, 2 on the second square, 4 on the third square, 8 on the fourth square, and so on. Compute the number of grains of wheat needed for the last square and the total number of grains on the chess board. 8. Construct a table of values of the Fermat numbers f n = 2^(2^n) + 1, where 0 n 6. Identify each value as prime or composite. Assignment V Due: Nov Suppose the Tower of Brahma puzzle consists of 20 disks. Print the various moves and the number of moves needed to transfer them from peg X to peg Z using peg Y as an intermediary step. 10. Print all triangular numbers 10,000 that are squares, say, (ab) 2. Make a table of the numbers a and b; do they follow any patterns? If yes, predict them. Assignment VI Due: Nov Print all solutions of the LDE x 1 + x 2 + x 3 + x 4 + x 5 = 13, where x i 0, and the number of such solutions. Redo the problem if x i > Read in a positive integer n, and list all subsets and permutations of the set {1,2,3,...,n} in lexicographic order.
7 παγε 8 Assignment VII Due: Dec Read in a positive integer n and the various edges {i,j} of a graph G with n vertices labeled 1 through n, where 1 n 12.. Print the following:. The adjacency matrix of G.. The degree of each vertex.. The linked list representation of G.. Determine if G is a simple graph.. Determine if G is a complete graph. 14. Read in a positive integer n. Determine if a knight at an arbitrary position {i,j} on an n n chessboard can visit every square on the chessboard; if yes, print the chessboard indicating the order of the squares visited; print also each row sum, each column sum, and the two diagonal sums. Is the resulting n n array a magic square? If so, why? If not, why not?
8 παγε 9 A FEW SUGGESTIONS FOR STUDYING MATHEMATICS 1. Read a few sections in advance before each class. 2. Always go to the class prepared. Be prepared to ask and answer questions. 3. Do not skip classes. The information is cumulative; every step counts. 4. Always take down notes (on the RHS of your notebook; use the LHS for problems in the book). 5. Always have some scrap paper and a pencil with you. 6. Study the material taught in class on the same day. 7. Write the definitions, properties, and theorems in your own words. Develop a working vocabulary on the subject. (Remember, math is a language.) 8. Keep on writing formulas, definitions, and facts, preferably in your own words. 9. Study the examples done in class; close your notebook; try to do them on your own. If you cannot do them without any help, study them again and then try again. Similarly, study the examples in the text and do them yourself. 10. After studying (as in step 9) the relevant portion of the section, do the corresponding exercises at the end of the section. 11. Do not skip steps or write over previous steps. 12. If you can't solve a problem because it involves a new theorem, formula, or some property, then restudy the relevant portion of the section. 13. Do math every day. Remember, practice is the name of the game. 14. Math can be learned in "small quantities" only. 15. Work with others whenever helpful. 16. Look for help when in doubt or trouble. (e.g. friend or tutor.) 17. Make the best use of your instructor's office hours. 18. Since math is a cumulative subject, you must build a good foundation to do additional work. 19. Use your time wisely and carefully. 20. Always review earlier materials before each week. Things must be fresh in your mind to build upon them.
9 παγε 10 HOW TO PREPARE FOR AN EXAM? 1. Review the definitions, formulas, and theorems. Practice writing them down. 2. Study every example worked out in class. 3. Do a few typical problems from every section. 4. On the night before the exam, go to bed early and get a good night's sleep; otherwise you won't be able to concentrate during the exam and your mind will wander around. 5. Do not stay up late trying to learn any new material. 6. On the morning of the exam, glance over all materials, for easy recollection, especially, formulas and theorems. HOW TO TAKE AN EXAM? 0. Take enough writing tools (and a good scientific calculator, if allowed for use in the exam). 1. Take a few minutes to glance over every problem quickly. 2. Next, do the problems that are easiest for you and those that carry the most weight. 3. Always write the formula, if a formula is involved. 4. Save all your work on scrap paper for later verification. 5. Then do the less easy ones. 6. Whenever possible, save enough time for checking your answers at the end. 7. Always save time to double-check the solutions that carry the most weight. Good Luck
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 informationAnswer: (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 informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationMathematical 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 informationPatterns in Pascal s Triangle
Pascal s Triangle Pascal s Triangle is an infinite triangular array of numbers beginning with a at the top. Pascal s Triangle can be constructed starting with just the on the top by following one easy
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationCatalan 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,
More informationStudent Guide and Syllabus for MAT100 Introductory Algebra
Course Information: MAT100 Introductory Algebra Section: 05C Section: 06C Section: 07C* Classroom: 341 Main Building Classroom: 341 Main Building Classroom: 341 Main Building Meeting Dates: Monday Thursday
More informationDETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH
DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationDiscrete 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 informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationPROBABILITY AND STATISTICS. Ma 527. 1. To teach a knowledge of combinatorial reasoning.
PROBABILITY AND STATISTICS Ma 527 Course Description Prefaced by a study of the foundations of probability and statistics, this course is an extension of the elements of probability and statistics introduced
More informationWOLLONGONG 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 informationSYLLABUS. OFFICE AND HOURS: Karnoutsos 536 (Access through K506) M 12, T 1, R 10, 12, 2 or by appointment. I am available by e-mail at all times.
SYLLABUS COURSE TITLE: PreCalculus COURSE NUMBER: MATH0165 REFERENCE NUMBER: 1980 PREREQUISITE: MATH0112 Intermediate Algebra or equivalent INSTRUCTOR: Dr. Riggs OFFICE AND HOURS: Karnoutsos 536 (Access
More informationMATH 241: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE, Winter 2010-2011. CLASSROOM: Alumni Hall 112 Tuesdays and Thursdays, 6:00-8:15 pm
MATH 241: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE, Winter 2010-2011 PROFESSOR: Melody Rashidian CLASSROOM: Alumni Hall 112 TIME: Tuesdays and Thursdays, 6:00-8:15 pm CONTACT INFORMATION: WEB PAGE: mrashidi@clunet.edu
More informationRegions in a circle. 7 points 57 regions
Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an
More informationMath 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
More informationHARVARD SUMMER SCHOOL
HARVARD SUMMER SCHOOL The Harvard Summer School Economics Program offers a variety of courses, ranging from introductory economics to advanced classes in micro and macroeconomic theory, econometrics, international
More informationMath 3E - Linear Algebra (3 units)
Math 3E - Linear Algebra (3 units) Fall 2015 Peralta Class Code 40772 Berkeley City College Class Hours & Location: TuTh 11AM- 12:15PM, BCC Room 422 (Fourth Floor) Instructor: Patrick Zulkowski Office
More informationOverview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series
Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them
More information67 204 Mathematics for Business Analysis I Fall 2007
67 204 Mathematics for Business Analysis I Fall 2007 Instructor Asõkā Rāmanāyake Office: Swart 223 Office Hours: Monday 12:40 1:40 Wednesday 8:00 9:00 Thursday 9:10 11:20 If you cannot make my office hours,
More informationData Structures and Algorithms Written Examination
Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where
More informationContinued 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 informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More information07/15/10 Math E-10 Precalculus Fall 2010. Course Requirements
07/15/10 Math E-10 Precalculus Fall 2010 Course Requirements Instructor: David Arias, Ed.D. E-mail: apcs2005@msn.com Web page: You need your Harvard PIN to log in. http://isites.harvard.edu/course/ext-12572/2010/fall
More informationML 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 informationProperties 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 informationMATH 2 Course Syllabus Spring Semester 2007 Instructor: Brian Rodas
MATH 2 Course Syllabus Spring Semester 2007 Instructor: Brian Rodas Class Room and Time: MC83 MTWTh 2:15pm-3:20pm Office Room: MC38 Office Phone: (310)434-8673 E-mail: rodas brian@smc.edu Office Hours:
More informationWhy? 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
More informationDeterminants in the Kronecker product of matrices: The incidence matrix of a complete graph
FPSAC 2009 DMTCS proc (subm), by the authors, 1 10 Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph Christopher R H Hanusa 1 and Thomas Zaslavsky 2 1 Department
More informationMidterm 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 informationPrentice Hall. California Edition of Algebra 1 - Classics Edition (Smith/Charles) 2008. Grade 8
Prentice Hall Grade 8 California Edition of Algebra 1 - Classics Edition (Smith/Charles) 2008 C O R R E L A T E D T O California s Map for a Basic Grade Level Program Grade 8 PROGRAM DESCRIPTION Prentice
More informationExponential Notation and the Order of Operations
1.7 Exponential Notation and the Order of Operations 1.7 OBJECTIVES 1. Use exponent notation 2. Evaluate expressions containing powers of whole numbers 3. Know the order of operations 4. Evaluate expressions
More informationMath Games For Skills and Concepts
Math Games p.1 Math Games For Skills and Concepts Original material 2001-2006, John Golden, GVSU permission granted for educational use Other material copyright: Investigations in Number, Data and Space,
More informationSTAT 1403 College Algebra Dr. Myron Rigsby Fall 2013 Section 0V2 crn 457 MWF 9:00 am
MATH 1403 College Algebra/ Rigsby/ Fall 2013 Page 1 Credit Hours: 3 Lecture Hours: 3 University of Arkansas Fort Smith 5210 GRAND AVENUE P.O. BOX 3649 FORT SMITH, AR 72913-3649 479-788-7000 Syllabus and
More informationMAT 183 - Elements of Modern Mathematics Syllabus for Spring 2011 Section 100, TTh 9:30-10:50 AM; Section 200, TTh 8:00-9:20 AM
MAT 183 - Elements of Modern Mathematics Syllabus for Spring 2011 Section 100, TTh 9:30-10:50 AM; Section 200, TTh 8:00-9:20 AM Course Instructor email office ext. Thomas John, Ph.D. thjohn@syr.edu 224
More informationGraph 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 informationSyllabus MAC1105 College Algebra
Syllabus MAC1105 College Algebra Term: Reference #: Instructor s Name: E-mail: Office: Math Lab, Room # 2223 Mail-box: Math Lab, Room # 2223 Office Hours: To leave a message for the instructor, please
More information3. 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 informationMATH 1111 College Algebra Fall Semester 2014 Course Syllabus. Course Details: TR 3:30 4:45 pm Math 1111-I4 CRN 963 IC #322
MATH 1111 College Algebra Fall Semester 2014 Course Syllabus Instructor: Mr. Geoff Clement Office: Russell Hall, Room 205 Office Hours: M-R 8-9 and 12:30-2, and other times by appointment Other Tutoring:
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationUnit 18 Determinants
Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of
More informationRecursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1
Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms
More informationAssignment 5 - Due Friday March 6
Assignment 5 - Due Friday March 6 (1) Discovering Fibonacci Relationships By experimenting with numerous examples in search of a pattern, determine a simple formula for (F n+1 ) 2 + (F n ) 2 that is, a
More informationMAKING FRIENDS WITH MATH
MAKING FRIENDS WITH MATH Workshop sponsored by: The Dr. Mack Gipson, Jr., Tutorial and Enrichment Center Presented by: Carole Overton, Director The Dr. Mack Gipson, Jr., Tutorial and Enrichment Center
More informationJMS, MAT150 THIS SYLLABUS, COURSE SCHEDULE, ASSIGNMENTS, AND EXAM DATES Summer 2014 ARE SUBJECT TO CHANGE AS CIRCUMSTANCES DICTATE.
SCOTTSDALE COMMUNITY COLLEGE MATHEMATICS DEPARTMENT MAT150, COLLEGE ALGEBRA CLASS# 16015 TIME: 12:10pm 2:20pm DAYS: M, Tu, W, Th LOCATION: CM 465 INSTRUCTOR: J. Michael Sinclair voice mail: 480-731-8866
More informationSyllabus MAC1147 Pre-Calculus Algebra and Trigonometry
Syllabus MAC1147 Pre-Calculus Algebra and Trigonometry Term: SUMMER B 2009-3 Reference #: 569147 Instructor s Name: Lun-Yi Tsai E-mail: ltsai@mdc.edu Office: Math Lab, Room # 2223 Mail-box: Math Lab, Room
More informationCSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.
Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure
More informationCurrent 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:
More informationSYLLABUS (MA 105-QL)
UAB Department of Mathematics SYLLABUS (MA 105-QL) MA 105 Pre - Calculus Algebra Semester: Fall 2011 Section: 105-QL Course ID: kravchuk07614 UAB zip code: 35294 Instructor: Dr. Elena Kravchuk Office phone:
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationSection IV.1: Recursive Algorithms and Recursion Trees
Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller
More informationI. 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 informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationV. 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 informationLecture 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 informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationExercises of Discrete Mathematics
Exercises of Discrete Mathematics Updated: February 4, 2011 Note for the students: the proposed solutions of some exercises are quite lengthy. This does not necessarily mean that the exercise is difficult:
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationHow To Study Mathematics Using My Math Lab. Preparing for Class. Using the Class Notebook
How To Study Mathematics Using My Math Lab Preparing for Class Read and review the appropriate material before class Come to class prepared. 1. Know which homework problems you have questions about and
More informationAn Introduction to Number Theory Prime Numbers and Their Applications.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 8-2006 An Introduction to Number Theory Prime Numbers and Their Applications. Crystal
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationDiscrete 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 informationMath 35 Section 43376 Spring 2014. Class meetings: 6 Saturdays 9:00AM-11:30AM (on the following dates: 2/22, 3/8, 3/29, 5/3, 5/24, 6/7)
Math 35 Section 43376 Spring 2014 Class meetings: 6 Saturdays 9:00AM-11:30AM (on the following dates: 2/22, 3/8, 3/29, 5/3, 5/24, 6/7) Instructor: Kathy Nabours Office: MTSC 133 Email: kathy.nabours@rcc.edu
More informationMATHEMATICAL TOOLS FOR ECONOMICS ECON 1078-002 FALL 2011
MATHEMATICAL TOOLS FOR ECONOMICS ECON 1078-002 FALL 2011 Instructor: Hakon Skjenstad Class Time: M, W, F, 2:00-2:50pm Classroom: HUMN 1B80 Email: hakon.skjenstad@colorado.edu Course Website: CULearn Office:
More informationLecture 7: NP-Complete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
More informationDELAWARE 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
More informationhttp://www.aleks.com Access Code: RVAE4-EGKVN Financial Aid Code: 6A9DB-DEE3B-74F51-57304
MATH 1340.04 College Algebra Location: MAGC 2.202 Meeting day(s): TR 7:45a 9:00a, Instructor Information Name: Virgil Pierce Email: piercevu@utpa.edu Phone: 665.3535 Teaching Assistant Name: Indalecio
More informationCourse Name: College Algebra Course Number: Math 1513 Semester: Fall 2015
Course Name: College Algebra Course Number: Math 1513 Semester: Fall 2015 Instructor s Name: Ricky Streight Hours Credit: 3 Office Phone: 945-6794 Office Hours: Check http://www.osuokc.edu/rickyws/ for
More informationAcquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours
Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Essential Question: LESSON 4 FINITE ARITHMETIC SERIES AND RELATIONSHIP TO QUADRATIC
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationMathematics. What to expect Resources Study Strategies Helpful Preparation Tips Problem Solving Strategies and Hints Test taking strategies
Mathematics Before reading this section, make sure you have read the appropriate description of the mathematics section test (computerized or paper) to understand what is expected of you in the mathematics
More informationLesson Plans for (9 th Grade Main Lesson) Possibility & Probability (including Permutations and Combinations)
Lesson Plans for (9 th Grade Main Lesson) Possibility & Probability (including Permutations and Combinations) Note: At my school, there is only room for one math main lesson block in ninth grade. Therefore,
More informationTo Evaluate an Algebraic Expression
1.5 Evaluating Algebraic Expressions 1.5 OBJECTIVES 1. Evaluate algebraic expressions given any signed number value for the variables 2. Use a calculator to evaluate algebraic expressions 3. Find the sum
More informationRules of Exponents. Math at Work: Motorcycle Customization OUTLINE CHAPTER
Rules of Exponents CHAPTER 5 Math at Work: Motorcycle Customization OUTLINE Study Strategies: Taking Math Tests 5. Basic Rules of Exponents Part A: The Product Rule and Power Rules Part B: Combining the
More informationWhat Is Singapore Math?
What Is Singapore Math? You may be wondering what Singapore Math is all about, and with good reason. This is a totally new kind of math for you and your child. What you may not know is that Singapore has
More informationIntroduction to Algorithms March 10, 2004 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser Quiz 1.
Introduction to Algorithms March 10, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Quiz 1 Quiz 1 Do not open this quiz booklet until you are directed
More informationA linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form
Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...
More informationCurriculum Alignment Project
Curriculum Alignment Project Math Unit Date: Unit Details Title: Solving Linear Equations Level: Developmental Algebra Team Members: Michael Guy Mathematics, Queensborough Community College, CUNY Jonathan
More informationMath 1280/1300, Pre-Calculus
Math 1280/1300, Pre-Calculus Instructor: Office: Office Hours: Phone: E-mail: MyMathLab Course Code: Text and Materials: ISBN: 1269594060 Author: Blitzer Title: Precalculus, Books a la Carte Edition Package
More informationPlanning Guide. Grade 6 Factors and Multiples. Number Specific Outcome 3
Mathematics Planning Guide Grade 6 Factors and Multiples Number Specific Outcome 3 This Planning Guide can be accessed online at: http://www.learnalberta.ca/content/mepg6/html/pg6_factorsmultiples/index.html
More informationLecture 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 informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationFinancial Mathematics and Simulation MATH 6740 1 Spring 2011 Homework 2
Financial Mathematics and Simulation MATH 6740 1 Spring 2011 Homework 2 Due Date: Friday, March 11 at 5:00 PM This homework has 170 points plus 20 bonus points available but, as always, homeworks are graded
More informationFlorida Gulf Coast University Finite Math M GF 1106 Spring 2014 CRN 11072
Florida Gulf Coast University Finite Math M GF 1106 Spring 2014 CRN 11072 Instructor: Jaffar Ali Shahul-Hameed Ph.D. Associate Professor Email: jahameed@fgcu.edu Telephone: (239) 590-1470 Office: AB7 206
More informationSYLLABUS MAC 1105 COLLEGE ALGEBRA Spring 2011 Tuesday & Thursday 12:30 p.m. 1:45 p.m.
SYLLABUS MAC 1105 COLLEGE ALGEBRA Spring 2011 Tuesday & Thursday 12:30 p.m. 1:45 p.m. Instructor: Val Mohanakumar Office Location: Office Phone #: 253 7351 Email: vmohanakumar@hccfl.edu Webpage: http://www.hccfl.edu/faculty-info/vmohanakumar.aspx.
More informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationPrentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationOpen-Ended Problem-Solving Projections
MATHEMATICS Open-Ended Problem-Solving Projections Organized by TEKS Categories TEKSING TOWARD STAAR 2014 GRADE 7 PROJECTION MASTERS for PROBLEM-SOLVING OVERVIEW The Projection Masters for Problem-Solving
More informationLAKE 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 informationMAT 096, ELEMENTARY ALGEBRA 6 PERIODS, 5 LECTURES, 1 LAB, 0 CREDITS
1 LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK MATHEMATICS, ENGINEERING and COMPUTER SCIENCE DEPARTMENT FALL 2015 MAT 096, ELEMENTARY ALGEBRA 6 PERIODS, 5 LECTURES, 1 LAB, 0 CREDITS Catalog
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationMATHEMATICAL TOOLS FOR ECONOMICS ECON 1078-001 SPRING 2012
MATHEMATICAL TOOLS FOR ECONOMICS ECON 1078-001 SPRING 2012 Instructor: Hakon Skjenstad Class Time: M, W, F, 12:00-12:50pm Classroom: DUAN G125 Email: hakon.skjenstad@colorado.edu Course Website: CULearn
More information