Around Prime Numbers And Twin Primes

Similar documents
Then we characterize primes and composite numbers via divisibility

Ikorong Anouk Gilbert Nemron

2012 Volume 20 No.2-3

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

Elementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)

Representing Integers as the Sum of Two Squares in the Ring Z n

Mersenne and Fermat Numbers

Introduction Integers. Discrete Mathematics Andrei Bulatov

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS

The Euler Phi Function

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE

Composite Numbers with Large Prime Factors

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

MATH342 Practice Exam

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Jonathan Sondow 209 West 97th Street, New York, New York

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract

PRIME NUMBERS YANKI LEKILI

MATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s,

p-adic Properties of Lengyel s Numbers

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

3 Properties of Dedekind domains

The inverse Goldbach problem

ON FREIMAN S 2.4-THEOREM

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally

6 Binary Quadratic forms

Math 5330 Spring Notes Prime Numbers

Math 412: Number Theory Lecture 3: Prime Decomposition of

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia

HENSEL S LEMMA KEITH CONRAD

By Evan Chen OTIS, Internal Use

An Original Speech Around the Difficult Part of the Berge Conjecture (Solved by Chudnovsky, Robertson, Seymour and Thomas)

Sets of Real Numbers

MAS 4203 Number Theory. M. Yotov

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations

Examples from Elements of Theory of Computation. Abstract. Introduction

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Statements, Implication, Equivalence

The sum of squares for primes

BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO

Before we talk about prime numbers, we will spend some time with divisibility because there is

MATH 2710: NOTES FOR ANALYSIS

Piotr Blass. Jerey Lang

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems

DIVISIBILITY CRITERIA FOR CLASS NUMBERS OF IMAGINARY QUADRATIC FIELDS

All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

Heuristics on Tate Shafarevitch Groups of Elliptic Curves Defined over Q

Almost All Palindromes Are Composite

On the Multiplicative Order of a n Modulo n

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

On Erdős and Sárközy s sequences with Property P

Ma/CS 6a Class 2: Congruences

ON THE SET a x + b g x (mod p) 1 Introduction

God may not play dice with the universe, but something strange is going on with the prime numbers.

Younggi Choi and Seonhee Yoon

An Overview of Witt Vectors

Characteristics of Fibonacci-type Sequences

THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN

Congruences and exponential sums with the sum of aliquot divisors function

RECENT PROGRESS ABOUT THE CONJECTURE OF ERDÖS- STRAUS Ibrahima GUEYE 1, Michel MIZONY 2

Notes on Systems of Linear Congruences

Algebraic number theory LTCC Solutions to Problem Sheet 2

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2)

Hölder Inequality with Variable Index

JEAN-MARIE DE KONINCK AND IMRE KÁTAI

Practice Final Solutions

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES

Introductory Number Theory

RESEARCH STATEMENT THOMAS WRIGHT

1 Riesz Potential and Enbeddings Theorems

A LLT-like test for proving the primality of Fermat numbers.

Diophantine Equations and Congruences

LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS

GAUSSIAN INTEGERS HUNG HO

192 VOLUME 55, NUMBER 5

MATH 215 Final. M4. For all a, b in Z, a b = b a.

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Factorability in the ring Z[ 5]

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An Estimate For Heilbronn s Exponential Sum

Sums of Squares. Bianca Homberg and Minna Liu

Math 104B: Number Theory II (Winter 2012)

DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions

On the Diophantine Equation x 2 = 4q n 4q m + 9

Math 3336 Section 4.3 Primes and Greatest Common Divisors. Prime Numbers and their Properties Conjectures and Open Problems About Primes

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.

Chapter 5: The Integers

HASSE INVARIANTS FOR THE CLAUSEN ELLIPTIC CURVES

Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania Daniel White

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN

INTRODUCTORY LECTURES COURSE NOTES, One method, which in practice is quite effective is due to Abel. We start by taking S(x) = a n

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

Verifying Two Conjectures on Generalized Elite Primes

Commutators on l. D. Dosev and W. B. Johnson

Transcription:

Theoretical Mathematics & Alications, vol. 3, no. 1, 2013, 211-220 ISSN: 1792-9687 (rint), 1792-9709 (online) Scienress Ltd, 2013 Around Prime Numbers And Twin Primes Ikorong Anouk Gilbert Nemron 1 Abstract In this aer, we characterize rimes; we give two characterizations of twin rimes and we state the general conjecture. We recall (see [1] or [2] or [3] or [4] or [5] or [6] or [7] or [8]) that an integer t is a twin rime, if t is a rime 3 and if t 2 or t + 2 is also a rime 3; for examle, it is easy to check that (881, 883) is a coule of twin rimes. Mathematics Subject Classification : 05xx and 11xx. Keywords: twin rimes. Introduction This aer is divided into three sections. In section 1, we state and rove a Theorem which imlies characterizations of rimes and twin rimes. In section 2, we use the Theorems of section 1 to characterize rimes and to give two characterizations of twin rimes. In section 3, using the Theorem of section 1, we state the general conjecture from which all the results mentioned follow. 1 Centre de Calcul d Enseignement et de Recherche. e-mail: ikorong@ccr.jussieu.fr Article Info: Received : January 4, 2013. Published online : Aril 15, 2013

212 1 Statement and roof of Theorem which imlies characterizations of rimes and twin rimes We recall that for every integer n 1, n! is defined as follow: 1 if n = 1, n! = 2 if n = 2, 1 2... n if n 3. We also recall that if x and z are integers such that x 1 and z 1, then x divides z if there exists an integer y 1, such that z = xy. Theorem 1.1. Let n be an integer 4. Then, n + 1 is rime or n + 1 divides n!. Before roving Theorem 1.1, let us remark the following. Remark 1.2. Let n be an integer 4. If n + 1 = 2 (where is rime), then n + 1 divides n!. Proof. Otherwise [we reason by reduction to absurd], clearly 2 does not divide n! (1) and we observe the following. Observation 1.2.1. is a rime 3. Otherwise, clearly = 2, and noticing (via the hyotheses) that n + 1 = 2, then using the revious two equalities, it becomes trivial to deduce that n = 3; a contradiction, since n 4 (via the hyotheses). Observation 1.2.2. n. Otherwise, > n and the revious inequality clearly says that n + 1. (2) Now noticing (via the hyotheses) that n + 1 = 2, then, using the revious equality and using (2), we trivially deduce that n + 1 and n + 1 = 2. From these relations we clearly have that 2 ; a contradiction, since 3 (by using Observation 1.2.1).

213 Observation 1.2.3. 2 n. Otherwise, 2 > n and the revious inequality clearly says that 2 n + 1. (3) Now noticing (via the hyotheses) that n + 1 = 2, then, using the revious equality and using (3), we trivially deduce that 2 n + 1 and n + 1 = 2. which clearly says that 2 2 ; a contradiction, since 3 (by using Observation 1.2.1). Observation 1.2.3 follows. Observation 1.2.4. 2. Indeed, it is immediate that 2, since 3 (by using Observation 1.2.1). Observation 1.2.4 follows. The revious trivial observations made, look at (recall that is rime); observing (by Observations 1.2.2 and 1.2.3 and 1.2.4) that n and 2 n and 2, then, it becomes trivial to deduce that which immediately imlies that {, 2} {1, 2, 3,..., n 1, n}. 2 divides 1 2 3... n 1 n. This clearly says that 2 2 divides n!; in articular 2 clearly divides n! and this contradicts (1). Remark 1.2 follows. The revious remark made, now we rove Theorem 1.1. Proof of Theorem 1.1. If n + 1 is rime, then the roof is ended. If n + 1 is not rime, then n + 1 divides n!. Otherwise (we reason by reduction absurd) n + 1 is not rime and n + 1 does not divide n!, (4) and we observe the following. Observation 1.1.1. Let be a rime such that n + 1 is divisible by ( such a clearly exists). Then n+1 is an integer and n+1 n and n and n+1 Indeed, it is immediate that n+1 =. is an integer [since divides n + 1], and it is also immediate that n+1 n [otherwise, n + 1 > n; now, remarking that 2 (since is rime), then the revious two inequalities imly that

214 n + 1 > 2n; so 1 > n and we have a contradiction, since n 4, by the hyotheses]. Clearly n [otherwise, > n; now, recalling that n + 1 is divisible by, then the revious inequality imlies that n + 1 =. Recalling that is rime, then the revious equality clearly says that n + 1 is rime and this contradicts (4). That being so, to rove Observation 1.1.1, it suffices to rove that n+1 n+1 =. Fact: = [otherwise, clearly n+1 remarking (by using the revious) that n+1 is an integer and n+1 n; then it becomes trivial to deduce that n+1 integers such that {, n+1 immediately imlies that n+1 ; now, n and and are two different } {1, 2, 3,..., n 1, n}. The revious inclusion divides 1 2 3... n 1 n; therefore n + 1 divides n!, and this contradicts (4). So n+1 = ]. Observation 1.1.1 follows. The revious trivial observation made, look at n + 1; observing (by using Observation 1.1.1) that is rime such that n+1 n + 1 = 2, where is rime. =, clearly Using now this and Remark 1.2, then it becomes trivial to deduce that n + 1 divides n!, and this contradicts (4). Theorem 1.1 follows. Theorem 1.1 immediately imlies the characterizations of rimes and twin rimes. 2 Characterizations of rimes and twin rimes In this section, using Theorem 1.1, we characterize rime numbers and we also give two characterizations of twin rimes. Theorem 2.1. (Characterization of rimes). Let n be an integer 4 and look at n + 1. Then the following are equivalent. (1). n + 1 is rime. (2). n + 1 does not divide n!. To rove Theorem 2.1, we need a Theorem of Euclid. Theorem 2.2 (Euclid). Let a, b and c, be integers such that a 1, b 1 and c 1. If a divides bc and if the greatest common divisor of a and b is 1, then a divides c. Corollary 2.3. Let n be an integer 1 and look at n!. Now let be a rime n + 1; then the greatest common divisor of n! and is 1 (in articular,

215 does not divide n!). Proof. Immediate, and follows immediately by using Theorem 2.2 and the definition of n!, and by observing that is a rime n + 1. Now, we rove Theorem 2.1. Proof of Theorem 2.1. (1) (2)]. Immediate, by remarking that n + 1 is rime and by using Corollary 2.3. (2) (1)]. Immediate, by remarking that n + 1 does not divide n! and by using Theorem 1.1. Using Theorem 2.1, then the following corollary becomes immediate. Corollary 2.4.Let n be an integer 4 and look at n + 3. Then the following are equivalent. (i). n + 3 is rime. (ii). n + 3 does not divide (n + 2)!. Proof. Immediate, and follows from Theorem 2.1, where we relace n by n + 2. Using Theorem 2.1 and Corollary 2.4, then we have the following weak characterization of twin rimes. Theorem 2.5. (A weak characterization of twin rimes). Let n be an integer 4 and look at the coule (n + 1, n + 3). Then the following are equivalent (a). (n + 1, n + 3) is a coule of twin rimes. (b). n + 1 does not divide n! and n + 3 does not divide (n + 2)!. Proof. (a) (b)]. Immediate. Indeed, if (n + 1, n + 3) is a coule of twin rimes, then, n + 1 does not divide n! (by using Theorem 2.1) and n + 3 does not divide (n + 2)! (by using Corollary 2.4). (b) (a)]. Immediate. Indeed, if n + 1 does not divide n! and if n + 3 does not divide (n + 2)!, then n + 1 is rime (by using Theorem 2.1) and n + 3 is also rime (by using Corollary 2.4); consequently (n + 1, n + 3) is a coule of twin rimes. Theorem 2.6. (A non-weak characterization of twin rimes). Let n be an integer 4 and look at the coule (n + 1, n + 3). Then the following are equivalent (c). (n + 1, n + 3) is a coule of twin rimes. (d). n + 1 does not divide n! and n + 3 does not divide n!. To rove simly Theorem 2.6, we need the following two lemmas. Lemma 2.7. Let n be an integer 4. If n + 1 is rime and if n + 3 does not

216 divide n!, then n + 3 is rime. Proof. Otherwise [we reason by reduction to absurd], clearly n + 1 is rime and n + 3 does not divide n! and n + 3 is not rime, (5) and we observe the following. Observation 2.7.1. Let be a rime such that n + 3 is divisible by ( such a clearly exists). Then n + 3 and n + 2 and n + 1 and n. Indeed, it is immediate that n + 3 [since n + 3 is not rime (use (5), and since is rime]. It is also immediate that n + 2 and n + 1 [[otherwise = n + 2 or = n + 1. From this and recalling that divides n + 3, it becomes trivial to deduce that n + 2 divides n + 3 or n + 1 divides n + 3. We have a contradiction [since n 4 (use the hyotheses), therefore n + 2 does not divide n + 3 and n + 1 does not divide n+3]. So n+2 and n+1]]. That being so, to rove Observation 2.7.1, it suffices to rove that n. Fact: n [indeed, recalling that divides n + 3, and since we have roved that n + 3 and n + 2 and n + 1, then it becomes trivial to deduce that n]. Observation 2.7.1 follows. Observation 2.7.2. Let be a rime such that n + 3 is divisible by ( such a clearly exists). Then n+3 is an integer and n+3 n and n+3 Indeed, it is immediate that n+3 =. is an integer [since divides n + 3], and it is also immediate that n+3 n [otherwise, n+3 > n; now, remarking that 2 (since is rime), then the revious two inequalities imly that n + 3 > 2n; so 3 > n and we have a contradiction, since n 4, by the hyotheses]. That being so, to rove Observation 2.7.2, it suffices to rove that n+3 n+3 = [otherwise, clearly n+3 that n+3 is an integer and n+3 =. Fact: ; now, remarking (by using the revious) n, and observing (by using Observation 2.7.1) that n; then it becomes trivial to deduce that n+3 different integers such that {, n+3 inclusion immediately imlies that n+3 and are two } {1, 2, 3,..., n 1, n}. The revious divides 1 2 3... n 1 n; = ]. Observation therefore n + 3 divides n!, and this contradicts (5). So n+3 2.7.2 follows. Observation 2.7.3. Let be a rime such that n + 3 is divisible by ( such a clearly exists). Then 2. Otherwise, = 2; now, observing ( by using

217 Observation 2.7.2) that n+3 =, then the revious two equalities immediately imly that n+3 = 2; clearly n + 3 = 4 and so n = 1. We have a contradiction, 2 since n 4, by the hyotheses. Observation 2.7.3 follows. Observation 2.7.4. Let be a rime such that n + 3 is divisible by ( such a clearly exists). Then 3. Otherwise, = 3; now, observing ( by using Observation 2.7.2) that n+3 =, then the revious two equalities immediately imly that n+3 = 3; clearly n + 3 = 9 and so n = 6. Clearly n + 3 divides n!, 3 and this contradicts (5) (note that n + 3 divides n!, since n + 3 = 9, n = 6 and 9 divides 6!). Observation 2.7.4 follows. Observation 2.7.5. Let be a rime such that n + 3 is divisible by ( such a clearly exists). Then 5 and 2(n+3) is an integer and 2(n+3) n and 2(n+3). Clearly 5 [indeed, observe that 2 (by Observation 2.7.3) and 3 (by Observation 2.7.4); now using the revious and the fact that is rime, then it becomes trivial to deduce that 5]. Indeed, it is immediate that 2(n+3) is an integer [since divides n + 3], and it is also immediate that 2(n+3) n [otherwise, 2(n + 3) > n; now, remarking ( by using the revious) that 5, then the revious two inequalities imly that 2(n + 3) > 5n; so 6 > 3n and therefore 2 > n. We have a contradiction, since n 4, by the hyotheses]. That being so, to rove Observation 2.7.5, it suffices to rove that 2(n+3). Fact: 2(n+3) Observation 2.7.2) that n+3 imly that 2(n+3) [otherwise, clearly 2(n+3) = n+3 = ; now, remarking (by using =, then the revious two equalities immediacy ; so 2(n + 3) = n + 3 and this last equality is clearly imossible. So 2(n+3) ]. Observation 2.7.5 follows. The revious trivial observations made, look at n + 3; observing (by using Observation 2.7.5) that 2(n+3) is an integer and 2(n+3) n and 2(n+3), and remarking (by using Observation 2.7.1) that n, then it becomes trivial to deduce that 2(n+3) and are two different integers such that {, 2(n+3) } {1, 2, 3,..., n 1, n}. The revious inclusion immediately imlies that 2(n+3) divides 1 2 3... n 1 n; therefore 2(n + 3) divides n!; clearly n + 3 divides n! and this contradicts (5). Lemma 2.7 follows. Lemma 2.8. Let n be an integer 4. If n + 1 is rime and if n + 3 does not divide n!, then (n + 1, n + 3) is a coule of twin rimes. Proof.Indeed, since n + 1 is rime and n + 3 does not divide n!, then Lemma 2.7 imlies that n + 3 is rime; therefore (n + 1, n + 3) is a coule of twin

218 rimes. The revious simle two lemmas made, we now rove Theorem 2.6. Proof of Theorem 2.6. (c) (d)]. Immediate. Indeed, since (n + 1, n + 3) is a coule of twin rimes, clearly n + 1 does not divide n! (by observing that n + 1 is rime and by using Theorem 2.1) and clearly n + 3 does not divide n! [ otherwise n + 3 divides n! and we trivially deduce that n + 3 divides (n + 2)!. Using this and Corollary 2.4, then it becomes immediate to deduce that n + 3 is not rime. A contradiction, since (n + 1, n + 3) is a coule of twin rimes, and in articular n + 3 is rime]. (d) (c)]. Immediate. Indeed, if n + 1 does not divide n! and if n + 3 does not divide n!, clearly n + 1 is rime (by observing that n + 1 does not divide n! and by using Theorem 2.1) and clearly (n + 1, n + 3) is a coule of twin rimes [ by remarking that n + 1 is rime (use the revious) and by observing that n + 3 does not divide n! and by using Lemma 2, 8]. 3 Statement of the general conjecture from which stated results follow Indeed, using Theorem 1.1, then it becomes a little natural to us to conjecture the following: Conjecture 3.1. For every integer j 0 and for every integer n 4 + j; then, n + 1 + j is rime or n + 1 + j divides n!. It is immediate that the revious conjecture imlies Theorem 1.1, and therefore, all the results roved in section 1 and section 2, are only an immediate consequence of Conjecture 3.1. Moreover, if Conjecture 3.1 is true, then, utting j = n 4 (n can be very large), it immediately follows that 2n 3 is rime or 2n 3 divides n!.. ACKNOWLEDGEMENTS. Dr. Rizzo K.J. for heling me in Latex editing.

219 References [1] Ikorong Anouk Gilbert Nemron, An alternative reformulation of the Goldbach conjecture and the twin rimes conjecture, Mathematicae Notae, XLIII, (2005), 101-107. [2] Ikorong Anouk Gilbert Nemron, Around The Twin Primes Conjecture And The Goldbach Conjecture I. Tomul LIII, Analele Stiintifice Ale Universitatii Sectiunea Matematica, (2007), 23-34. [3] Ikorong Anouk Gilbert Nemron, An original abstract over the twin rimes, the Goldbach Conjecture, the Friendly numbers, the erfect numbers, the Mersenne comosite numbers, and the Sohie Germain rimes, Journal of Discrete Mathematical Sciences And Crytograhy, 11(6), (2008), 715-726. [4] Ikorong Anouk Gilbert Nemron, Playing with the twin rimes conjecture and the Goldbach conjecture, Alabama Journal of Maths, (2008), 47-54. [5] Ikorong Anouk Gilbert Nemron, Runing With The Twin Primes, The Goldbach Conjecture, The Fermat Primes Numbers, The Fermat Comosite Numbers, And The Mersenne Primes, Far East Journal Of Mathematical Sciences, 40(2), (2010), 253-266. [6] Ikorong Anouk Gilbert Nemron, Seech around the twin rimes conjecture, the Mersenne rimes conjecture, and the Sohie Germain rimes conjecture, Journal Of Informatics And Mathematical Sciences, 3(1), (2011), 31-40. [7] Paul Hoffman, Erdös, l homme qui n aimait que les nombres, Editions Belin, 2008. [8] Paul Hoffman, The man who loved only numbers. The story of Paul Erdös and the search for mathematical truth, 2008.