On the characterization of two triples generating equations 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

Note: Second submission.