Transcription

1 Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers. Then we prove that if p > 1 and d > 0 are integers, that p and p + d are both primes if and only if for integer n (see reference 1 and 2): n = (p 1)! 1 p + ( 1)d d! p + d + 1 p + 1 p + d We use this proof for p = F y-1 and d = F y-2 to prove the infinitude of Fibonacci prime numbers. The author would like to give many thanks to the authors of 1001 Problems in Classical Number Theory, Jean-Marie De Koninck and Armel Mercier, 2004, Exercise Number 161 (see Reference 1). The proof provided in Exercise 6 is the key to making this paper on the finitude or Fibonacci Primes possible. 1

2 Introduction The Fibonacci prime conjecture, was made by Alphonse de Fibonacci in Alphonse de Fibonacci ( ) was a French mathematician whose father, Jules de Fibonacci ( ) was prime minister of Charles X until the Bourbon dynasty was overthrown in1830. Fibonacci attended the École Polytechnique (commonly known as Polytechnique) a French public institution of higher education and research, located in Palaiseau near Paris. In 1849, the year Alphonse de Fibonacci was admitted to Polytechnique, he made what's known as Fibonacci's conjecture: For every positive integer k, there are infinitely many prime gaps of size 2k. Alphonse de Fibonacci made other significant contributions to number theory, including the de Fibonacci's formula, which gives the prime factorization of n!, the factorial of n, where n 1 is a positive integer. Proof of Infinite Number of Fibonacci Primes In number theory, a Fibonacci prime is a Fibonacci number that is also prime. It is not known whether there are infinitely many Fibonacci primes; this poof shall prove their infinitude. Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence: The sequence F n of Fibonacci numbers is defined by the following reoccurring relation: with seed values, By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. The first several Fibonacci numbers are: 2

3 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,. Of these Fibonacci numbers the following are Fibonacci primes: 2, 3, 5, 13, and 89 We shall use Euclid's logic that he used to prove there are an infinite number of prime numbers to prove there are an infinite number Fibonacci primes. First we shall assume there are only a finite number of n Fibonacci's primes for all Fibonacci numbers, specifically; 1) Say, 2, 3, 5, 13, F 11,...., F x = F x-1 + F x-2, F n = F n-1 + F n-2 Where, F x is the next to the last Fibonacci prime, x is used instead of n-1, because the last Fibonacci prime may not be the next Fibonacci number in the Fibonacci sequence. 2) Let N = 2*3*5*13*( F 11 )...., (F x-1 + F x-2 )(F n-1 + F n-2 ) +1 By the fundamental theorem of arithmetic, N is divisible by some prime q. Since N is the product of all existing Fibonacci primes plus 1, then this prime q cannot be among the F i that make up the n Fibonacci primes since by assumption these are all the Fibonacci primes that exist and N is not evenly divisible by any of the, F i Fibonacci primes. N is clearly seen not to be divisible by any of the F i Fibonacci primes. Therefore, q must be another prime number that does not exist in the finite set of Fibonacci prime numbers. The only thing left to prove that there are an infinite number of Fibonacci primes is to prove that q = F y = F y-1 + F y-2 where F y is Fibonacci prime that is not in the set of finite Fibonacci primes, since q is not in that set. First we shall show that if q = F y = F y-1 + F y-2 = p + d, where F y-1 = p and F y-2 = d, then if q is prime it cannot be in the set of finite p i Fibonacci primes above. Since q is a prime 3

4 number that does not exist in the set of finite p i Fibonacci primes, then if there exists a prime number equal to F y-1 + F y-2 that is also prime, it would be a Fibonacci prime; therefore a prime F y-1 + F y-2 cannot be in the set of finite n Fibonacci primes otherwise q would be in the set of n finite Fibonacci primes and we have proven that q is not in the set of fine Fibonacci primes, therefore if p + d is prime it cannot be in the finite set of Fibonacci primes since it would be Fibonacci to q. Now we shall proceed to prove p + d = F y-1 + F y-2 is prime as follows: We use the proof, provided in Reference 1, that if p > 1 and d > 0 are integers, that p and p + d are both primes if and only if for positive integer n: n = (p 1)! 1 p + ( 1)d d! p + d + 1 p + 1 p + d For our case p = F y-1 and d = F y-2 are Fibonacci numbers, and, F y = F y-1 + F y-2, our objective is to prove that if p = F y-1 and d = F y-2, then p + d = F y-1 + F y-2 = prime number = F y = Fibonacci prime. Since, as discussed earlier F y is outside our finite set of Fibonacci Prime, therefore, if we prove F y is prime then we will prove the infinitude of Fibonacci Primes. n = 1! 1 + ( 1) F y _ 2 F y 2! F y 2 + F y 2 Multiplying by, n( ) =! 1 + ( 1) F y _ 2 F y 2! F y 2 + F y 2 Multiplying by ( + F y 2 ) and since, is greater than 2 and is prime, then is prime and therefore F y 2 must be even for F y to be prime: n( + F y 2 )( ) = ( + F y 2 )! 1 F y 2! + + F + + F y 2 + y 2 4

5 Reducing, Reducing again, n( + F y 2 )( ) =! + F y 2 + F y 2! F y 2 n( + F y 2 )( ) = () 1)! + F y 2 + F y 2! F y 2 We already know F y-1 and F y-2 are Fibonacci numbers therefore; F y-1 and F y-2 are both positive integers. We also know that by the definition of Fibonacci numbers that the sum of F y-1 and F y-2 is a Fibonacci number, specifically, F y = F y-1 + F y-2, therefore F y is also a positive integer. Since F y-1 and F y-2 are integers the right hand side of the above equation is an integer. Since the right hand side of the above equation is an integer and F y-1 and F y-2 are integers on the left hand side of the equation, then there are only 4 possibilities (see 1, 2a, 2b, and 2c below) that can hold for n so the left hand side of the above equation is an integer, they are as follows. 1) n is an integer, or 2) n is a rational fraction that is divisible by. This implies that n = x where, is prime and x is an integer. This results in the following three possibilities: a. Since n = x, then = x n, since is prime, then is only divisible by and 1, therefore, the first possibility is for n to be equal to or 1 in this case, which are both integers, thus n is an integer for this first case. 5

6 b. Since n = x, and x is an integer, then x is not evenly divisible by unless x =, or x is a multiple of, where x = z, for any integer z. Therefore n is an integer for x = and x = z. c. For all other cases of, integer x, n = x, n is not an integer. To prove there is a Fibonacci Prime, outside our set of finite Fibonacci Primes, we only need to prove that there is at least one value of n that is an integer, outside our finite set. There can be an infinite number of values of n that are not integers, but that will not negate the existence of one Fibonacci Prime, outside our finite set of Fibonacci Primes. First the only way that n cannot be an integer is if every n satisfies paragraph 2.c above, namely, n = x, where x is an integer, x, x y, n, and n 1 for any integer z. To prove there exists at least one Fibonacci Prime outside our finite set, we will assume that no integer n exists and therefore no Fibonacci Primes exist outside our finite set. Then we shall prove our assumption to be false. Proof: Assumption no values of n are integers, specifically, every value of n is n = x, where x is an integer, x, x y, n, and n 1, for any integer z. Paragraphs 2.a, and 2.b prove cases where n can be an integer, therefore our assumption is false and there exist values of n that are integers. It suffices to show that there is at least one integer n to prove there exists a Fibonacci Prime outside our set of finite set of Fibonacci Primes. Since there exists an n = integer, we have proven that there is at least one p and p + 2k that are both prime. Since we proved earlier that if p + 2k is prime then it also is not in the finite set of p i, p i + 2k Fibonacci primes, therefore, since we have proven that there is 6

7 at least one p+2k that is prime, then we have proven that there is a Fibonacci prime outside the our assumed finite set of Fibonacci primes. This is a contradiction from our assumption that the set of Fibonacci primes is finite; therefore, by contradiction the set of Fibonacci primes is infinite. Also this same proof can be repeated infinitely for each finite set of Fibonacci primes, in other words a new Fibonacci prime can added to each set of finite Fibonacci primes. This thoroughly proves that an infinite number of Fibonacci primes exist. It suffices to show that at least one n exists that is an integer since we have proven that F y-1 and F y-1 + F y-2 = F y are both primes if and only if for integer n: n = 1! 1 + ( 1) F y _ 2 F y 2! F y 2 + F y 2 Since we have proven by contradiction that at least on n = integer, we have proven that their exists at least one F y-1 + F y-2 that must be prime, and since F y = F y-1 + F y-2, then F y is also prime. Since we proved earlier that if F y-1 + F y-2 is prime then it also is not in the finite set of p i Fibonacci primes, therefore, since we have proven that F y-1 + F y-2 = F y is prime, then we have proven that there is a Fibonacci prime outside our assumed finite set of Fibonacci primes. This is a contradiction from our assumption that the set of Fibonacci primes is finite, therefore, by contradiction the set of Fibonacci primes is infinite. Also this same proof can be repeated infinitely for each finite set of Fibonacci primes, in other words a new Fibonacci prime can added to each set of finite Fibonacci primes. This thoroughly proves that an infinite number of Fibonacci primes exist. 7

Proof that an Infinite Number of Mersenne Prime Numbers Exit Stephen Marshall 29 Aug 2014 Abstract This paper presents a complete and exhaustive proof of the infinitude of Mersenne prime numbers. The approach

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition

4 Number Theory I: Prime Numbers Number theory is the mathematical study of the natural numbers, the positive whole numbers such as 2, 17, and 123. Despite their ubiquity and apparent simplicity, the natural

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

Math 11 Spring 01 Written Homework 3 Due Wednesday, February 19 Instructions: Write complete solutions on separate paper (not spiral bound). If multiple pieces of paper are used, they must be stapled with

The Equation x 2 + y 2 = z 2 The equation x 2 + y 2 = z 2 is associated with the Pythagorean theorem: In a right triangle the sum of the squares on the sides is equal to the square on the hypotenuse. We

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

More Mathematical Induction October 7, 016 In these slides... Review of ordinary induction. Remark about exponential and polynomial growth. Example a second proof that P(A) = A. Strong induction. Least

Chapter 3 Proof 3.1 The Nature of Proof We begin with a philosophical discussion on the nature of proof. When a person is arrested for a crime and brought to trial, it is assumed that the prosecution has

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

THE p-adic EXPANSION OF RATIONAL NUMBERS KEITH CONRAD 1. Introduction In the positive real numbers, the decimal expansion of every positive rational number is eventually periodic 1 (e.g., 1/55.381.381...)

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosophy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

Gödel s Theorem: An Incomplete Guide to Its Use and Abuse by Torkel Franzén Summary by Xavier Noria August 2006 fxn@hashref.com This unique exposition of Kurt Gödel s stunning incompleteness theorems for

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

CS 2336 Discrete Mathematics Lecture 5 Proofs: Mathematical Induction 1 Outline What is a Mathematical Induction? Strong Induction Common Mistakes 2 Introduction What is the formula of the sum of the first

chapter Learning Outcomes In this chapter you will learn: ÂÂ ÂÂ ÂÂ ÂÂ ÂÂ ÂÂ ÂÂ ÂÂ How to define the real numbers About factors, multiples and prime factors How to write a whole number as a product of prime

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

3.3. INFERENCE 105 3.3 Inference Direct Inference (Modus Ponens) and Proofs We concluded our last section with a proof that the sum of two even numbers is even. That proof contained several crucial ingredients.

Big Idea(s): Operations on sets of numbers are performed according to properties or rules. An operation works to change numbers. There are six operations in arithmetic that "work on" numbers: addition,

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

Introduction In mathematics, there are three theorems that are significant enough to be called fundamental. The first theorem, of which this essay expounds, concerns arithmetic, or more properly number

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.