My Favorite “Conjecture” By: none other than THE GREAT Ben Carroll “Goldbach’s Conjecture”

Slides:



Advertisements
Similar presentations
Fermat’s Last Theorem Dr. S. Lawrence ©2005.
Advertisements

Discrete Mathematics Lecture 3
Mathematical Induction
Mathematical Induction
Structure and Randomness in the prime numbers Terence Tao, UCLA New Fellows Seminar, 11 July 2007.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Euclidean Number theory From the Algorithm to the Basic Theory of Numbers.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.
PRIME NUMBERS  FOR EXAMPLE 7 IS A PRIME NUMBER BECAUSE ONLY 1 AND 7 EVENLY DIVIDE IT.  NUMBERS WHICH HAVE MORE FACTORS OTHER THAN 1 AND THE 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,
Number Theory: Fermat’s Last Theorem Fermat’s last conjecture/Wiles’ Theorem: For n>2 the equation x n +y n =z n has no solutions in terms of non-zero.
Activity 2-14: The ABC Conjecture
Triangle Inequality Theorem Communication Tools. What is the Triangle Inequality Theorem? In mathematics, the triangle inequality states that for any.
Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.
Great High School Mathematics I Wish I Had Learned in High School Dan Kennedy Baylor School Chattanooga, TN.
GOLDBACH’S CONJECTURE Simple, but Unproved. Goldbach’s Conjecture Christian Goldbach, March 18, November 20, 1764, stated that: “Every even number.
Number Theory Number Theory: A reflection of the basic mathematical endeavor. Exploration Of Patterns: Number theory abounds with patterns and requires.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
 Derived out of the Number Theory  A conjecture proposed by Christian Goldbach in 1742: “Every even number greater than 2 is the sum of two primes”
Powerpoint Templates Page 1 Powerpoint Templates Mathematics & Proofs.
Activity 2-17 : The ABC Conjecture
SECTION 5-3 Selected Topics from Number Theory Slide
Week 3 - Wednesday.  What did we talk about last time?  Basic number theory definitions  Even and odd  Prime and composite  Proving existential statements.
Mathematical Maxims and Minims, 1988
The first reason we need to an expression is to represented an expression in a simpler form. The second reason is it allows us to equations. FACTOR EQUIVALENT.
Shaping Modern Mathematics: The Queen of Mathematics Raymond Flood Gresham Professor of Geometry.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 1 Problem Solving and Critical Thinking.
Fermat’s Last Theorem??. Who was Fermat? Born in France Became city councilor in Toulouse Then he became a judge Had a reputation for being distracted.
© 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.
Chapter 11 The Number Theory Revival
Great High School Mathematics I Wish I Had Learned in High School NCSSM Teaching Contemporary Mathematics Conference January 27, 2007 Dan Kennedy Baylor.
Theorems and conjectures
Quit Pierre de Fermat Fermat’s Last Conjecture Prime Numbers Euler’s Conjecture.
1.1 Patterns and Inductive Reasoning
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
1.1 – PATTERNS AND INDUCTIVE REASONING Chapter 1: Basics of Geometry.
CONJECTURES. A conjecture is a statement that must be proved or disproved.
Factor A factor of an integer is any integer that divides the given integer with no remainder.
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.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 09a: PROOF STRATEGIES Section 3.1 Jarek Rossignac CS1050:
Section 1.8. Proof by Cases Example: Let b = max{a, b} = a if a ≥ b, otherwise b = max{a, b} = b. Show that for all real numbers a, b, c
Factoring an Integer My favorite way of factoring an integer is by using a Factor Tree Shown below is a simple problem, factoring the number
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Prime and Composite Numbers
Inductive Reasoning Section 1.2. Objectives: Use inductive reasoning to make conjectures.
3.3 Mathematical Induction 1 Follow me for a walk through...
1 Mathematical Induction. 2 What is induction? A method of proof It does not generate answers: it only can prove them Three parts: Base case(s): show.
Number Theory The Integers; Order of Operations Rational Numbers
Chapter 4 (Part 1): Induction & Recursion
How Many Ways Can 945 Be Written as the Difference of Squares?
Public Key Encryption Engineering & Analysis Operation-Part2
Section 5.1 Number Theory.
My Favorite Theorem By Josh Zimmer.
Exercise Use mathematical induction to prove the following formula.
Follow me for a walk through...
CS 220: Discrete Structures and their Applications
The Hailstone Sequence
Mathematical Induction
2.2 Patterns & Inductive Reasoning
Follow me for a walk through...
Adding and Subtracting Integers
Activity 2-14: The ABC Conjecture.
Follow me for a walk through...
Inductive Reasoning.
2 4 −4 −2 −5 −3 −
Chapter 1 Basics of Geometry.
1.1 Patterns and Inductive Reasoning
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

My Favorite “Conjecture” By: none other than THE GREAT Ben Carroll “Goldbach’s Conjecture”

- Unsolved?!! In number theory??!!! In ALL of Mathematics???!!!! -It States: “Every even integer greater than 2 can be written as the sum of two primes.”evenintegerprimes Goldbach first stated on 7 June 1742, in a letter to Euler, that “Every ineterger greater than 2 can be written as the sum of three primes.” This was abandoned (as he considered 1 a prime number), and the modern version of his conjecture states, “Every integer greater than 5 can be written as the sum of three primes.”

Euler became interested and replied with an equivalent conjecture: “Every even integer greater than 2 can be written as the sum of two primes.” Euler added that he regarded this an entirely certain theorem, despite being unable to prove it. “Strong” Goldbach Conjecture “Weak” Goldbach Conjecture

So why is in my favorite “theorem?” IT’S SIMPLE ADDING!!!!!! And YET it still hasn’t been proven!!!

GO NAVY!!!!