 |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|
ABC conjecture
A remarkable conjecture, first put forward in 1980 by Joseph Oesterle of the University of Paris and David Masser of the Mathematics Institute of the University of Basel in Switzerland, which is now considered one of the most important unsolved problems in number theory. If it were proved correct, the proofs of many other famous conjectures and theorems would follow immediately – in some cases in just a few lines. The vastly complex current proof of Fermat's last theorem, for example, would reduce to less than a page of mathematical reasoning. The ABC conjecture is disarmingly simple compared to most of the deep questions in number theory and, moreover, turns out to be equivalent to all the main problems that involve Diophantine equations (equations with integer coefficients and integer solutions).
Only a couple of concepts need to be understood to grasp the ABC conjecture. A square-free number is an integer that isn't divisible by the square of any number. For example, 15 and 17 are square-free, but 16 (divisible by 42) and 18 (divisible by 32) are not. The square-free part of an integer n, denoted sqp(n), is the largest square-free number that can be formed by multiplying the prime factors of n. Thus, for n = 15, the prime factors are 5 and 3, and 3 × 5 = 15, a square-free number. So sqp(15) = 15. On the other hand, for n = 16, the prime factors are all 2, which means that sqp(16) = 2. Similarly, sqp(17) = 17 and sqp(18) = 6. In general, if n is square-free, the square-free part of n is just n; otherwise, sqp(n) represents what is left over after all the factors that create a square have been eliminated. In other words, sqp(n) is the product of the distinct prime numbers that divide n. For example, sqp(9) = sqp(3 × 3) = 3 and sqp(1400) = sqp(2 × 2 × 2 × 5 × 5 × 7) = 2 × 5 × 7 = 70.
The ABC conjecture deals with pairs of numbers that have no common factors. Suppose A and B are two such numbers and that C is their sum. For example, if A = 3 and B = 7, then C = 3 + 7 = 10. Now, consider the square-free part of the product A × B × C: sqp(ABC) = sqp(3 × 7 × 10) = 210. For most choices of A and B, sqp(ABC) is greater than C, as in the example above. In other words, sqp(ABC)/C > 1. Occasionally, however, this isn't true. For instance, if A =1 and B = 8, then C = 1 + 8 = 9, sqp(ABC) = sqp(1 × 8 × 9) = sqp(1 × 2 × 2 × 2 × 3 × 3) = 1 × 2 × 3 = 6, and sqp(ABC)/C = 6/9 = 2/3. Similarly, if A = 3 and B = 125, the ratio is 15/64, and if A = 1 and B = 512, the ratio is 2/9.
David Masser proved that the ratio sqp(ABC)/C can get arbitrarily small. In other words, given any number greater than zero, no matter how small, it's possible to find integers A and B for which sqp(ABC)/C is smaller than this number. In contrast, the ABC conjecture states that [sqp(ABC)]n/C does reach a minimum value if n is any number greater than 1 – even a number such as 1.0000000000001, which is just barely larger than 1. The tiny change in the expression makes a vast difference in its mathematical behavior. The ABC conjecture in effect translates an infinite number of Diophantine equations (including the equation of Fermat's last theorem) into a single mathematical statement.
Reference
- Guy, Richard K. Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, 1994.
Related category
• NUMBER THEORY
Also on this site:
Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History
Transport Concepts & Designs (partner site)