The study of abstract algebra grew out of an interest in knowing how attributes of sets of mathematical objects behave when one or more properties we associate with real numbers are restricted. The student will begin this course by reviewing basic set theory, integers, and functions in order to understand how algebraic operations arise and are used. The student then will proceed to the heart of the course, which is an exploration of the fundamentals of groups, rings, and fields. Upon successful completion of this course, the student will be able to: Describe and generate groups, rings, and fields; Relate abstract algebraic constructs to more familiar number sets and operations and see from where the constructs derive; Identify examples of specific constructs; Identify and differentiate between different structures and understand how changing properties give rise to new structures; Explain the theory behind relations and functions and identify domains and images of functions, based on the structures given; Explain how functions may relate seemingly dissimilar structures to each other and how knowing properties of one structure allows us to know the same properties in the related structure, if certain functions exist between them. (Mathematics 231)
The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.
Love math but bored in math class? This is the course for you! Combinatorics is a fascinating branch of mathematics that applies to problems ranging from card games to quantum physics to the internet. The only pre-requisite is basic algebra; however we will be covering a lot of material. A mathematically agile mind will be helpful.
In this Cyberchase video segment, Matt and Jackie must figure out which combination of knob and key will get them one step closer to retrieving the Black Crystal.
This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Subject:
Mathematics and Statistics, Science and Technology
A work in progress, this FlexBook is an introduction to theoretical probability and data organization. Students learn about events, conditions, random variables, and graphs and tables that allow them to manage data.
In this video segment from Cyberchase, the CyberSquad tries to reach Ms. Fileshare by using a 3 x 3 matrix to figure out the various ways they can travel to her.
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
