# Venezuelan Mathematician ensures that found the solution of a

mathematical problem that is awarded one million dollars.

The Venezuelan mathematician Rodolfo Nieves, claims to have found a generating
formula to all terms of the Beal´s diophantine equation and this formula leads to a
definitive answer to a problem that was introduced in 1997 by Texas banker Andrew
Beal. The solution to this mathematical problem is rewarded with a million dollars for
the American Society of Mathematics; This problem is known in the scientific world as
Beal's conjecture in honor of the banker Andrew Beal.
It is important to say that this mathematician will be presenting the solution of this
conjecture at Ezequiel Zamora Experimental Agricultural University. (Unellez) in the
capital of Cojedes state. Nieves stated that this solution, requires large computers to be
checked due to the complexity of it, however; this mathematician not hesitate to let us
know part of the proof and said that any mathematician can confirm with a small pocket
calculator, since it has a recurring regularity.
The solution presented by Nieves, is based on the absence of counterexample or
contradiction. Therefore, Beal's conjecture is true, said Nieves.
Beal's conjecture states that:
“If: Ax + By = Cz;
Where: A, B, C, x, y and z are positive integers:
And in addition: x, y and z are all greater than: 2;
Then: A, B and C must have a common prime factor”
Nieves solution:
When: x = 3; y = 3 and z = 10 are all greater than: 2
In addition: A; B and C contain a prime factor in common.
Due to the fundamental theorem of arithmetic. The formula is true for each and
every one of the odd numbers as in this sequence are also each and every one of the
odd prime numbers. Then also holds for each and every one of the odd primes.

Ax
[1.(93)]3
[2.(353)]3
[3.(913)]3
[4.(1893)]3
[5.(3413)]3
[6.(5593)]3
[7.(8553)]3
[8.(12413)]3
[9.(17293)]3
[10.(23313)]3
.
.
.
A3

+
By
+
[2.(93)]3
+
[3.(353)]3
+
[4.(913)]3
+ [5.(1893)]3
+ [6.(3413)]3
+ [7.(5593)]3
+ [8.(8553)]3
+ [9.(12413)]3
+ [10.(17293)]3
+ [11.(23313)]3
+
.
+
.
+
.
+
B3

=
Cz
=
910
= 3510
= 9110
= 18910
= 34110
= 55910
= 85510
= 124110
= 172910
= 233110
=
.
=
.
=
.
=
C10

Common factor
3
5
7
9
11
13
15
17
19
21
.
.
.
Odd Primes

Nieves formula :

For all: n>0
When: r= Odd
Ax
[n.(n + (n+1)r)]r
r

+
By
=
Cz
r
r r
r
+ [(n+1).(n + (n+1) )] = [(n + (n+1)r](r.r)+1

Common Factor
n + (n+1)

+
By
=
Cz
+ [(n+1).(nr + (n+1)r)]r = [(nr + (n+1)r](r.r)+1

Common Factor
nr + (n+1)r

For all: n>0
When: r= Even

Ax
[n.(nr + (n+1)r)]r

Beal's conjecture states that:
“If: Ax + By = Cz;
Where: A, B, C, x, y and z are positive integers:
And in addition: x, y and z are all greater than: 2;
Then: A, B and C must have a common prime factor”
¡Indeed it is true!
Since:
For all prime factor: P greater than two.
There always be: At least one solution.
When: Ax + By = Cz is the Beal's conjecture diophantine equation.
Where: x = P greater than two.
y = P greater than two.
z = P2 + 1 greater than two.
When: P = n + (n + 1) is an odd prime number greater than two. (All of them)
If and only if:

A = [(n+1).[(nP + (n+1)P]P]
B = [(n).[(nP + (n+1)P]P]
C = (nP + (n+1)P
Therefore: It is proven that Beal's conjecture is true.
Since:
P: divides: A
P: divides: B
P: divides: C

Rodolfo A. Nieves Rivas
I did it

Sign up to vote on this title