MA10209 – Week 7 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 6) Dont panic! A lot of people struggled.

Slides:



Advertisements
Similar presentations
Solving Cubics Starting Problem solve
Advertisements

MA10210: ALGEBRA 1B
MA10209 – Week 2 Tutorial B3/B4, Andrew Kennedy. Top Tips (response to sheet 1) Make sure you answer the question - requires a yes/no as well as an explanation.
MA10209 – Week 8 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 7) Be careful with calculations, this is.
MA10210: ALGEBRA 1B
Functions Rosen 1.8.
Concepts and Vocabulary
Quiz on weight and mass This quiz has 10 multiple choice questions Click on the answer box you think is correct BEWARE ! One mistake and you have to start.
AP Calculus BC Review for Quiz -Determining convergence of geometric series -Creating a power series -Finding a Taylor Series sum expression.
MA10210: Algebra 1B
Ζ GCSE- Changing the Subject Dr Frost Objectives: To be able to change the subject of a formula where the term appears multiple times, and where the equation.
Mathematics of Cryptography Part II: Algebraic Structures
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
Chapter 8 – Introduction to Number Theory. Prime Numbers prime numbers only have divisors of 1 and self –they cannot be written as a product of other.
Number Theory and Cryptography
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Congruence class arithmetic. Definitions: a ≡ b mod m iff a mod m = b mod m. a  [b] iff a ≡ b mod m.
Proof Must Have Statement of what is to be proven.
Chapter 8 – Introduction to Number Theory Prime Numbers
Richard Fateman CS 282 Lecture 61 Evaluation/Interpolation (I) Lecture 6.
Algebra 1 Glencoe McGraw-Hill JoAnn Evans
Answers to page 74 #22-31.
Great Theoretical Ideas in Computer Science.
Mathematics of Cryptography Part I: Modular Arithmetic
MA10209 – Week 4 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 3)  Talk about injective maps, not injective.
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
CompSci 102 Discrete Math for Computer Science February 16, 2012 Prof. Rodger.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 3 Polynomial and Rational Functions Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Big Ideas 3.4 Solving Equations Using Multiplication and Division
MA10209 – Week 5 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 4)  Try to think about whether answers make.
Section 2.1 Solving Equations Using Properties of Equality.
MA10209 – Week 6 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 5)  Proof by example is not a proof at all.
“Teach A Level Maths” Vol. 2: A2 Core Modules
Chinese Remainder Theorem Dec 29 Picture from ………………………
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Algebra Properties Definition Numeric Example  Algebraic Example.
EXAMPLE 4 Multiplying Numbers in Scientific Notation Find the product ( ) ( ). = ( ) ( ) = =
Cyclic Groups A Cyclic Group is a group which can be generated by one of its elements. That is, for some a in G, G={a n | n is an element of Z} Or, in.
Algebra 1 Chapter 2 Section : Solving One-Step Equations An equation is a mathematical statement that two expressions are equal. A solution of an.
Rules to Remember When solving an equation, the goal is to get the variable by itself. Addition and Subtraction are inverse operations. (opposites) Multiplication.
Solving Equations When you solve an equation, you always DO THE SAME THING to both sides of the equation y + (-4) = Wait for the BB message before.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2015 Nitesh Saxena.
Solving 1-Step Equations 2 An Equation is Like a Balance.
Use Inverse Matrices to Solve Linear Systems Objectives 1.To find the inverse of a square matrix 2.To solve a matrix equation using inverses 3.To solve.
MA10209 – Week 3 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 How to go about a proof  Step 1: Identify what you need to show  Sometimes.
Great Theoretical Ideas in Computer Science.
Cryptography Lecture 14 Arpita Patra © Arpita Patra.
Divisibility and Modular Arithmetic
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
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 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Solving Inequalities. ● Solving inequalities follows the same procedures as solving equations. ● There are a few special things to consider with inequalities:
Properties of Elementary Functions
The Relation Induced by a Partition
Multiplication and Division of Powers
Properties of Operations
Modular Arithmetic and Change of Base
Lecture 3.1: Public Key Cryptography I
Justify your reasoning.
Arithmetic MOD 7 a finite algebra
Algebra 1 Section 4.2.
Suppose we want to find the value of y when x = 3 if
Presentation transcript:

MA10209 – Week 7 Tutorial B3/B4, Andrew Kennedy

people.bath.ac.uk/aik22/ma10209 Top Tips (response to sheet 6) Dont panic! A lot of people struggled with Sheet 6, and if it helps, Sheet 7 isnt as bad. A few common problems:

people.bath.ac.uk/aik22/ma10209 Common problems on Sheet 6 Dont assume groups are commutative: When you multiply, multiply both sides of the equation by the same element applied to the same side (either pre- or post- multiply both sides) Multiplication by the inverse shouldnt be written like division Some of the notation for division assumes that multiplication is commutative, which it isnt always. Even if it is commutative, stick to the usual notation for inverses unless you obviously mean division in the traditional sense.

people.bath.ac.uk/aik22/ma10209 Common problems on Sheet 6 Be careful! Its easy to get confused as to whats happening when Write out every step, clearly and with reasons If you cant give a reason, you probably dont understand what youre doing – go and look at notes Dont confuse associativity and commutativity: Commutativity: We can change the order of the elements were multiplying Associativity: We can change the order in which we compute the multiplication (Changing the order of the elements themselves may change the result)

people.bath.ac.uk/aik22/ma10209 Subgroups Let G be a group A subset H of G is a subgroup if the group operation of G, restricted to H causes H to be a group For H a subset of G, show the following are equivalent:

people.bath.ac.uk/aik22/ma10209 Chinese Remainder Theorem We can see that so that and -46 is one integer satisfying the conditions (there are infinitely many)

people.bath.ac.uk/aik22/ma10209 Exercise Sheet 7 - Overview Q1 – similar to tutorial example Q2 – 9 divides 2n+1 2n+1 = 0 mod 9 2n = -1 mod 9 Q3 – dont unpick Euclid if you can avoid it – try to spot a number that satisfies the conditions Q4 – we want to find a number u such that Q5 – u, d coprime, so there exist λ, μ such that 1=λu + μd.

people.bath.ac.uk/aik22/ma10209 Exercise Sheet 7 - Overview Q6 – more general than the Chinese Remainder Theorem since we dont have m, n coprime. How many elements of the domain map to each element in the image? Q7 – another question about groups – remember tips from the start of the tutorial Q8 – Euler function – look at its properties Q9 – sieve of Eratosthenes gives that and so on, provided that x-a > 0.