On the characterization of two canonical equations generating triples terms belonging to Beal's Conjecture. Rodolfo A. Nieves Rivas fesol7luzley@gmail.

com Abstract.

We present in this brief article two equations for the canonical representation of the terms corresponding to particular cases and obtaining the equation triples of the Beal's conjecture. Then, we establish its characterization and conclude with some examples that allow us to visualize the behavior and to lay the foundations that guarantee the ultimate resolution of this conjecture. Keywords: Canonical representation, characterization, Beal's triples.

Introduction Since we know the Pythagorean Theorem with its characteristic equation and the different methods for obtaining their primitive Pythagorean triples and then with the rise of the study of Diophantine equations and attempt generalization of the Pythagorean equation to exponents greater than two by Fermat and the results presented by Matiyasevich with regard to Hilbert's tenth problem. More recently with the solution presented by Andrew Wiles with modular elliptic curves applied to Fermat's theorem. Now another problem must be faced and this problem is known as the Beal's conjecture because it was Andrew Beal who formulated it. In this short paper we present the characterization and canonical representation of two equations of general application and partial resolution of this conjecture laying the foundations that guarantee progress towards the final decision.

First Characterization: Theorem: Beal-Nieves. If: A = B When: C = A. n3 Such that: n A 1 Then Beal's conjecture: Ax + By = Cz is true If and only If: x = And so: y = (n+1) Where: z= n And therefore: An+Bn+1 = Cn
n

A 1

Remarks: This theorem allows to proof that effectively (A; B; C) have a common factor equal to: A as establishes the Beal's conjecture which can be prime or composite and if it is composite then the common factor is a prime number belonging to the factorial decomposition of: A Examples: A = 31 n=5 C = 62 B = 31 Ax + By = Cz = 315 + 316 = 625 A = 26 n=3 C = 78 B = 26 Ax + By = Cz= 263 + 264 = 783

A = 127 n=7 C = 254 B = 127 Ax + By = Cz= 1277 + 1278 = 2547 A = 63 n=3 C = 252 B = 63 Ax + By =Cz= 633 + 634 = 2523 First canonical equation generating the Beal's triples: Let: (n - 1) n + (n - 1) n +1 = ((n - 1). A)n To all: a 2 And all n 2 Second characterization: Let: Ax + By = Cz be the equation of the Beal's conjecture. For: A = B or A B When: C = c If: an + bn = c And also: x = n y=n z = n+1 n3 Then: A = (a.c) When: B = (b.c) Such that: (a.c)n + (b.c)n = cn+1 Ax + By = Cz

Generalization Let: [a.( an + bn)]n + [b.( an + bn)]n = [an + bn] n+1 When: a 2 And besides: b 2 To all: n 2

Second canonical equation generating the Beal's triples:

Let: (a.c)n + (b.c)n = cn+1 Only when: an + bn = c For all: a1 For all: b1 And all: n2 Remarks: To all prime number of the form: 4.m+1 = a2 + b2 = c is proved that: a=1 and also: A = C = c and likewise: b2 = 4.m. This is guaranteed by the Fermat's proof to the conjecture of: Girard

Examples: a=3 b=5 n=3 C = c = 152 A = 456 B = 760 4563 + 7603 = 1524 Ax + By = Cz

a=2 b=3 n=3 C = c = 35 A = 70 B = 105 703 + 1053 = 354 Ax + By = Cz a=1 b=4 n=2 C = c = 17 A = 17 B = 68 172+ 682 = 173 Ax + By = Cz

a=3 b=3 n=4 C = c = 162 A = 486 B = 486 4864 + 4864 = 1625 Ax + By = Cz

Criterion and Nieves discriminant on Beal's Conjecture In order this to be true: Ax + By = Cz When: Ax + By = Cz is Beal's equation Only is necessary and sufficient that:

[A-x / C-z] - [A-x / B-y] =1 [Cz / Ax] - [By / Ax] =1 [Cz / By] - [Ax / By] =1 [Ax / Cz] + [By / Cz] =1
Examples:

[1-1 / 3-2] - [1-1 / 2-3] = 1 [32 / 11] - [23 / 11] = 1 [32 / 23] - [11 / 23] = 1 [11 / 32] + [23 / 32] = 1
Remarks: the prior example is related to Catalan's Conjecture presented by Eugene Charles Catalan in 1884 and proved by Preda Mihailescu in 2002.

[2-5 / 3-4] - [2-5 / 7-2]= 1 [34 / 25] - [72 / 25]= 1 [34 / 72] - [25 / 72]= 1 [25 / 34] + [72 / 34]= 1

Remarks: the above example allows to visualize one of the conditions when the three terms do not have a common factor then at least one of the exponents is equal to: 2 and besides the term: Cz = 34 can be traded by: CZ = 92

Verification of the corresponding values to Beal's triples on the following chart through Nieves's Discriminant

Transformations z of: C 82= 26=43=641

Cz

= AX

+ By

82 = 391 + 52

Transformations z of: B 52= 251

2;6;3;1 1 2;1

Discriminant or Nieves's Identity

[A-x / C-z] - [A-x / B-y]= 1 [Cz / Ax] - [By / Ax]= 1 [Cz / By] - [Ax / By]= 1 [Ax / Cz] + [By / Cz]= 1
Verification:

[39-1 / 8-2] - [39-1 / 5-2]= 1 [82 / 391] - [52 / 391]= 1 [82 / 52] - [391 / 52]= 1 [391 / 82] + [52 / 82]= 1
Transformation:

[39-1 / 4-3] - [39-1 / 5-2] = 1 [26 / 391] - [52 / 391] = 1 [43 / 251] - [391 / 52] = 1 [391 / 641] + [52 / 43] = 1

Main Theorem: All even numbers can be expressed by the difference of two squares

32-02 =

42-12 =

52-22 = 52-02 = 62-32 =

72-42 = 6 -1
2 2

= 82-52 =

12-02 22-12 32-22 42-32 52-42 62-52 72-62 82-72 92-82 102-92 112-102 122-112 132-122 142-132 152-142 162-152 172-162 182-172 192-182 202-192

= = = = = = = = = = = = = = = = = = = =

1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39

Theorem 1: All even numbers can be expressed by the difference of two consecutive squares

12-02 22-12 32-22 42-32 52-42 62-52 72-62 82-72 92-82 102-92 112-102 122-112 132-122 142-132 152-142 162-152 172-162 182-172 192-182 202-192

= = = = = = = = = = = = = = = = = = = =

1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39

Theorem 2: Two consecutive numbers are always co-primes Theorem 3:

If two any numbers do not divide the sum of both. Then both are co-primes to it Theorem 4:

All nth power whose base is an odd prime number or composite will always be an odd number

Corollary 1:If the bases of the three terms of Beal's equation are co-primes and also one of such bases is an odd number. Then at least one of the exponents is equal to two

Cz 12 22 32 42 52 62 72 82 92 102 112 122 132 142 152 162 172 182 192 202

= = = = = = = = = = = = = = = = = = = = =

Ax 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39

+ + + + + + + + + + + + + + + + + + + + +

By 02 12 22 32 42 52 62 72 82 92 102 112 122 132 142 152 162 172 182 192

32 = 9

52 = 25 33 = 27

CZ 300429072 210629382 1222 712 712 132

= Ax = 962223 = 762713 = 114 = 173 = 34 = 52

+ BY + 438 + 177 + 35 + 27 + 25 + 122

This corollary is proved by the main theorem and theorem 1 and it allows to prove one of the conditions of the Beal's conjecture.

Application of the above theorems:

Cz 42 252 1722 12012

= = = = =

Ax 71 72 73 74

+ + + + +

By 32 242 1712 12002

Proof:

Ax 71 72 73 74

= = = = =

Cz 42 252 1722 12012

By 32 242 1712 12002

Since: Ax is always odd if: A is odd to all: x Then by the main theorem Beal's conjecture is true by corollary: 1. And besides: Ax is always odd to all: x if and only if: A is an odd prime number and so: x is also odd, and the transformations are possible when: Ax is a power of a prime number or free square.

Cz 5 412 3652 32812

2

= = = = =

Ax 91 92 93 94

+ + + + +

By 4 402 3642 32802

2

Proof:

Ax 32=91 34=92 36=93 38=94

= = = = =

Cz 52 412 3652 32812

By 42 402 3642 32802

Transformation of terms:
CZ 12 22 32 42 32 = 62 72 42 = 92 102 52 = 122 132 62 = 152 162 72 = 182 192 82 = = = = = = = = = = = = = = = = = = = = = = Ax 11 31 51 71 32 111 131 151 171 191 211 231 52 33 291 311 331 351 371 391 + + + + + + + + + + + + + + + + + + + + + BY 02 12 22 32 02 52 62 12 82 92 22 112 122 32 142 152 42 172 182 52 z 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 x 1 1 1 1 2 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 y 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

Analysis of the possible transformations in general: Transformations of: CZ

CZ 12 22 32 42 32 = 62 72 42 = 24 92 = 34 = 811 42 = 92 102 52 = 122 132 62 = 162 = 44 = 28 72 = 182 192 82= 26=43=641 82 = 152 162 = = = = = = = = = = = = = = = = = = = = = Ax 11 31 51 71 32 111 131 151 171 191 211 231 52 33 291 311 331 351 371 391 + + + + + + + + + + + + + + + + + + + + + BY 02 12 22 32 02 52 62 12 82 92 22 112 122 32 142 152 42 172 182 52 z 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 x 1 1 1 1 2 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 y 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

42 = 24 = 161

Transformation with trivial examples:

CZ

CZ

CZ 12 22 32 42

= Ax = = = = = = 11 31 51 71 91 111 131 151 171 191 211 231 251 271 291 311 331 351 371 391

+ BY + + + + + + + + + + + + + + + + + + + + 02 12 22 32 02 52 62 12 82 92 22 112 02 32 142 152 42 12 182 52

32 = 62 72 42 = 92 = 102 = 52 = 5
2

= 62 =

122 = = 152 = 162 = 72 =

62 = 192 = 82 =

Cz 12 22 32 42 52 62 72 82 92 102 112 122 132 142 152 162 172

= = = = = = = = = = = = = = = = = =

Ax 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33

+ + + + + + + + + + + + + + + + + +

By 02 12 22 32 42 52 62 72 82 92 102 112 122 132 142 152 162

Results:

On the equation belonging to the Beal's conjecture necessarily at least one of the three terms is an odd prime number or a composite number. And since the sum is even necessarily the other two terms either are both odd or both even and if both are even the common factor is two and if both are odd or at least one is odd the sum is even or odd respectively and if it is odd then the Beal's conjecture is true by all the above.

Conclusion: And as the four criteria above are identities this allows the generalization of the results leading us toward the definite proof of the Beal's conjecture and to ensure that it is true.

References: [1] K. Raja Rama Gandhi; Reuven Tint. Proof of Beals conjeture; Bulletin of Mathematical Sciences & Applications.Vol. 2 ; N 3. United States 2013. pp. 61-64. [2] Nieves R. Rodolfo Demostracin de una conjetura presentada en el Quinto Congreso Internacional de Matemticas en 1.912. Memorias XIX Jornadas Tcnicas de Investigacin y III de Postgrado. Ed, Horizontes. Venezuela, 2011. pp. 123-128.