An introduction to mathematical reasoning and to the kind of mathematics appropriate for the study of properties of (possibly large) finite systems. Topics include proof techniques, mathematical induction, elementary number theory, combinatorics, relations, and graph theory. Applications will be made to the construction of models useful in the social and physical sciences and to the study of algorithms in computer science. Prerequisite: MATH 111 (Group II)

Global Search Catalog Search
Choose Search Location

Search Keyword Field

Whole Word/Phrase
Advanced Search

Catalog Navigation

Catalog Home

The University

Academic Regulations and Procedures

Academic Honors and Distinctions

Degrees and Special Programs

Majors and Minors

Courses of Instruction

Student Engagement and Success and Non-Academic Regulations

Expenses and Financial Aid

Facilities

Prizes and Awards

Corporation (Board of Trustees)

University Personnel