Scribd
Upload
18 views

SMA 2100 Discrete Mathematics

Sma 2100 rev

Uploaded by

Fredrick Barasa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

SMA 2100 Discrete Mathematics

Sma 2100 rev

Uploaded by

Fredrick Barasa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SMA 2100 Discrete Mathematics (45 Contact Hours)

Course Description:
Logic: open sentences, propositions, mathematical statements, variables, truth values, truth sets,
logical equivalence, truth tables, negation of statements, conjunction, disjunction, implication,
contrapositive, converse, inverse, necessity and sufficiency, if and only if; tautology, contradiction,
contingency; existential and universal quantifiers, negation with quantifiers, and counterexample;
validity of arguments, rules of inference; applications to logic circuits. Set theory: elements,
specification, empty, cardinality, finite and infinite, singleton set, subsets, equality, equivalence,
universal, Venn diagram; union, intersection, disjoint, partitions, complement, difference, logical
arguments, set of sets, power set, identities, principle of inclusion-exclusion, and Cartesian
products. Functions: relations and functions, domain, codomain, images, range, pre-image,
formulae and examples, identity, specification and composition; bracket, absolute value; injections,
surjection, bijections and inverses; sum, difference, product and quotient; increasing and decreasing
functions; applications such as to cipher creations and crypto analysis. Numbers: natural, prime,
integer, rational and irrational, real, complex; laws of arithmetic including comparison with laws of
set theory and logic; evenness and oddness, denseness, real number lines, intervals and inequalities.
Methods of proof: direct, contrapositive, contradiction, and principle of mathematical induction.
Course Textbooks:
1. Elias Zakon (2001), Basic Concepts of Mathematics, The Trillia Group, ISBN:
9781931705004.
2. Bostock L. & Chandler S. (2000), Core Mathematics for Advanced Level, 3rd ed.,
Stanley Thornes Publishers Ltd, ISBN: 978-0748755097.
3. Kenneth Rossen (2011), Discrete Mathematics and its Applications, McGram-Hill,
ISBN-13: 978-0073383095.
4. Hungerford T. W. & Mercer R. (1991), College Algebra, Saunders College Publishing,
ISBN: 978-0030595219.
5. Booth D. J. (1991), Foundation Mathematics, Addison Wesley, ISBN: 978-0201416985.

Reference Textbooks:
1. Rowan G. & John T., (2009), Discrete Mathematics: Proofs, Structures and Applications,
CRC Press, ISBN: 9781439812808.
2. W. D. Wallis (2003), A Beginners Guide to Discrete Mathematics, Springer Science &
Business Media, ISBN: 978-0817642693.
3. M. Aigner (2007), Discrete Mathematics, American Mathematical Society, ISBN:
9780821886151.
Course Journals:
1. Discrete Mathematics Journal, ISSN: 0012-365X.
2. Discrete Applied Mathematics Journal, ISSN: 0166-218X.
3. SIAM Journal on Discrete Mathematics, ISSN: 0895-4801.
Reference Journals:
1. Journal of Discrete Mathematics, ISSN: 2090-9837.
2. Open journal of Discrete Mathematics, ISSN: 2161-7643.
3. Japanese Journal of Mathematics, ISSN: 1861-3624.

You might also like