An Abstract Algebra Class Designed for Secondary Mathematics Teachers by Justin R. Hill and Dr. Christopher Thron Texas A&M UniversityCentral Texas.

Slides:



Advertisements
Similar presentations
1.6 Functions. Chapter 1, section 6 Functions notation: f: A B x in A, y in B, f(x) = y. concepts: –domain of f, –codomain of f, –range of f, –f maps.
Advertisements

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Lecture 15 Functions CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
DEFINITION A function f : A  B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A  B to indicate that.
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Instructor: Hayk Melikya
hap8.html#chap8ex5.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Discrete Mathematics Lecture # 16 Inverse of Relations.
          . Geoff Birky, Jim Fey, Tim Fukawa-Connelly, Kadian Howell, and Carolina Napp-Avelli University of Maryland Abstract Algebra for.
Lecture 3.2: Public Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.
 become fluent in the fundamentals of mathematics, including through varied and frequent practice with increasing complex problems over time, so that.
Chapter 2 Sets, Relations, and Functions SET OPERATIONS The union of A and B.
3-4 Algebra Properties Used in Geometry The properties of operations of real numbers that you used in arithmetic and algebra can be applied in geometry.
CSE 311 Foundations of Computing I Lecture 12 Primes, GCD, Modular Inverse Spring
CS555Spring 2012/Topic 61 Cryptography CS 555 Topic 6: Number Theory Basics.
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
Mathematical Explanations and Arguments Number Theory for Elementary School Teachers: Chapter 1 by Christina Dionne Number Theory for Elementary School.
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Exam 2 Review 8.2, 8.5, 8.6, Thm. 1 for 2 roots, Thm. 2 for 1 root Theorem 1: Let c 1, c 2 be elements of the real numbers. Suppose r 2 -c 1.
Temperature Readings The equation to convert the temperature from degrees Fahrenheit to degrees Celsius is: c(x) = (x - 32) The equation to convert the.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
COMP 170 L2 Page 1 Review for Midterm 1 l Part I: Counting n L01-L03 l Part II: Number Theory and Cryptography n L04, L05.
Temperature Readings The equation to convert the temperature from degrees Fahrenheit to degrees Celsius is: c(x) = (x - 32) The equation to convert the.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Discrete Mathematics R. Johnsonbaugh
Discrete Mathematics Relation.
Chinese Remainder Theorem Dec 29 Picture from ………………………
1 Network and Computer Security (CS 475) Modular Arithmetic and the RSA Public Key Cryptosystem Jeremy R. Johnson.
Mathematical Preliminaries
Network and Computer Security (CS 475) Modular Arithmetic
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 5 Relations and Functions.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Math 3121 Abstract Algebra I Lecture 14 Sections
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Introduction to Math Methods Math Standards. Why can math be fun? Math can be fun because… it can have so much variety in topics. many different ways.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Algebraic Proofs. 1. Transitive property of equality 2. Symmetric property of equality 3. Reflexive property of equality 4. Substitution 5. Addition property.
Department of Mathematics
Discrete Mathematics Lecture 7
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
Chapter 3 The Real Numbers.
CS 280 Midterm Review.
Applied Symbolic Computation (CS 300) Modular Arithmetic
Systems Architecture I
Applied Symbolic Computation (CS 300) Modular Arithmetic
Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic
Relations and their Properties
CSE 321 Discrete Structures
Applied Symbolic Computation (CS 300) Modular Arithmetic
Applied Symbolic Computation (CS 300) Modular Arithmetic
Lecture 5 Number Theory & Proof Methods
Applied Symbolic Computation (CS 300) Modular Arithmetic
          .
Matrix arithmetic: the product of two matrices
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Agenda Lecture Content: Relations (Relasi)
Lecture # 16 Inverse of Relations
Presentation transcript:

An Abstract Algebra Class Designed for Secondary Mathematics Teachers by Justin R. Hill and Dr. Christopher Thron Texas A&M UniversityCentral Texas

Obstacles to Abstract Algebra For a Certifying Student: Abstract Algebra requires: 1)An ease in generalization of patterns, concepts, and definitions. 2)Constant but unprompted mental play with concrete examples. 3)High familiarity with algebraic structures such as complex numbers, modular arithmetic, and matrices. 4)An ease in thinking in terms of sets and functions. 5)Previous experience with proofs.

Textbook Methodology: Based on material from Abstract Algebra: Theory and Applications, by Thomas W. Judson; and Proofs and Concepts, by Dave Witte Morris and Joy Morris. (both available on the web; modified with permission) We revised and amplified that material, focusing on concrete examples and exercises to develop and practice each concept, skill, and proof technique. Classroom Methodology: Scaled back lectures in favor of group work on exercises that elucidated skills and concepts being taught. Lecture was used instead to: (1) review students comprehension of the reading; and (2) fill in gaps of understanding and skill apparent from group work.

Skills in Generalization and Mental Play with Concrete Examples – Work with concrete examples. – They see and extend patterns through discussion/examples/ exercises. – Use directed exercises to generalize the use of a concept or definition. All generalizing and mental work is modeled.

Familiarity with Complex Numbers, Modular Arithmetic, and Matrices Chapter 1: Complex Numbers – The Origin of Complex Numbers – Arithmetic with… – Alternative Representations of… – Applications of… Chapter 2: Modular Arithmetic – The Basics – The Integers Mod n – Modular Equations

Thinking in Terms of Sets and Functions Chapter 3: Sets – Set Basics – Set Relations – Set Operations – Properties of Set Operations – Do the subsets of a set form a group? Chapter 4: Functions – Cartesian Product – Introduction to Functions – One-to-One Functions – Onto Functions – Bijections – Composition of Functions – Inverse Functions v

Proofs Direct Proofs Contradiction Induction Element-by-Element One-to-One Onto Reflexive Transitive Symmetric Algebraic Proofs iff Proofs Uniqueness Proofs

Proofs (cont.)

Did it Work? Survey: All but one student said the same two things: What they Appreciated: The abundance and use of examples and exercises in the textbook and in the classroom What it lacked: More examples. Grades: