Abstract

In order to apply the role of the analogues between integers and polynomials, in this paper we introduce a unified diagram to the Fermat's theorem, Mason's theorem, Davenport's theorem and some arithmetic conjectures. Further, we show some applications of this diagram in teaching and researching on arithmetic. By using this elementary method in number theory, we obtained some results for polynomials and holomorphic functions in case complex and p-adic.

1. Introduction

It is a fact frequently remarked upon that integers and polynomials share a number of characteristics, we can list some of the following similarities between integers and polynomials.

1) For integers, we have prime numbers and for polynomials, we have irreducible polynomials.

2) For two integers, as for two polynomials, we can to define the greatest common divisor. Moreover, in both cases, the greatest common divisor is found by the Euclidean algorithm.

3) The absolute value of an integer is an analogue to the degree of a polynomial.

4) The rational numbers are analogues to the rational functions (the quotient of two polynomials).

5) There are two similar versions between theorems of remainder division on integers and on polynomials.

6) The number of distinct prime divisors of an integer is an analogue to the number of linear divisors of a polynomial on the field of complex numbers.

We can continue to extend the list of the analogs through some other concepts, properties and results of integers and polynomials.

On the role of the analogues between integers and polynomials in arithmetic studies, we can say that development of arithmetic, especially in recent decades, is greatly influenced by the analogues between integers and polynomials. In other words, when there is an open question for integers, we try to prove the same results for polynomials. That is often easier to do, perhaps because for the polynomial have a derivative, while a similar concept does not exist for integers.

By using the analogues between integers and polynomials, when studying the Fermat’s equation, Mason proved a very nice theorem for polynomials. From this theorem, we obtain an analogue of the Fermat's last theorem for polynomials on the field of complex number fields. Furthermore, Mason's theorem has suggested of the conjecture. It is very interesting that from the conjecture, there are many well-known arithmetic conjectures can be deduced. Thus, the conjecture became a central problem of arithmetic in the twenty-first century.

The analogues between integers and polynomials continue to be extended for polynomials of sevaral variables or holomorphic functions in complex case. By using this method, N. T. Quang, P. D. Tuan (see ^{1, 2, 3, 4, 5}) and C. Toropu (see ^{6, 7}) have also obtained some results on polynomials and p-adic entire functions of several variables.

In order to apply the important role of the analogues between integers and polynomials on the teaching and researching of arithmetic, this paper introduces a unified arithmetic diagram to Fermat's theorem, Mason’s theorem and Davenport’s theorem with some arithmetic conjectures.

2. Content

2.1.1. Definition. Recall that the radical of the nonzero integer is the product of the distinct prime number that divide that is,

2.1.2. Definition. Let be a polynomial of degree on the field of complex numbers. If are the distinct complex zeros of , then we can factor into a product of linear terms of the form

where the leading coefficient and The radical of the polynomial is defined by

The complex zero set of the complex polynomial is a finite set

Let denote the number of distinct zeros of that is The degree of the radical of is the number of distinct zeros of that is

This is an important Diophantine inequality for polynomials on the field of complex numbers.

2.1.3. Mason’s theorem (see ⁸) If are nonzero, relative prime polynomials, not all constant, and if then

where denotes the number of distinct zeros of the polynomial

The following arithmetic conjecture, by Marshall Hall in 1971, when he studied Diophantine equations , where is a given integer.

2.2.1. Hall’s conjecture. There is a positive constant C such that for any integers and for which

In 1965, Davenport ⁹ proved an analogue of the above conjecture in the case of polynomials. This is a direct consequence of Mason's theorem.

2.2.2. Davenport’s theorem ( ⁹). Let and be nonconstant, relatively prime polynomials. Then

Proof. We apply Mason’s theorem with Then

It follows that

Similarly, we have

From two inequalities, we obtain

Davenport's theorem is proved.

By using Mason's theorem, we find many other versions of Davenport's theorem.

2.2.3. Generalized Davenport’s theorem. Let be relatively prime non-constant polynomials and let be any positive integers. Then

Proof. We apply Mason’s theorem with Then

It follows that

(1)

Multiply the inequality (1) by (m – 1) we have

(2)

We have

(3)

From (2) and (3) we have

(4)

From (4) we obtain the generalized Davenport’s inequality:

The Fermat last theorem states that, for the Fermat’s equation has no solution in positive integers. The Fermat’s equation has solutions in complex polynomials for , for example:

We shall use Mason’s theorem to prove Fermat’s last theorem for complex polynomials.

2.2.4. Theorem (see [ ¹⁰, pp. 183]) If then Fermat’s equation has no solution in nonzero, relatively prime polynomials, not all constant.

Proof. Let , and suppose that are nonzero, relatively prime polynomials, not all constants, such that We apply Mason’s theorem with Then

Since we obtain

It follows that

This is impossible. The Fermat's last theorem for polynomials has been proved.

2.2.5. Theorem. The generalized Fermat’s equation has no solution in nonconstant, relatively prime polynomials if

where are positive integers.

Proof. Let and suppose that are nonconstant, relatively prime polynomials such that By using the Mason’s theorem with we have

Since we obtain

It follows that

This is impossible. The Fermat's generalized theorem for polynomials has been proved.

If in the ring of integers we have a theorem that says that the equation has no solution in positive integers, then in the complex polynomial ring we have the following result.

2.2.6. Theorem. The equation has no solution in nonzero, relatively prime polynomials, not all constant.

Proof. We suppose that are nonzero, relatively prime polynomials, not all constant, such that We apply Mason’s theorem with Then

It follows that

(5)

(6)

(7)

From (7) we have

(8)

From inequalities (5) and (6), we obtain

(9)

From (8) and (9), it follows that . We have a contradiction.

While the Catalan equation currently has not been solved for integers, but the corresponding polynomial equation was had the following answer by using the Mason's theorem.

2.2.7. Theorem ¹¹. The equation has no solution in non-constant polynomials and integers and

Proof. Let be relatively prime polynomials, not all constant, such that By using Mason’s theorem with we have:

From there we have

(10)

(11)

From inequalities (10) and (11), we obtain:

(12)

Since and the inequality (12) is impossible. We have a contradiction.

When studying a problem for integers, we often study its analogues on the function fields for polynomials and rational functions. The role of this analogues is not merely to convert objects from integers into polynomials or vice versa, but it also gives us a studying methodology in number theory. Numerical conversion thinking can be applied to studies of polynomials with tools such as derivatives, solutions, multiple solutions, degree, greatest common divisor, factor analysis. In contrast, from the results of polynomials we apply on integers by the similarly techniques.

From Mason's theorem by converting polynomial to integer, the abc conjecture was independently formulated by David Masser and Joseph Oesterle in 1986.

2.3.1. The abc Conjecture (see [ ¹⁰, pp. 185]) For every there exists a number such that, if and are nonzero, relative prime integers and then

The abc conjecture has a large number of consequences. To prove or disprove this conjecture is an important unsolved problem in number theory. Here are some examples.

The Fermat’s last theorem states that, for , the Fermat equation has no solution in positive integers. If conjecture were true, it would imply Fermat’s last theorem for sufficiently large powers. Goldfeld (1996) described the abc conjecture as "the most important unsolved problem in Diophantine analysis".

2.3.2. Asymptotic Fermat’s Theorem (see [ ¹⁰, pp. 185]) The abc conjecture implies that there exists an integer such that the Fermat’s equation has no solution in relatively prime integers for any exponent .

Proof. Let be relatively prime positive integers such that We note that

If then . Applying the abc conjecture with and we obtain

So

Thus, for any exponent the Fermat’s equation has no solution in relatively prime integers. This completes the proof.

The Catalan conjecture assert that the only solution of the equation in integers all greater than 1 is

Now, we consider the Catalan equation only for

2.3.3. Asymptotic Catalan theorem (see [ ¹⁰, pp. 186]) The conjecture implies that the Catalan equation has only finitely many solutions.

Proof. Let be a solution of the Catalan equation with Then and are relatively prime. It follow from the conjecture with that there exists a constant such that

We have

It follows that

(13)

So

Since and , we have

Thus, there are only finitely many pairs of exponents for which the Catalan equation is solvable. For fixed exponents and inequality (13) has only finitely many solutions in positive integers and This completes the proof.

3. Conclusion

Thus, from a basic problem of arithmetic is the problem of solving Diophantine equations, we have a unified arithmetic diagram (see diagram below). This diagram established a relationship between Fermat's last theorem, asymptotic Fermat's theorem, Mason's theorem, Davenport's theorem with the Hall conjecture and the conjecture.

Through the above analysis, we confirm that arithmetic has many different fields but they are united in a perfect whole. This unity is a way for much hope to conquer the heights of mathematics.

The beauty of mathematics is the unity. This makes arithmetic become closer. As a result, our learning and teaching on arithmetic are becoming more interesting and effective.

References