Activity 2-17 : The ABC Conjecture www.carom-maths.co.uk.

Slides:



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

Discrete Mathematics Lecture 3
Introduction to Proofs
SPLASH! 2012 QUADRATIC RECIPROCITY Michael Belland.
Activity 1-6: Perfect Numbers and Mersenne Numbers
Chapter 3 Elementary Number Theory and Methods of Proof.
Copyright © Cengage Learning. All rights reserved.
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)
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Activity 1-16: The Distribution Of Prime Numbers
1 Discovery in Mathematics an example (Click anywhere on the page)
Prime Numbers A prime number is a number with exactly two factors The first ten prime numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29.
Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
Activity 2-14: The ABC Conjecture
Copyright © Cengage Learning. All rights reserved.
Properties of the Integers: Mathematical Induction
Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
prime numbers: facts and discoveries
BY MISS FARAH ADIBAH ADNAN IMK
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.
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.
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-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.
Structures 5 Number Theory What is number theory?
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.
Activity 1-15: Ergodic mathematics
Prime Numbers A whole number greater than 1 whose only whole number factors are 1 and itself
Activity 2-17: Zeroes of a Recurrence Relation
Factors
Chapter 11 The Number Theory Revival
Polynomials Expressions like 3x 4 + 2x 3 – 6x and m 6 – 4m 2 +3 are called polynomials. (5x – 2)(2x+3) is also a polynomial as it can be written.
Quit Pierre de Fermat Fermat’s Last Conjecture Prime Numbers Euler’s Conjecture.
Activity 1-7: The Overlapping Circles
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
Prime Factorization. Prime Numbers A Prime Number is a whole number, greater than 1, that can be evenly divided only by 1 or itself.
Chapter 2 (Part 1): The Fundamentals: Algorithms, the Integers & Matrices The Integers and Division (Section 2.4)
Activity 2-15: Elliptic curves
CONJECTURES. A conjecture is a statement that must be proved or disproved.
Factors Prime Factors Multiples Common Factors and Highest Common Factor (HCF) Factors and Multiples Common Multiples and Lowest Common Multiple (LCM)
Activity 1-8: Repunits 111, 11111, , are all repunits. They have received a lot of attention down the.
Math 409/409G History of Mathematics Books VII – IX of the Elements Part 1: Divisibility.
Activity 1-13: Descent This problem is due to Euler. Task: Show that the equation x 3 + 2y 3 + 4z 3 = 0 has the sole solution (0,
Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.
 Sophie Germain  Mathematician, physicist, and philosopher.  Born April 1, 1776, in Rue Saint-Denis, Paris, France  Died: June 27, 1831  Got educated.
Factor A factor of an integer is any integer that divides the given integer with no remainder.
Whiteboardmaths.com © 2004 All rights reserved
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.
Activity 2-11: Quadratic Reciprocity
AF2. Turn off your phones Primes, gcd, some examples, reading.
Activity 1-12 : Multiple-free sets
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
Multiples, Factors and Primes. Multiples A multiple of a number is found by multiplying the number by any whole number. What are the first six multiples.
Activity 1-3: Coincidences
Which of these is 52 written as a product of its prime factors? a) 2 x 26b) 2 x 2 x 13 c) 4 x 13d) 1 x 52.
Factors
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
Chapter 4 (Part 1): Induction & Recursion
Activity 2-11: Quadratic Reciprocity
Activity 2-18: Cyclotomic polynomials
The Number Theory Revival
Activity 2-15: Elliptic curves
Elementary Number Theory & Proofs
Activity 2-18: Cyclotomic polynomials
Activity 2-14: The ABC Conjecture.
Presentation transcript:

Activity 2-17 : The ABC Conjecture

The ‘square-free part’ of a number is the largest square-free number that divides into it. A square-free number is one that is not divisible by any square except for 1. So 3  5  7  13 = 1365 is square-free. So 3 3  5 4  7 2  13 2 = is not square-free. This is called ‘the radical’ of an integer n. To find rad(n), write down the factorisation of n into primes, and then cross out all the powers.

Task: can you find rad(n) for n = 25 to 30?

25 = 5 2, rad(25)=5 26 = 2  13, rad(26)=26 27 = 3 3, rad(27)=3 28 = 2 2  7, rad(28)=14 29 = 29, rad(29)=29 30 = 2  3  5, rad(30)=30

Task: now pick two whole numbers, A and B, whose highest common factor is 1. (This is usually written as gcd (A, B) = 1.) Now say A + B = C, and find C. Now find D = Do this several times, for various A and B. What values of D do you get?

1. Now try A = 1, B = Now try A = 3, B = Now try A = 1, B = gives D = 2 2. gives D = gives D =

It has been proved by the mathematician Masser that D can be arbitrarily small. That means given any positive number ε, we can find numbers A and B so that D < ε. ABC Excel spreadsheet Try to see what this means using the

The ABC conjecture says; has a minimum value greater than zero whenever n is greater than 1.

‘Astonishingly, a proof of the ABC conjecture would provide a way of establishing Fermat's Last Theorem in less than a page of mathematical reasoning. Indeed, many famous conjectures and theorems in number theory would follow immediately from the ABC conjecture, sometimes in just a few lines.’ Ivars Peterson

‘The ABC conjecture is amazingly simple compared to the deep questions in number theory. This strange conjecture turns out to be equivalent to all the main problems. It's at the centre of everything that's been going on. Nowadays, if you're working on a problem in number theory, you often think about whether the problem follows from the ABC conjecture.’ Andrew J. Granville

‘The ABC conjecture is the most important unsolved problem in number theory. Seeing so many Diophantine problems unexpectedly encapsulated into a single equation drives home the feeling that all the sub- disciplines of mathematics are aspects of a single underlying unity, and that at its heart lie pure language and simple expressibility.’ Dorian Goldfeld

With thanks to: Ivars Peterson's MathTrek Carom is written by Jonny Griffiths,