Part II – Theory and Computations. Major Ideas....

Slides:

Advertisements

Similar presentations

Section 4.1: Primes, Factorization, and the Euclidean Algorithm Practice HW (not to hand in) From Barr Text p. 160 # 6, 7, 8, 11, 12, 13.

Advertisements

Thinking Mathematically

5.1 Number Theory. The study of numbers and their properties. The numbers we use to count are called the Natural Numbers or Counting Numbers.

Number Theory and the Real Number System

Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.

Thinking Mathematically

1 Section 2.4 The Integers and Division. 2 Number Theory Branch of mathematics that includes (among other things): –divisibility –greatest common divisor.

Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.

February 19, 2015Applied Discrete Mathematics Week 4: Number Theory 1 The Growth of Functions Question: If f(x) is O(x 2 ), is it also O(x 3 )? Yes. x.

The Fundamental Theorem of Arithmetic (2/12) Definition (which we all already know). A number greater than 1 is called prime if its only divisors are 1.

Copyright © 2013, 2010, and 2007, Pearson Education, Inc.

Quotient-Remainder Theory, Div and Mod

NUMBER THEORY Chapter 1: The Integers. The Well-Ordering Property.

Elementary Number Theory and Methods of Proof. Basic Definitions An integer n is an even number if there exists an integer k such that n = 2k. An integer.

Chapter II. THE INTEGERS

Fundamental Theorem of Arithmetic. Euclid's Lemma If p is a prime that divides ab, then p divides a or p divides b.

Properties of the Integers: Mathematical Induction

Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.

BY MISS FARAH ADIBAH ADNAN IMK

The Integers and Division

A number that divides evenly into a larger number without a remainder Factor- Lesson 7 - Attachment A.

Homework Review notes Complete Worksheet #2. Homework State whether the conditional sentence is true or false 1.If 1 = 0, then 1 = – 1 True F F T.

Section 5.1 Number Theory.

1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find.

Algebraic Structures: An Activities Based Course MATH 276 UWM MATH 276 UWM.

Numbers MST101. Number Types 1.Counting Numbers (natural numbers) 2.Whole Numbers 3.Fractions – represented by a pair of whole numbers a/b where b ≠ 0.

SECTION 5-1 Prime and Composite Numbers Slide

HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 1.9.

Convert Fractions GCF & LCM Prime and Composite Divisibility

Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.

Copyright © Zeph Grunschlag, Basic Number Theory Zeph Grunschlag.

MAT 320 Spring 2008 Section 1.2.  Start with two integers for which you want to find the GCD. Apply the division algorithm, dividing the smaller number.

Lesson #05 Prime Factorization Prime means: A # can only be divided by itself or 1 Example: 13 is prime cuz it’s only divisible evenly by 13 or 1 Factors:

Activity 1-8: Repunits 111, 11111, , are all repunits. They have received a lot of attention down the.

01/29/13 Number Theory: Factors and Primes Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Boats of Saintes-Maries Van Gogh.

Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.

Factor A factor of an integer is any integer that divides the given integer with no remainder.

 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 5 Number Theory and the Real Number System.

Slide Copyright © 2009 Pearson Education, Inc. 5.1 Number Theory.

Part I: Numbers and Operations Lesson 1: Numbers.

Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.

Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.

Number Theory: Prime and Composite Numbers

Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.

Agenda Review:  Relation Properties Lecture Content:  Divisor and Prime Number  Binary, Octal, Hexadecimal Review & Exercise.

Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,

Section 5.1 Number Theory.

Warm Up Compute the following by using long division.

3x + 2 6x3 - 5x2 – 12x – 4 2x2 – 3x – 2 6x3 + 4x2 -9x2 – 12x -9x2 – 6x

Section 5.4 – Dividing Polynomials

Number Theory and the Real Number System

Chapter 5: Number Theory

Copyright © 2016, 2013, and 2010, Pearson Education, Inc.

Thinking Critically 4.1 Divisibility Of Natural Numbers

MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.

Applied Discrete Mathematics Week 4: Number Theory

Section 5.1 Number Theory.

Number Theory and the Real Number System

A number that divides evenly into a larger number without a remainder

Dividing Polynomials.

Section 5.1 Number Theory.

DISCRETE COMPUTATIONAL STRUCTURES

Applied Discrete Mathematics Week 10: Introduction to Counting

Starter: There are 25 prime numbers under 100.

Number Theory: Prime & Composite Numbers

From the last time: gcd(a, b) can be characterized in two different ways: It is the least positive value of ax + by where x and y range over integers.

Sets, Combinatorics, Probability, and Number Theory

Presentation transcript:

Part II – Theory and Computations

Major Ideas....

Fundamental Theorem of Arithmetic (Prime Factorization Theorem) Each natural number n can be written as a product of prime numbers in one and only one way (except for the order of the factors).

THEOREM: If n > 2 is a composite number, then n has a prime divisor p such that CORLLARY: If n > 2 has no prime divisors p such that, then n is a prime number. APPLICATION: To test whether a number n is a prime you only have to check whether n is divisible by the primes

The numbers 2, 3, 5 and 7 determine primes < 100 5

The primes above determine all primes < 10,

Counting Factors... How can we count the factors of a number? For example: How many factors does 180 have?

Counting Factors...

Proofs.... (The ones that can be explained to interested students.) Infinitely many primes, determining whether a number is prime, and divisibility by 3.

Another Look... (with a possibility for generalization)

Can you see what is happening in the following slide? In particular, what are the blue numbers?

The blue numbers are the remainders from dividing 1, 10, 100, 1000, 10000, etc. by 3

Can you see what is happening in the following slide? In particular, what are the blue numbers?

Notice the repetition!!

The blue numbers are the remainders from dividing 1, 10, 100, 1000, 10000, etc. by 7

Can you state a give a conjecture concerning divisibility by 7?

1, 3, 2, 6, 4, 5, 1, 3, 2, 6, 4, 5,...

Can you find the pattern for divisibility by 11?

Answer: 1,10,1,10,1,10,...

Computations...

Most calculators and computers use the Euclidean algorithm.

iPart, gcd and lcm – TI-83 commands PCHECK – (program) determines whether a number is prime. PFACT – (program) gives the prime factorization of a number. TI-83 Programs...