SOLVING THE CONGRUENT NUMBER PROBLEM IS SOLVING THE ELLIPTIC CURVE PROBLEM

Similar documents
Accepted in Fibonacci Quarterly (2007) Archived in SEQUENCE BALANCING AND COBALANCING NUMBERS

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Implicit function theorem

A New Sifting function J ( ) n+ 1. prime distribution. Chun-Xuan Jiang P. O. Box 3924, Beijing , P. R. China

Seed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers

The Structure of Z p when p is Prime

Chapter Vectors

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor

Math 140A Elementary Analysis Homework Questions 1

Lesson 10: Limits and Continuity

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra

Sequences of Definite Integrals, Factorials and Double Factorials

The Random Walk For Dummies

Some remarks for codes and lattices over imaginary quadratic

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

The "Last Riddle" of Pierre de Fermat, II

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

CLOSED FORM FORMULA FOR THE NUMBER OF RESTRICTED COMPOSITIONS

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

Diophantine Equation. Has Infinitely Many Prime Solutions

Bertrand s Postulate

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

On Convergence in n-inner Product Spaces

Complex Numbers Solutions

Ma 530 Introduction to Power Series

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

SEQUENCE AND SERIES NCERT

An Elementary and Simple Proof of Fermat s Last Theorem

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

Polynomial Functions and Their Graphs

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

On Edge Regular Fuzzy Line Graphs

The Riemann Zeta Function

MATH 304: MIDTERM EXAM SOLUTIONS

On Some Properties of Digital Roots

COMMON FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN COMPLEX VALUED b-metric SPACES

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

Math F215: Induction April 7, 2013

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv: v6 [math.ho] 13 Feb 2018

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Some Basic Diophantine Equations

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

A Simplified Binet Formula for k-generalized Fibonacci Numbers

Machine Learning for Data Science (CS 4786)

The log-behavior of n p(n) and n p(n)/n

A Characterization of Compact Operators by Orthogonality

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

ON POINTWISE BINOMIAL APPROXIMATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

Math 155 (Lecture 3)

Random Models. Tusheng Zhang. February 14, 2013

Exercises 1 Sets and functions

Math 609/597: Cryptography 1

PROPERTIES OF THE POSITIVE INTEGERS

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Commutativity in Permutation Groups

Expected Number of Level Crossings of Legendre Polynomials

Lecture 1. January 8, 2018

Pell and Lucas primes

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

Sequences I. Chapter Introduction

Infinite Sequences and Series

arxiv: v1 [math.nt] 28 Apr 2014

Solutions to Math 347 Practice Problems for the final

SEQUENCES AND SERIES

CHAPTER I: Vector Spaces

Math 4400/6400 Homework #7 solutions

Series: Infinite Sums

Section 5.5. Infinite Series: The Ratio Test

The 4-Nicol Numbers Having Five Different Prime Divisors

Sum of cubes: Old proofs suggest new q analogues

Objective Mathematics

Factors of sums and alternating sums involving binomial coefficients and powers of integers

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

Square-Congruence Modulo n

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Axioms of Measure Theory

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

Research Article Some E-J Generalized Hausdorff Matrices Not of Type M

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.

Math 299 Supplement: Real Analysis Nov 2013

A New Recursion for Space-Filling Geometric Fractals

Bijective Proofs of Gould s and Rothe s Identities

MA131 - Analysis 1. Workbook 2 Sequences I

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

U8L1: Sec Equations of Lines in R 2

ON THE DIOPHANTINE EQUATION

6.3 Testing Series With Positive Terms

On the distribution of coefficients of powers of positive polynomials

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

MAT1026 Calculus II Basic Convergence Tests for Series

Transcription:

Joural of Pure ad Applied Mathematics: Advaces ad Applicatios Volume 17, Number, 017, Pages 77-87 Available at http://scietificadvaces.co.i DOI: http://dx.doi.org/10.1864/jpamaa_71001178 SOLVING THE CONGRUENT NUMBER PROBLEM IS SOLVING THE ELLIPTIC CURVE PROBLEM Istitute Poltechic of Leo Leo Spai e-mail: eulogiogar@gmail.com Abstract I this paper, we preset solutio of the cogruets umbers problem ad it is applied for solved elliptical curve. 1. Itroductio The cogruet umber problem was proposed b Al-Karaji (95-109) woderig what umbers aother square, i.e., Z b subtractig them from a square give b, the Z is cogruet. We did ot a refer to the areas of the triagles. However, we also ow that () is a b a umber cogruet if it is the area of triagle ad therefore are all the triagles that have b area half of the rectagle (all the triagles rectagles). The best ow achievemets were i 198 b Tuell with 010 Mathematics Subject Classificatio: 11Mxx. Kewords ad phrases: cogruet umbers, equatio of Efer, Tuell theorem, elliptic curve. Received Februar 5, 017; Revised March 5, 017 017 Scietific Advaces Publishers

78 his theorem ad fiall those achieved b (Robert Bradshaw, W. B. Hart, D. Harve, G. Toraria ad M. Watis i 009) with the help of computers. I this wor it is verified the mistae that have give b the computers.. Mai Results The achievemet of m results is a direct cosequece of the followig equatio of Efer [4]: 4 + ( m + 1) a. m (1) Example. 4 + 5 9; 9 + 7 16; 16 + 9 5. Theorem 1. All umbers squared are defied b equatio 4 + ( m + 1). Proof 1. Subtractig each of the last sums of Equatio (1), we have () cogruet odd. 4 + m 4 + m ( m + 1) b, ( m + 1) [ + 1] ( b ), ( ) 4 + b ( m + 1), m ad so o, we observe that: ( + 1 ); is cogruet umber. 1

SOLVE THE CONGRUENT NUMBER PROBLEM, IS 79 Proof. We tae, the last two sums of Equatio (1). We subtract betwee if ad we have () that is a cogruet eve. 4 + m ( m + 1) [( + 1) + ( ( 1) ) + 1] c < b, [ + 1 + ( ( 1) ) + 1] 4 + ( m + 1), m agai: [ ( + 1) + ( ( 1) ) + 1] ; ( ) is a eve cogruet. The method to ow the cogruet umbers, pairs or odd as quicl ad accuratel; is with the two expressios of cogruet [6], [7] followig: for: ( ; ; 4; 5 ). Therefore: [ + 1 5 mod ]; [ 4( + 1) 0 mod ], (1) A odd umber with > 1 is a cogruet umber. () A eve umber i the form of ( + 1) is ot cogruet; as 4 + 4( + 1); let us recall that 4( + 1) ( + 1) + ( ( 1) + 1) b the Equatio (1). [ ] ; () ( m ) 4( + 1), where ( m eve), cogruet umber if ad ol if, is the area of a triagle whose sides are ( a, b, c) Z, i.e., the Pthagoras theorem a + b c.. Discussio This sectio is composed of two parts related to the cogruet umbers. (i) Theorem of Tuell.

80 (ii) Cogruet umbers i the elliptic curves ad i the modular forms; Taiama-Shimura cojecture toda called theorem. Theorem of Tuell. Give () a umber square free positive iteger will be a cogruet umber if fulfilled the followig: f ( ) ( x,, z) Z x + + 8z, g ( ) ( x,, z) Z x + + 8z, h ( ) ( x,, z) Z x + + z, ( ) ( x,, z) Z x + 4 + z, If ( odd) ad () is cogruet the f ( ) g( ) ad for ( eve) if () is cogruet the h( ) ( ). I the previous poit () it was show that ( ) with ( odd) are ot cogruet ad therefore f ( ) g( ). For ( eve), h( ) ( ) alwas that () is the area of a rectagle triagle of sides ( a, b, c) Z ad i tur that () also is cogruet (the differece betwee two squares (poit ). Therefore h ( ) 4( + 1) 0 mod, ( ) ( + 1). With Tuell s theorem few cogruet umbers are defied; i relatio with that the exist. (ii) Cogruet umbers allow us to ow if a existig elliptic curve, (if the have solutios for ( Z ) ad how ma). Let be elliptic curve E Z. x x. () This is the same as: x( x ).

SOLVE THE CONGRUENT NUMBER PROBLEM, IS 81 B Pthagoras ( x b ) if ( x,, b) are Pthagorea terms; () is a cogruet umber because we ow that ( 1 ), where ( 1 ) is also cogruet; example 5 5 + 1 5 mod ad hece the Equatio () is reduced to the form: xb, which implies ( x ). ( ) with ( m, b, ) Z, b example: ( 5 ); ( 0) ; ( b 15); implies ( 75) 75 5 0 5. Thus the curve exists ad is ot a elliptic curve modular, it is reducible ad violates the law of additio (a sum of two poits of a lie that cuts to the elliptic curve) gives a third poit of the curve of the same group ( P, Q, R) Q, however here we have P + Q R for beig R Z ). Therefore this curve ca ot be parametrized with a modular fuctio. Oe elliptic curve exist if ( Z ) ad has i its coefficiets (a cogruet umber) ad hece will have ol oe solutio for ( Z ) as a cosequece of beig () the differece betwee two squares, this maes impossible the existece of aother pair of squares alog (x). At this poit we shall aalze some of the elliptic curves alread demostrated b Efer [4]; the reaso for its aalsis is to see that a curve that exist ( Z ) has a uique solutio for ( Z ). We start with the elliptic curve that is the cetral axis of stud of all for the elliptic curves b the Riema-Roch theorem: The statemet is that b meas of a series of trasformatio a elliptical curve arrives at the expressio. x + bx + c. ()

8 This is the basis of the article b Richar Talor et al. [] to affirm the demostratio of the Taiama-Shimura cojecture. Ufortuatel, the Riema-Roch theorem caot be corrected sice of beig true the there could be o elliptic curve. I this wor, we demostrate the existece of several of them that the have (solutio iteger), the first Equatio (); the followig is the Equatio () that the step to the form of the followig: x( x + b) + c, beig ( b; c) cogruet umbers the equatio exists; because we ow that: x + b with (b) cogruet ad therefore x ( m1 ) for ( x ( ) ). m Leavig the Equatio () as: (( m ) )( m ) + c, where (c cogruet umber) ( Z ). solutio: x 4 ; b 9; ( c 44) ad also (c 169) 4 + 9 4 + 44 144 1, 4 + 9 4 + 69 169 1. There are ma elliptical curves of this class with a sigle solutio i each oe of them, (() is a cogruet umber, differece betwee two squares) does ot admits others squares. It is eough that oe of the three poits above is ot fulfilled for the curve to be a modular elliptic curve. Amog the elliptical curves that exist some have their expressio of Galois; provided that (x) is a power. Two examples of this are give b Equatios () ad (), respectivel. 5 x + 80x + 115 0, ( x 5) ; x + 9x + + 7 0, ( x ). 5

SOLVE THE CONGRUENT NUMBER PROBLEM, IS 8 Now, we aalze the elliptic curve E Q of such form that: If ( E Q ) ( E Z ). For it we have the followig: x j + m x + i. j Ad as first orm of a elliptic curve: the coefficiet of the cube will alwas be the uit, that is to sa factorizig we have: ( j ) x + xm + i ( j ) x( x + m) +. At this poit we appl the rules established to that exist ( EQ ) : x ; j ad m, where cogruet umber ad i tur ( i ) also is a cogruet umber, therefore we have j 8 ; 5; x 4 i ( 8 ) 8 + 4m +. We ow that 4m + i ; with 5 ; 4m 0 ad 19; i.e., ( 8 ) 8 +, i i 8 + 51 64 9, solutio for the Equatio () with E Q is x j + mj x + j i, 4 4 + 5 4 16 + 19 64.

84 Other curve E Q. x x c, 9 4 9 4 9 64. Proof 6. The last elliptic curve to be aalzed is: The equatio of Fre [5], is relevat for the demostratio of Fermat theorem b Adrw Willes [1]. We will show that the existece of the curve of Fre does ot deped o the Fermat theorem (either this true or false), the curve is alwas modular. m m m x + ( c b ) x ( bc). We ow that there are Pthagorea terms ifiite to appl i the equatio ad see that the result is: there is o curve for (a, b 4, ad c 5) ad also for ( a, b, c); with ( 1; ; ; 4 ). for m [( c b ) a ]. If we factorize the curve we have: x[ x + ( c b )] ( bc). If we replace ( c b ) b a we have x[ x + a ] ( bc) ; at the same time x + a ( ) therefore the curve is reduced as x( ) ( bc). This maes it eas for us to aalze all the Pthagorea terms, we observe that (bc) is a icrease o the terms (b), i.e.,: ( b ) ( cb) ad requires doig the same with (a) therefore, that ( x c); we ow that ( x ) with which ( a) ( bc) ad also that ( a < b < c) ad ( c ) therefore ( a) ever is a Pthagorea term; does ot exist

SOLVE THE CONGRUENT NUMBER PROBLEM, IS 85 ( Z ) for a value of (x) ad either it is possible for a other value curve for (m ), we will chec if it is also for ( m > ). of () is to fulfill ( a) ( bc). Is alwas a modular elliptic Let ( m + ) ad (m eve). + + xa We have for our aalsis the optios. or + m + ( bc). ( bc) ( ; ); cogruet, + Let s see if ( bc) ( ). ( a ) ( ; ); beig x. + For this we factorize ( bc) ( bc) ( bc) ( ) for ( m ; 4; + m 6 ); i.e., ( ( bc) ( )) + is a square, ad the same is true for ( a), this implies that (bc) ad (a) are Pthagorea terms ad, as it is alread demostrated, it is ot possible to have ( Z ). Let s see what ( m 1 ; ; 5; 7 ). We have ( bc) + 1 ( bc) ( ) ( ) + ( m + 1) + 1 + 1 + 1 bc bc bc we ow that ( ) ( ) ( ) ( ) ( ); ad therefore we eeds that (bc) also be a square, however ( bc) ( ) ; alwas that ( c b) is required b the curve. I abstract: if Fermat theorem is true for + m + m + m c b a + + + + + + curve would be modular ad, if [ ( 1) 1 ( 1) 1 ] ( 1) 1 b a c the curve would also be modular; is verified that the curve of Fre does ot exist ad therefore is a elliptic modular curve. That is, all semi-stable elliptic curves are elliptic modular curves it is ot show i the Fermat theorem. the

86 4. Coclusio (1) I the Birch ad Swiero-Der cojecture it is demostrated that because we ca ow if a elliptic curve exists or ot ( Z or Z ) ad if exists the it has ol oe solutio. () It is to solve the cogruet umbers problem ad with it is verified that with the Tuell theorem ot we have all cogruet umbers. The questio is iverted, at resolve the cogruet umber problem is verified the existece of elliptic curve. () Goro Shimura asserted that EVERY elliptic curve is a elliptic curve modular; is icorrect, exist elliptic curves ad therefore, the are ot oe elliptic curve modular. All elliptic curve that exist is reduced to the form [ ( x ) + B ] ad therefore it is ot possible the have a fuctio modular ( f ( z) + B). Acowledgemets I tha Efer Diez for the publicatio of his article, without it, it would ot have bee possible to preset this demostratio. Refereces [1] Adrew Willes, Modular elliptic curves ad Fermat lest theorem, Aals of Mathematic 141() (1995), 44-551. [] Bra J. Birch ad Nelso M. Stephes, The parit of the ra of the mordell-weil group, Topolog 5(4) (1966), 95-99. [] Christope Breu, B. Corad, F. Diamod ad R. Talor, O the modularit of elliptic curves Q wild -adic exercises, J. America Mathematic Societ 14 (001), 84-99. [4] Efer Diez, Equatio for solve elliptical curve, U. J. Computatioal Mathematic 1 (01). [5] G. Fre, Lis betwee stable elliptic curves ad certai diophatie equatios, Aales Uiversitatis Saraviesis: Series Mathematicae 1(1) (1986), 1-40.

SOLVE THE CONGRUENT NUMBER PROBLEM, IS 87 [6] Nelso M. Stephes, Cogruet properties of cogruet umber, Bull. Lodo Math. Soc. 7 (1975). [7] Keqi Fig, No-cogruet, odd graphs ad BDS cojecture, Acta Arith. 75(1) (1996). [8] Keqi Figs ad Ya Xue, New series of odd o-cogruet umbers, Sciece i Chia Series a Mathematics 49(11) (006). g