﻿ abc conjecture : définition de abc conjecture et synonymes de abc conjecture (anglais)

Publicité ▼

## définition - abc conjecture

voir la définition de Wikipedia

Wikipedia

# abc conjecture

The abc conjecture (also known as Oesterlé–Masser conjecture) is a conjecture in number theory, first proposed by Joseph Oesterlé and David Masser in 1985. The conjecture is stated in terms of three positive integers, a, b and c (whence comes the name), which have no common factor and satisfy a + b = c. If d denotes the product of the distinct prime factors of abc, the conjecture essentially states that d is rarely much smaller than c.

Although there is no obvious strategy for resolving the problem, it has already become well known for the number of interesting consequences it entails. Many famous conjectures and theorems in number theory would follow immediately from the abc conjecture. Goldfeld (1996) described the abc conjecture as "the most important unsolved problem in Diophantine analysis".

 Are there for every ε > 0, only finitely many triples of coprime positive integers a + b = c such that c > d (1+ε) where d denotes the product of the distinct prime factors of abc?

## Formulations

For a positive integer n, the radical of n, denoted rad(n), is the product of the distinct prime factors of n. For example

If a, b, and c are coprime[1] positive integers such that a + b = c, it turns out that "usually" c < rad(abc). The abc conjecture deals with the exceptions. Specifically, it states that for every ε>0 there exist only finitely many triples (a,b,c) of positive coprime integers with a + b = c such that

$c>\operatorname{rad}(abc)^{1+\varepsilon}.$

An equivalent formulation states that for any ε > 0, there exists a constant K such that, for all triples of coprime positive integers (a, b, c) satisfying a + b = c, the inequality

$c < K \cdot \operatorname{rad}(abc)^{1+\varepsilon}$

holds.

A third formulation of the conjecture involves the quality q(a, b, c) of the triple (a, b, c), defined by:

$q(a, b, c) = \frac{ \log(c) }{ \log( \operatorname{rad}( abc ) ) }.$

For example

• q(4, 127, 131) = log(131) / log(rad(4·127·131)) = log(131) / log(2·127·131) = 0.46820...
• q(3, 125, 128) = log(128) / log(rad(3·125·128)) = log(128) / log(30) = 1.426565...

A typical triple (a, b, c) of coprime positive integers with a + b = c will have c < rad(abc), i.e. q(a, b, c) < 1. Triples with q > 1 such as in the second example are rather special, they consist of numbers divisible by high powers of small prime numbers.

The abc conjecture states that, for any ε > 0, there exist only finitely many triples (a, b, c) of coprime positive integers with a + b = c such that q(a, b, c) > 1 + ε.

Whereas it is known that there are infinitely many triples (a, b, c) of coprime positive integers with a + b = c such that q(a, b, c) > 1, the conjecture predicts that only finitely many of those have q > 1.01 or q > 1.001 or even q > 1.0001, etc.

## Examples of triples with small radical

The condition that ε > 0 is necessary for the truth of the conjecture, as there exist infinitely many triples a, b, c with rad(abc) < c. For instance, such a triple may be taken as

a = 1
b = 26n − 1
c = 26n.

As a and c together contribute only a factor of two to the radical, while b is divisible by 9, rad(abc) < 2c/3 for these examples. By replacing the exponent 6n by other exponents forcing b to have larger square factors, the ratio between the radical and c may be made arbitrarily large. Another triple with a particularly small radical was found by Eric Reyssat (Lando & Zvonkin 2004, p. 137):

a = 2:
b = 310 109 = 6436341
c = 235 = 6436343

## Some consequences

The conjecture has not been proven, but it has a large number of interesting consequences. These include both known results, and conjectures for which it gives a conditional proof.

While the first group of these have now been proven, the abc conjecture itself remains of interest, because of its numerous links with deep questions in number theory.

## Theoretical results

It remains unknown whether c can be upper bounded by a near-linear function of the radical of abc, as the abc conjecture states, or even whether it can be bounded by a polynomial of rad(abc). However, exponential bounds are known. Specifically, the following bounds have been proven:

$c < \exp{(K_1 \operatorname{rad}(abc)^{15}) }$ (Stewart & Tijdeman 1986),
$c < \exp{ (K_2 \operatorname{rad}(abc)^{2/3+\varepsilon}) }$ (Stewart & Yu 1991), and
$c < \exp{ (K_3 \operatorname{rad}(abc)^{1/3+\varepsilon}) }$ (Stewart & Yu 2001).

In these bounds, K1 is a constant that does not depend on a, b, or c, and K2 and K3 are constants that depend on ε (in an effectively computable way) but not on a, b, or c. The bounds apply to any triple for which c > 2.

## Computational results

In 2006, the Mathematics Department of Leiden University in the Netherlands, together with the Dutch Kennislink science institute, launched the ABC@Home project, a grid computing system which aims to discover additional triples a, b, c with rad(abc) < c. Although no finite set of examples or counterexamples can resolve the abc conjecture, it is hoped that patterns in the triples discovered by this project will lead to insights about the conjecture and about number theory more generally.

Distribution of triples with q > 1[3]
q > 1 q > 1.05 q > 1.1 q > 1.2 q > 1.3 q > 1.4
c < 102 6 4 4 2 0 0
c < 103 31 17 14 8 3 1
c < 104 120 74 50 22 8 3
c < 105 418 240 152 51 13 6
c < 106 1.268 667 379 102 29 11
c < 107 3.499 1.669 856 210 60 17
c < 108 8.987 3.869 1.801 384 98 25
c < 109 22.316 8.742 3.693 706 144 34
c < 1010 51.677 18.233 7.035 1.159 218 51
c < 1011 116.978 37.612 13.266 1.947 327 64
c < 1012 252.856 73.714 23.773 3.028 455 74
c < 1013 528.275 139.762 41.438 4.519 599 84
c < 1014 1.075.319 258.168 70.047 6.665 769 98
c < 1015 2.131.671 463.446 115.041 9.497 998 112
c < 1016 4.119.410 812.499 184.727 13.118 1.232 126
c < 1017 7.801.334 1.396.909 290.965 17.890 1.530 143
c < 1018 14.482.059 2.352.105 449.194 24.013 1.843 160

As of June 2012, ABC@Home has found 23.1 million triples, and its present goal is to obtain a complete list of all ABC triples (a,b,c) with c no more than 1020.[4]

Highest quality triples[5]
q a b c Discovered by
1 1.6299 2 310​109 235 Eric Reyssat
2 1.6260 112 32​56​73 221​23 Benne de Weger
3 1.6235 19·1307 7·​292​318 28​322​54 Jerzy Browkin, Juliusz Brzezinski
4 1.5444 72​412​3113 1116​132​79 2·​33​523​953 Abderrahmane Nitaj
5 1.4805 522​79·​45949 32​1318​613 223​174​2512​17333 Frank Rubin

where the quality q(a, b, c) of the triple (a, b, c), defined by:

$q(a, b, c) = \frac{ \log(c) }{ \log( \operatorname{rad}( abc ) ) }.$

## Refined forms and generalizations

A stronger inequality proposed in 1996 by Alan Baker states that in the inequality, one can replace rad(abc) by

where ω is the total number of distinct primes dividing a, b and c (Bombieri & Gubler 2006, p. 404). A related conjecture of Andrew Granville states that on the RHS we could also put

where Θ(n) is the number of integers up to n divisible only by primes dividing n.

Browkin & Brzeziński (1994) formulated the n-conjecture—a version of the abc conjecture involving $n>2$ integers.

## Notes

1. ^ Note that when it is given that a + b = c, coprimeness of abc implies pairwise coprimeness of abc. So in this case, it does not matter which concept we use.
2. ^ http://www.math.uu.nl/people/beukers/ABCpresentation.pdf
3. ^ "Synthese resultaten", RekenMeeMetABC.nl, retrieved January 1, 2011  (Dutch).
4. ^ "Data collected sofar", ABC@Home, retrieved June 9, 2012
5. ^ "100 unbeaten triples". Reken mee met ABC. 2010-11-07.

## References

Publicité ▼

Contenu de sensagent

• définitions
• synonymes
• antonymes
• encyclopédie

• definition
• synonym

Publicité ▼

dictionnaire et traducteur pour sites web

Alexandria

Une fenêtre (pop-into) d'information (contenu principal de Sensagent) est invoquée un double-clic sur n'importe quel mot de votre page web. LA fenêtre fournit des explications et des traductions contextuelles, c'est-à-dire sans obliger votre visiteur à quitter votre page web !

Essayer ici, télécharger le code;

Solution commerce électronique

Augmenter le contenu de votre site

Ajouter de nouveaux contenus Add à votre site depuis Sensagent par XML.

Parcourir les produits et les annonces

Obtenir des informations en XML pour filtrer le meilleur contenu.

Indexer des images et définir des méta-données

Fixer la signification de chaque méta-donnée (multilingue).

Renseignements suite à un email de description de votre projet.

Jeux de lettres

Les jeux de lettre français sont :
○   Anagrammes
○   jokers, mots-croisés
○   Lettris
○   Boggle.

Lettris

Lettris est un jeu de lettres gravitationnelles proche de Tetris. Chaque lettre qui apparaît descend ; il faut placer les lettres de telle manière que des mots se forment (gauche, droit, haut et bas) et que de la place soit libérée.

boggle

Il s'agit en 3 minutes de trouver le plus grand nombre de mots possibles de trois lettres et plus dans une grille de 16 lettres. Il est aussi possible de jouer avec la grille de 25 cases. Les lettres doivent être adjacentes et les mots les plus longs sont les meilleurs. Participer au concours et enregistrer votre nom dans la liste de meilleurs joueurs ! Jouer

Dictionnaire de la langue française
Principales Références

La plupart des définitions du français sont proposées par SenseGates et comportent un approfondissement avec Littré et plusieurs auteurs techniques spécialisés.
Le dictionnaire des synonymes est surtout dérivé du dictionnaire intégral (TID).
L'encyclopédie française bénéficie de la licence Wikipedia (GNU).

Changer la langue cible pour obtenir des traductions.
Astuce: parcourir les champs sémantiques du dictionnaire analogique en plusieurs langues pour mieux apprendre avec sensagent.

3096 visiteurs en ligne

calculé en 0,078s

Je voudrais signaler :
section :
une faute d'orthographe ou de grammaire
un contenu abusif (raciste, pornographique, diffamatoire)
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 9, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}