A New Approach to Theorem Proof, Results, and Their Discussion
There are many different approaches [3] to Fermat's last theorem (FLT). In this study, we will consider an interesting new approach.
Theorem (FLT): For an arbitrary integer n>2, there are not such integers a, b and c (a,b,c>0) satisfying the formula an + bn = cn [5].
In other words: the indeterminate equation xn + yn = zn has no integer solution for n≥3 [6].
Fermat's theorem can be expressed in a more general way, taking into account not only natural but also negative values of “n.”
Theorem 1: The equation does not have any solution for n (including negative values of n) in integers (i.e. a, b, c are integers) except n=2 and n=1.
This theorem will be formulated in more detail below as Theorem 3.
It is clear that for n=1 and n=2, there are infinitely many solutions satisfying the equation an+bn=cn [1]:
As we have already mentioned, positive integers
a, b, and
c satisfying the equality a
n + b
n = c
n form Pythagorean triples for n=2 [1]. This also means that the numbers that are solutions to the equation are the sides of a right triangle. That is, from them, one can build a triangle, and this triangle will be right-angled. Hence, these numbers satisfy the triangle inequalities:
Theorem 2. Arbitrary positive numbers a, b and c satisfying the equality an + bn = cn (for n>1) must satisfy the triangle inequalities, i.e., the inequalities a+b>c; a+c>b; b+c>a; c-b<a; c-a<b b-a<c should hold.
In other words, when n>1, the numbers a, b, and c satisfying the equation an + bn = cn must be the sides of any triangle. For 1<n<2, this triangle will be obtuse, with n=2, it will be right-angled, and for n>2, it will be acute-angled.
To prove it, let us consider three possible cases of expressions
a + b and
c for positive integers a, b, and c satisfying the equation a
n + b
n = c
n.
1. For a+b=c, raising both sides of the equation to the n-th power, we get:
On the left-hand side of the equation, we get the positive terms of the binomial expansion between the first and last terms. If we subtract the positive terms from the left-hand side of the binomial expansion, then we end up with an + bn < cn. This contradicts the equation an + bn = cn. That is, if an + bn = cn, then the first option, i.e., a+b=c is impossible.
2. If a+b<c, then it is clear that (a+b)n < cn and an +...+ bn < cn. Then, if we subtract from the left side of the inequality, the positive terms between the first and the last terms of the binomial expansion, the expression on the left side will get even smaller.
That is, an + bn << cn, which contradicts the case an + bn = cn. Therefore, the 2nd case is also impossible.
3. Thus, the 3rd case, i.e. a+b>c, is the only possible one.
3.1. For the case 0<n<1, the triangle inequality is not applied; on the contrary, the following inequalities are applied (
Figure 1):
Example: (25)1/2 + (49)1/2=(144)1/2 25+ 49 < 144 etc.
3.2. In the case of n=1, the only possible case is a+b=c. This is expressed by a point located at distances a and b, respectively, from the endpoints on segment c (
Figure 2);
se
3.3. With 1<n<2, a, b, and c will be the sides of an obtuse-angled triangle (
Figure 3);
3.4. With n=2, a, b, and c will be the sides of a right triangle.
3.5. With 2<n, a, b, and c will be the sides of an acute-angled triangle.
Let's consider several theorems and their proofs in the direction of proving Fermat's theorem:
Theorem 3: For arbitrary real numbers 0<a<b<c, there always exist real numbers n>1 and 0<m<1 such that the equations an + bn = cn and am = bm + cm are satisfied
Proof: if we divide both sides of the equation by cn, we get .
Here, the function y=
is monotonically decreasing (
Figure 4, graph 1), and the function y=1-
is monotonically increasing (
Figure 4, graph 2). Since the domain and image sets of the functions are (-∞,+∞), their graphs must intersect at one point. (See
Figure 4.)
For an arbitrary triangle ABC, the abscissa (x) of the intersection point of the graphs of functions y=1- and y= will satisfy the equation ax+bx=cx.
The part of “Theorem 3” related to the equation am = bm + cm is proved similarly.
Note that in the case of 0<a<b<c, it is impossible to get a real number “k” that satisfies the equation bk = ak + ck. This is because a is less than b, and c is greater than b. For any arbitrary value of k in the expression bk = ak + ck, one of the expressions ak and ck will be positive numbers greater than bk, and the other one less than bk.
Thus, Theorem 3 is proved.
This means that for any triangle, there are always numbers “n” and “m” such that they satisfy the condition an + bn = cn for the biggest side, and am = bm + cm for the smallest side of the triangle.
There is no corresponding number “k” that satisfies the condition bk = ak + ck for the middle side "b" of the triangle.
In our view, the truth of this theorem is one of the most important points complicating the proof of Fermat's theorem in a general form. While so far, attempts have been made to prove that a, b, and c cannot be simultaneous integers or that they cannot be coprime for natural values of n greater than 2 (n>2).
From "Theorem 3," one can see that the search for such contradictions about a, b, c in the equation an + bn = cn, assuming "n" to be a natural number, will not give any results. The presence of a rational or irrational "n" that satisfies the condition an + bn = cn for arbitrary a, b, c makes it impossible for there to be a contradiction in this direction.
Note that the correctness of "Theorem 3" requires a change in the direction of the search for the proof of LFT. In other words, Theorem 4 can be formulated as follows:
Theorem 4. There is no integer n greater than 2 (2<n) that satisfies the equation an+bn=cn for arbitrary integers a, b, c.
Theorem 4" fundamentally differs from "Theorem F" in the formulation of the problem. But the proof of "Theorem 4" will also be the proof of "Theorem F.”
Note. Finding a general formula for "n" that satisfies the condition an + bn = cn for an arbitrary triangle is a time-consuming technical task. Finding a general formula for "n" is related to the problem of finding the formula for the "logarithm of the sum" (log(f(x) + g(x)) =?). Finding the first will contribute to the solution of the second.
For equilateral triangles, the general formula for n satisfying the condition an + bn = cn can be obtained as follows:
See
Figure 5.
Since a=b in an equilateral triangle, we can write the equation an+bn=cn as: an+an=cn
Here we get the following:
If we take the logarithm of both sides of this expression to base 2, we get:
Based on the conducted studies, the following can be noted (see Figure 6.1 - 6.4)
6.1. if C – is an obtuse angle of an equilateral triangle case (Figure 6.1.)
With a=4; b=4; c=7 , according to formula n=1.23861262585 and an+bn=cn=11.1365097709
6.2. The case of approaching to a right triangle (Figure 6.2.)
With a=5.74456264656; b=4; c=7 , according to formula n=2.00000000002 and an+bn=cn=49.0000000015
6.3. As the triangle approaches to an equilateral one, n approaches to infinity (Figure 6.3).
With a=6.9; b=6.9; c=7 , according to formula n= 48.1728979257 and an+bn=cn=5.1383255777x1040
6.4. When angle C is acute, the value of n is negative (Figure 6.4).
With a=9; b=9; c=7, according to formula n= -2.75808748945 and an+bn=cn=0.00466815930687
The formula (B1) is true for arbitrary isosceles triangles, except for equilateral triangles. Since sin30o=1/2 in the expression (an+an=an) for an equilateral triangle, the denominator of the expression becomes "0" and we get an uncertainty of the form 1/0.
In the following analysis, we will show that the case of an equilateral triangle is also a limiting case for Elba curves (Elkhan Baylarov).
For isosceles triangles, we express the general formula of “n” with the ratio of the sides, with the formula without an angle. If
If we divide both sides by c
n, we get:
If we take logarithm of both sides to base 2, we get the following:
Let’s compare formulas (B1) and (B2):
(B1)
(B2)
1 For isosceles triangles, both formulas are equally satisfied (Figure 7.1. In the Figure the power of "n", calculated by the formula (B2), is marked with "m" so as not to create contradictions in the Desmos calculator.).
If a=8, b=8, c=13,
(B1)
(B2)
Here according to the formulas (B1) and (B2):
an+bn = 38.9357584353
cn = 38.9357584353
an+bn=cn
2 When a=b and the numbers a, b, c do not form a triangle, since there is no angle C, formula (B1) cannot be calculated – we get an uncertainty.
But in this case, formula (B2) can be calculated and an+bn = cn is satisfied.
(Figure 7.2. In the Figure power of "n", calculated by the formula (B2), is marked with "m" so as not to create contradictions in the Desmos calculator).
When a=5, b=5, c=13
(B1)
(B2)
For “n” calculated by the formula (B1), we get:
an+bn - uncertainty
cn - uncertainty
For “n” calculated by the formula (B2), we get:
an+bn = 6.42801477055
cn = 6.42801477055
an+bn = cn
3 It is strange that although the formula (B1) is written for equilateral triangles, it is also valid for all right triangles - Pythagorean numbers (for n=2).
Because with C=90o and from formula (B1) we get n=2.
However, formula (B2) is not applied for non-isosceles right triangles, (Figure 7.3. In Figure the degree of "n", calculated by the formula (B2), is marked with "m" so as not to create contradictions in the Desmos calculator).
If a=3, b=4, c=5 then
(B1)
(B2)
For n calculated from formula (B1) we get:
an+bn = 25
cn = 25
an+bn=cn
For “n” calculated by formula (B2), we get:
an+bn = 11.0009233374
cn = 8.88061816145
an+bn ≠ cn
As odd as it may sound, it is so, and it would be interesting to find out why.
In general, we can formulate "Theorem 5" for triads that can be sides of a triangle.
Theorem 5: For an arbitrary triangle with sides a, b, c, there exists a real number “n” such that an+bn=cn.
Since this proposition is a special case of Theorem 3, it can be proved in a similar way.
Note that the Pythagorean theorem is a special case of Theorem 5.