MATH 1030 - Mathematics for the Liberal Arts Credits: 3 Hours/Week: Lecture 3 Lab None Course Description: Designed for the liberal arts or humanities major whose program does not require statistics, college algebra, or precalculus, this course presents concepts and strategies not emphasized in traditional mathematics courses. Topics include problem-solving strategies; historical and contemporary number systems; mathematics in culture and society; cryptography; fractals; graph theory and optimal planning; growth models and finance; sets and set operations; and probability. Not intended as a prerequisite for other mathematics courses. Use of graphing technology, such as the TI-84, is required (see instructor for acceptable models). MnTC Goals 4 Mathematics/Logical Reasoning
Prerequisite(s): Course placement into MATH 1030 or higher, or concurrently enrolled in MATH 0020 , or completion of MATH 0060 or MATH 0070 or MATH 1025 or above with a grade of C or higher. Corequisite(s): None Recommendation: Eligible for college-level Reading and English.
Major Content
- Historical and contemporary counting systems
- Hindu-Arabic base-10 system
- Babylonian and Mayan place-value systems
- Contemporary number systems
- Binary
- Octal
- Hexadecimal
- Conversions to and from base-10
- Cryptography
- Simple shift ciphers
- Caesar cipher
- Modular arithmetic
- Operations
- Shift cipher formulas
- Fractals
- Strictly self-similar fractals
- Cantor set
- Koch curve
- Sierpinski gasket
- Hausdorff dimension
- Mandelbrot set
- Complex numbers
- Recursive formula
- Sets
- Set notation
- Describing sets
- Set operations
- Union
- Intersection
- Complement
- Venn diagrams
- Probability
- Counting
- Basic counting principles
- Permutations
- Combinations
- Probability of an event
- Probability rules for the set operations
- Venn diagrams and probability
- Growth models and finance
- Growth models
- Linear
- Exponential
- Logistic
- Simple finance
- Simple interest
- Compound interest
- Continuous compound interest
- Consumer finance
- Annuities
- Loans
- Graph theory and networks
- Components of a graph
- Types of graphs
- Graphs with weighted and unweighted edges
- Optimal planning
- Dijkstra’s algorithm for optimal path
- Sorted edges algorithm for Hamiltonian circuits
- Kruskal’s algorithm for minimum cost spanning tree
- Euler paths and circuits
Learning Outcomes At the end of this course students will be able to:
- perform independent investigations of mathematical ideas.
- demonstrate critical and logical reasoning when solving problems.
- describe how various mathematical ideas have developed over time.
- describe the history of mathematics and the interaction between different cultures in relation to mathematics.
- quantify concepts in the real-world using numbers.
- apply mathematics to a changing world and everyday situations employing a diverse set of mathematical skills.
- identify and justify observed patterns.
- generate numeric, geometric, and algebraic patterns to demonstrate a variety of relationships.
- apply a variety of computational procedures to examine the reasonableness of conjectures and solutions to problems.
- represent mathematical information in symbolic, visual, numerical, verbal, and written forms.
- discuss the relationship between mathematics and other fields.
- integrate technological and nontechnological tools with mathematics.
- communicate clearly a problem’s solution and its explanation for the intended audience in terms of the problem pose
Competency 1 (1-6) 04. 01. Illustrate historical and contemporary applications of mathematical/logical systems.
04. 02. Clearly express mathematical/logical ideas in writing.
04. 03. Explain what constitutes a valid mathematical/logical argument(proof).
04. 04. Apply higher-order problem-solving and/or modeling strategies. Courses and Registration
Add to Portfolio (opens a new window)
|