1 Yes, I read a large magnitude of papers. Great and happy scribing. Perfectly written. Wonderful for me – Jim Troutman 3.141592653589793238.

Slides:



Advertisements
Similar presentations
Mod arithmetic.
Advertisements

22C:19 Discrete Structures Integers and Modular Arithmetic
22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.
Number Theory and Cryptography
Binary Addition Rules Adding Binary Numbers = = 1
Solving Quadratic Equations Algebraically Lesson 2.2.
Congruence class arithmetic. Definitions: a ≡ b mod m iff a mod m = b mod m. a  [b] iff a ≡ b mod m.
Chapter 4 Numeration and Mathematical Systems
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
Peter Lam Discrete Math CS.  Sometimes Referred to Clock Arithmetic  Remainder is Used as Part of Value ◦ i.e Clocks  24 Hours in a Day However, Time.
The Integers and Division
Chapter 4 Numeration and Mathematical Systems
MATHEMATICS CURRICULUM FOR SA I. DIVISION OF MARKS UNITMARKS NUMBER SYSTEMS11 ALGEBRA23 GEOMETRY17 TRIGONOMETRY22 STATISTICS17 TOTAL90 FIRST TERM.
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
Hero’s and Brahmagupta’s Formulas Lesson Hero of Alexandria He was an ancient Greek mathematician and engineer who was born in 10 AD. He invented.
Chapter 3 Greek Number Theory The Role of Number Theory Polygonal, Prime and Perfect Numbers The Euclidean Algorithm Pell’s Equation The Chord and Tangent.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 3 (Part 2): The Fundamentals: Algorithms, the.
Whole Numbers Are the whole numbers with the property of addition a group?
Mathematics of Cryptography Part I: Modular Arithmetic
February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.
Foundations Basics: Notation, and other things Algebraic manipulations Indices, Logs, Roots and Surds Binomial expansion Trigonometric functions Trigonometric.
Chapter 4 Number Theory in Asia The Euclidean Algorithm The Chinese Remainder Theorem Linear Diophantine Equations Pell’s Equation in Brahmagupta Pell’s.
CompSci 102 Discrete Math for Computer Science February 16, 2012 Prof. Rodger.
Algebra 1 Notes: Lesson 8-5: Adding and Subtracting Polynomials.
Chapter 1 Section 1. Examples: 2 x 2 system 2 x 3 system 3 x 2 system.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 1 Chapter 9 Quadratic Equations and Functions.
1 π It is quite curious that π is related to probability. The probability that two natural numbers selected at random will be relatively prime is This.
Chinese Remainder Theorem Dec 29 Picture from ………………………
Chapter 2 (Part 1): The Fundamentals: Algorithms, the Integers & Matrices The Integers and Division (Section 2.4)
Chinese Remainder Theorem. How many people What is x? Divided into 4s: remainder 3 x ≡ 3 (mod 4) Divided into 5s: remainder 4 x ≡ 4 (mod 5) Chinese Remainder.
HIGH SCHOOL: Algebra Perform arithmetic operations on polynomials. A-APR.1. Understand that polynomials form a system analogous to the integers, namely,
Module #9 – Number Theory 1/5/ Algorithms, The Integers and Matrices.
Chapter 5.3. Give an algebraic expression that represents the sequence of numbers. Let n be the natural numbers (1, 2, 3, …). 2, 4, 6, … 1, 3, 5, … 7,
Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.
4 examples with counters 4 examples with number lines
CHAPTER TWO: LINEAR EQUATIONS AND FUNCTIONS ALGEBRA TWO Section Linear Inequalities in Two Variables.
Discrete Mathematics 4. NUMBER THEORY Lecture 7 Dr.-Ing. Erwin Sitompul
Chinese Remainder Theorem Ying Ding Junru Chen. Chinese Remainder Theorem Sun Zi suanjing ( 孫子算經 The Mathematical Classic by Sun Zi) Shushu Jiuzhang (
PreCalculus Section 1.6 Solve quadratic equations by: a. Factoring b. Completing the square c. Quadratic formula d. Programmed calculator Any equation.
Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.
History of Mathematics Jamie Foster.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
CS480 Cryptography and Information Security
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.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
Chapter 3 The Fundamentals: Algorithms, the integers, and matrices Section 3.4: The integers and division Number theory: the part of mathematics involving.
PreCalculus Section 1. 6 Solve quadratic equations by: a. Factoring b
CS 210 Discrete Mathematics The Integers and Division (Section 3.4)
Congruence class arithmetic
6.7 Graphing and Solving Quadratic Inequalities
6*. An Introduction to Number Theory
MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.
Chapter 4 Number Theory in Asia
Chapter 4 Numeration and Mathematical Systems
Sullivan Algebra and Trigonometry: Section 1.3
Learning Resource Services
SECTION 9-3 : SOLVING QUADRATIC EQUATIONS
Modular Arithmetic and Change of Base
Chapter 4 Numeration Systems 2012 Pearson Education, Inc.
Section 10.3 Modular Arithmetic
College Algebra 1.6 Other Equations
Discrete Mathematics Chapter 4 Number Theory. Discrete Mathematics Chapter 4 Number Theory.
Algebra 5 Congruence Classes.
Lecture 2-3 Basic Number Theory and Algebra
Section 9.3 Modular Arithmetic.
Presentation transcript:

1 Yes, I read a large magnitude of papers. Great and happy scribing. Perfectly written. Wonderful for me – Jim Troutman

2 Cultural Connection The Asian Empires China before 1260 A.D. Student led discussion. India before 1206 A.D. Rise of Islam 622 A.D A.D.

3 7 – Chinese, Hindu, and Arabian Mathematics The student will learn about Early mathematics from the east and middle east regions.

4 §7-1 China – sources and periods Student Discussion.

5 §7-2 China – Shang to the Tang Student Discussion.

6 §7-3 China – Tang to the Ming Student Discussion.

7 §7-3 China –Tang to Ming See page Chinese Rod System

8 §7-4 China – Concluding Remarks Student Discussion.

9 §7-5 India - General Survey Student Discussion.

10 §7-5 India - Ramanujan Srinivasa Ramanujan (1887 – 1920) Taxi Number = 1729 = is very nearly an integer. It is about  which is an integer followed by twelve zeros. That is, it is eighteen digits a decimal point followed by twelve zeros before the next non zero digit!!!! * *

11 §7-5 India - Ramanujan 2 Srinivasa Ramanujan (1887 – 1920) * * *

12 §7-6 Number Computing Student Discussion.

13 §7-6 Multiplication 237 x 45 = 237 x x x x

14 §7-6 Multiplication 237 x 45By lattice

15 §7-7 Arithmetic and Algebra Student Discussion.

16 §7–8 Geometry and Trigonometry Student Discussion.

17 §7–8 Geometry and Trigonometry Area of a cyclic quadrilateral. K 2 = (s – a)(s – b)(s – c)(s – d) Diagonals of a cyclic quadrilateral.

18 §7–9 Contrast Greek & Hindu Student Discussion.

19 §7–10 Arabia – Rise of Moslem Culture Student Discussion.

20 §7–11 Arabia – Arithmetic & Algebra Student Discussion.

21 §7–11 Arabia – Arithmetic & Algebra Casting out nines. Method of false positioning. x + x/4 = 30 Try ____ ?

22 §7–12 Arabia – Geometry & Trigonometry Student Discussion.

23 §7– 13 Arabia Etymology Student Discussion.

24 §7–14 Arabia – Contribution Student Discussion.

25 Assignment Read Chapter 8

26 Quadratic Solutions 1 The Greeks and Hindu’s used a method similar to our completing the square. x 2 + p x = q The unshaded portion to the right is x 2 + p x or q. If we add the shaded region (p/2) 2 we get a square with side of x + p/2. (x + p/2) 2 = q + (p/2) 2 OR x x p/2

27 Quadratic Solutions 1b x 2 + p x = q P = 10, q = 39, p/2 = 5 and (p/2) 2 = 25 (x + 5) 2 = 8 2 x x 10/2 x x = 39 x x + 25 = = 64 x + 5 = 8 x = 8 – 5 = 3

28 Quadratic Solutions 2 Al-Khowârizmî’s Solution Method x 2 + p x = q The unshaded portion to the right is x 2 + p x or q. If we add the shaded region 4 (p/4) 2 we get a square with side of x + p/2. (x + 2(p/4)) 2 = q + 4 · (p/4) 2 OR xp/4

29 Quadratic Solutions 2b x 2 + p x = q P = 10, q = 39, p/4 = 5/2 and (p/4) 2 = 25/4 (x + 5) 2 = 8 2 x x = 39 x x + 4 · (25/4) = · 25/4 = 64 x + 5 = 8 x = 8 – 5 = 3 xp/4

30 Chinese Remainder Theorem 2 Let n 1, n 2,..., n r be positive integers so that the g.c.d. (n i, n j ) = 1 for i  j, then the system of linear congruencies - x  a 1 (mod n 1 ), x  a 2 (mod n 2 ),..., x  a r (mod n r ). Has a simultaneous solution, which is unique modulo (n 1 · n 2 ·... · n r ), namely,  = a 1 N 1 x 1 + a 2 N 2 x a r N r x r where N k = n 1 · n 2 · · · n r | n k and x k = solution to N k x k  1 (mod n k )

31 Chinese Remainder Theorem 2b  = a 1 N 1 x 1 + a 2 N 2 x 2 + a 3 N 3 x 3 n 1 = 3 n 2 = 5 n 3 = 8 then x  2 (mod 3) x  1 (mod 5) x  4 (mod 8) has a unique solution. a 1 = 2 a 2 = 1 a 3 = 4 n = n 1 · n 2 · n 3 = 3 · 5 · 8 = 120 N 1 = 120 | 3 = 40 N 2 = 120 | 5 = 24 N 3 = 120 | 8 = 15 and 40 · x 1  1 (mod 3) yields x 1 = 1 24 · x 2  1 (mod 5) yields x 2 = 4 15 · x 3  1 (mod 8) yields x 3 = 7

32 Chinese Remainder Theorem 2b  = a 1 N 1 x 1 + a 2 N 2 x 2 + a 3 N 3 x 3 then is a unique solution to a 1 = 2 a 2 = 1 a 3 = 4 N 1 = 40 N 2 = 24 N 3 = 15 Substitute into x 1 = 1 x 2 = 4 x 3 = 7  = 2 · 40 · · 24 · · 15 · 7 = x  2 (mod 3) x  1 (mod 5) x  4 (mod 8) Note: Unique modulo 120 (3 · 5 · 8) So 596, 476, 356, 236, 116 are all solutions Confirm 116 is a solution. 596