Prime Numbers – True/False. 3. There are infinitely many primes. True We can prove this by assuming there aren’t: Multiply all the primes together,

Slides:



Advertisements
Similar presentations
RSA.
Advertisements

CSE115/ENGR160 Discrete Mathematics 03/15/12
Week 3 - Friday.  What did we talk about last time?  AES  Public key cryptography.
22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.
1.  The set N = {1,2,3,4,……..} is known as natural numbers or the set of positive integers  The natural numbers are used mainly for :  counting  ordering.
Chapter 4 Number Theory. Terms Factors Divides, divisible, divisibility Multiple.
GOLDBACH’S CONJECTURE Simple, but Unproved. Goldbach’s Conjecture Christian Goldbach, March 18, November 20, 1764, stated that: “Every even number.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
My Favorite “Conjecture” By: none other than THE GREAT Ben Carroll “Goldbach’s Conjecture”
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
Section 5.1 Number Theory.
SECTION 5-3 Selected Topics from Number Theory Slide
Structures 5 Number Theory What is number theory?
Methods of Proof & Proof Strategies
Merkle-Hellman Knapsack Cryptosystem Merkle offered $100 award for breaking singly - iterated knapsack Singly-iterated Merkle - Hellman KC was broken by.
Chapter 10 Trey. Factors: Factors are numbers that you can multiply to get a certain number. Some examples of factors are below. Factors of 10 1, 2, 5,
Factors and Multiples. Definition of Factors and Multiples If one number is a factor of a second number or divides the second (as 3 is a factor of 12),
Factors and Multiples.
© T Madas. A prime number or simply a prime, is a number with exactly two factors. These two factors are always the number 1 and the prime number itself.
Lesson 1. DefinitionExamples  Ends 0, 2, 4, 6, or 8  1,234  98  456  1,592,342.
Make sure yours is correct BEFORE you glue!!. any of the numbers that are added together a step by step solution to a problem the answer to a subtraction.
Ways to Check for Divisibility Dividing By 1 All numbers are divisible by 1.
Theorems and conjectures
Properties of Operations in Math Lesson 2. Inverse Operations Means: “putting together” a problem and “taking it apart” using the same numbers by + and.
Merkle-Hellman Knapsack Cryptosystem
1.1 Patterns and Inductive Reasoning
Lesson 1-1: Patterns & Inductive Reasoning
Prime Factorization. Prime Numbers A Prime Number is a whole number, greater than 1, that can be evenly divided only by 1 or itself.
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:
1.2 Patterns and Inductive Reasoning. Ex. 1: Describing a Visual Pattern Sketch the next figure in the pattern
Positive and Negative numbers. Negative numbers A positive or negative whole number, including zero, is called an integer. For example, –3 is an integer.
1.1 Patterns and Inductive Reasoning
1.1 – PATTERNS AND INDUCTIVE REASONING Chapter 1: Basics of Geometry.
Ways to Check for Divisibility Dividing By 1 All numbers are divisible by 1.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
CONJECTURES. A conjecture is a statement that must be proved or disproved.
What use are prime numbers? ?. o All the primes, apart from 2, are odd numbers. o 1 is not a prime number. Why? o There are infinitely many prime numbers!
Unit 01 – Lesson 08 – Inductive Reasoning Essential Question  How can you use reasoning to solve problems? Scholars will  Make conjectures based on inductive.
Copyright © Curt Hill Proofs An Introduction.
5 Minute Check Determine the missing digit to make the statement true. Complete on the back of your homework. 1. 6, ?59 is divisible by 3.   2.
Week 4 - Wednesday.  What did we talk about last time?  Finished DES  AES.
PRIME NUMBERS AND FACTOR TREES. DEFINITION Prime Number – An integer whose only factors are 1 and itself 2, 3, 5, 7,11, 13, 17, 19.
All even numbers are divisible by 2 Even numbers are numbers that end with either 0, 2, 4, 6, or 8.
NUMBER SYSTEM.
Prime Factors Friday, 19 February 2016 Objective Write a number as a product of its prime factors. Find the HCF and LCM of two numbers.
The Fundamentals: Algorithms, Integers, and Matrices CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Do Now Write as an exponent 3 x 3 x 3 x 3 4 x 4 x 4 x 4 x 4 5 x 5 x 5 What is a factor? Define in your own words.
Inductive Reasoning Section 1.2. Objectives: Use inductive reasoning to make conjectures.
Objective #5: Solve Compound Inequalities
Section 5.1 Number Theory.
Number Theory The Integers; Order of Operations Rational Numbers
Multiplying 2 Digit Factors
Exercise 24 ÷ 2 12.
Explain why 5 is a prime number.
Section 5.1 Number Theory.
Section 5.1 Number Theory.
Math Vocabulary Part 1.
The Hailstone Sequence
Brackets out, brackets in
Prime Factorization.
2.2 Patterns & Inductive Reasoning
Inductive Reasoning.
Prime Factors Objective
Chapter 1 Basics of Geometry.
Maths Unit 2 - Multiples, factors & primes
1.1 Patterns and Inductive Reasoning
Maths Unit 7 - Multiples, Factors, Primes & Negatives
Presentation transcript:

Prime Numbers – True/False

3. There are infinitely many primes. True We can prove this by assuming there aren’t: Multiply all the primes together, then add 1. This number is one more than a multiple of any of them, so it doesn’t divide by any of the primes. Since any number either divides by other primes or is itself prime, this must be a new prime. But we used all of them: Contradiction!

Prime Numbers – True/False 4. There are infinitely many twin primes. Unknown Twin primes are primes 2 apart. It is conjectured that this is true (and even that there are an infinite number of primes 4 apart, 6 apart, 8 apart, etc) but not yet proven.

Prime Numbers – True/False

6. Any integer greater than 2 can be written as the sum of two primes. Unknown Known as Goldbach’s Conjecture, we suspect this to be true (no counter-examples have been found), but it is still unproven.

Prime Numbers – True/False

8. $100,000 was offered to factorise a 309 digit number. True RSA encryption is based on the difficulty of factorising large numbers. Two large primes are multiplied together to produce a ‘Public Key’, meaning anyone can encrypt data to send to you, but only you - the person who generated the public key - can decrypt it. The only known way to break the code is to factor the public key.