prime numbers: facts and discoveries

Slides:



Advertisements
Similar presentations
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
Advertisements

Grid method for multiplying by a 1 digit number. 1.Firstly, write the multiplication sum and then draw the grid. The largest number goes at the top so.
Amazing Math Trick 234X =??? Trick! Trick!
1 Prime & Composite Numbers Stage 4 - Year 7 Press Ctrl-A ©2009 – Not to be sold/Free to use.
Ch. 10: What is a number?. MAIN DEFINITION OF THE COURSE: A symmetry of an object (in the plane or space) means a rigid motion (of the plane or space)
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Study Guides Quantitative - Arithmetic - Numbers, Divisibility Test, HCF and LCM Mycatstudy.com.
Euclidean Number theory From the Algorithm to the Basic Theory of Numbers.
May 2005Special NumbersSlide 1 Special Numbers A Lesson in the “Math + Fun!” Series.
Whiteboardmaths.com © 2004 All rights reserved
Types of Number
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,
Factors, Fractions, and Exponents
Congruence class arithmetic. Definitions: a ≡ b mod m iff a mod m = b mod m. a  [b] iff a ≡ b mod m.
Lecture ,3.3 Sequences & Summations Proof by Induction.
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
What are some of the ways you that that we can categorise numbers?
Euclid’s Classification of Pythagorean triples Integer solutions to x 2 +y 2 =z 2. These give right triangles with integer sides. Examples (2n+1,2n 2 +2n,2n.
Chapter 1 Equations, Inequalities, and Mathematical Models 1.4 Complex Numbers.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Greatest Common Factor Least Common Multiple Prime Factorization
Chapter 4 Systems of Linear Equations; Matrices
Data Representation Number Systems.
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
Arithmetic of Positive Integer Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 8 × 2 4.
GCF and LCM Lesson 3.01.
Slide 5-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Methods of Proof & Proof Strategies
Quantitative - Arithmetic - Numbers, Divisibility Test, HCF and LCM
Mathematics of Cryptography Part I: Modular Arithmetic
Amazing Facts on Prime Numbers
MATH 224 – Discrete Mathematics
I am a two-digit number I am between 10 and 20 I am a multiple of 3
Introduction to Proofs
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
Extending the Definition of Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 -8.
Divisibility Rules!.
Ways to Check for Divisibility Dividing By 1 All numbers are divisible by 1.
Long Division. We are going to try to solve 837 ÷ 27.
Math 409/409G History of Mathematics Books VII – IX of the Elements Part 3: Prime Numbers.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Warm-Up. TEST Our Ch. 9 Test will be on 5/29/14 Complex Number Operations.
12 INFINITE SEQUENCES AND SERIES. In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series.
Week 4 - Monday.  What did we talk about last time?  Divisibility  Quotient-remainder theorem  Proof by cases.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Number Systems Natural Numbers. Where Our Numbers Came From The earliest known evidence for writing or counting are scratch marks on a bone from 150,000.
Whiteboardmaths.com © 2004 All rights reserved
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Ways to Check for Divisibility Dividing by 2 All even numbers are divisible by 2 Even numbers are numbers that end with either 2, 4, 6, 8, or 0.
Week 4 - Wednesday.  What did we talk about last time?  Divisibility  Proof by cases.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
MA/CSSE 473 Day 07 Extended Euclid's Algorithm Modular Division Fermat's little theorem intro.
Copyright © Cengage Learning. All rights reserved. 7 Rational Functions.
INFINITE SEQUENCES AND SERIES In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series and.
MODULE – 1 The Number System
Number Theory (Chapter 7)
Place Value, Names for Numbers, and Reading Tables
There is a five-digit number with all the digits different and all are greater than zero. It is a multiple of 4. If the ones digit is cancelled, then the.
MODULE – 1 The Number System
A Lesson in the “Math + Fun!” Series
Presentation transcript:

prime numbers: facts and discoveries MIND BOGGLING!!!!

The largest known prime number Facts: The largest known prime number The largest known prime number is 257,885,161 − 1, a number with 17,425,170 digits.

How many prime numbers are there? The table below gives you an indication of how many prime numbers there are in all numbers.   Range 0 to ? No of  Primes % Prime 10 4 40.0% 100 25 25.0% 1,000 168 16.8% 10,000 1,229 12.3% 100,000 9,592 9.6% 1,000,000 78,498 7.8% 10,000,000 664,579 6.6% 100,000,000 5,761,455 5.8% 1,000,000,000 50,847,534 5.1% 10,000,000,000 455,052,511 4.6% The percentage decreases with the increase in numbers

Are there infinite number of primes?? A proof that there are an infinite number of primes: Assume there is a finite number of primes. We then multiply all these primes together. The resulting number will be a number divisible by every single prime. Now add 1. We now have a number that, when you divide it by any prime, will have a remainder of 1. That means we have just discovered another prime (This proof was proposed by Euclid in his work Elements (Book IX, Proposition 20)

Here are few amazing prime numbers, these prime numbers were proved by the XVIIIthcentury. 31 331 3331 33331 333331 3333331 33333331 The next number 333333331 is not a prime number. Whereas it is multiplied by 17 x 19607843 = 333333331

Interesting discoveries: Truncatable primes You can drop off any amount of digits from a side and the resulting number will remain prime 73939133 is the largest known right- truncatable prime. 357686312646216567629137 is the largest known left- truncatable prime.

Carrousel Primes It deals with the 1379 digits in the number. You replace all the ones with threes, all the threes with sevens, all the sevens with nines, and all the nines with ones. Then the fun part is trying to find out if the transformed number is also prime. 19 -> 31 -> 73 ->97 131 -> 373 -> 797 -> 919 157 -> 359 -> 751 -> 953 821 -> 823 -> 827 -> 829 2111->2333->2777->2999

Heinz Rectangle puzzle You make a rectangle of prime numbers where all the rows and the columns have prime numbers . Each number following the pervious must be the next prime number. The sums of the rows will also be prime.

Example: 5 7 11 13 17 53 19 67 23 83 29 101

19 23 29 71 31 83 37 97

Prime Number Trick 1. Ask your friends to pick any prime number greater than 3. 2. Square it. 3. Add 14. 4. Divide by 12. Without knowing which prime number your friends picked, you can still tell them:      There will be a remainder of 3.

The mathematics behind this is rather simple. 1 The mathematics behind this is rather simple. 1. Let p be a prime number, p > 3. 2. Squaring gives:      p^2. 3. Adding 14 gives:      p^2 + 14 4. Taking it modulo 12 gives:     (p^2 + 14) mod 12 We want to show that:     (p^2 + 14) mod 12 = 3 This is equivalent to:     p^2 – 1 is divisible by 12. That is:     (p-1)(p+1) is divisible by 12.

For a number to be divisible by twelve, it has to be divisible both by 3 and by 4. We know that, out of p-1, p and p+1, one of them must be divisible by 3; and it can’t be p, because p is prime and greater than 3. Thus, either p-1 or p+1 is divisible by 3, and so their product is also:     (p-1)(p+1) is divisible by 3. Now, since p is a prime greater than 3, we know that it is odd. Therefore, both p-1 and p+1 are even numbers. The product of two even numbers is divisible by 4, so:     (p-1)(p+1) is divisible by 4. Combining this with the above, we get that:     (p-1)(p+1) is divisible by 12. And hence:     (p^2 + 14) mod 12 = 3

Prime spiral Despite their importance, the distribution of prime numbers among the integers is still a mystery. There is no pattern dictating which numbers will be prime or how far apart successive primes will be. The seeming randomness of the primes makes the pattern found in "Ulam spirals" very strange indeed. In 1963, the mathematician Stanislaw Ulam noticed an odd pattern while doodling in his notebook during a presentation: When integers are written in a spiral, prime numbers always seem to fall along diagonal lines

A VERY INTERESTING FACT ABOUT THE NUMBER 37: 111 / 37 = 3 222 / 37 = 6 333 / 37 = 9 444 / 37 = 12 555 / 37 = 15 666 / 37 = 18 777 / 37 = 21 888 / 37 = 24 999 / 37 = 27 OBSERVATIONS: All the three digit numbers on the left hand side are divisible by 37. All the numbers on the right hand side are divisible by the number 3.

AN INTERESTING USE Prime numbers are not all that useful but they are interesting. Here is an interesting fact that you may like to think about. The astronomer Carl Sagan wanted to broadcast prime numbers to the Universe as a signal to alien life forms that we exist & are intelligent.

bibliography www.google.com www.wikipedia.com www.livescience.com/26584-5-mind-boggling-math-facts.html www.murderousmaths.co.uk

Efforts by: GROUP 4 Ritu Samiksha Shagun Somali