The product of the distinct primes in a number is called the
radical of that number. Notation: rad(). For example,
rad(22×34) = 2×3 = 6, rad(2×3×52) = 2×3×5 = 30.
I Three positive integers A,B, C are called ABC-triple if they
are coprime, A < B and
A + B = C
I Compute rad(ABC) and check whether rad(ABC) < C. If
this inequality is true we say that we have an ABC-hit!
I Among all 15 × 106 ABC-triples with C < 10000 we have 120
ABC-hits.
I Among all 380 × 106 ABC-triples with C < 50000 we have
276 hits.
Theorem: There are infinitely many ABC-hits.
ABC-Conjecture (Masser-Oesterl´e, 1985): Let > 1. Then,
with finitely many exceptions we have C < rad(ABC).

Attribution Non-Commercial (BY-NC)

293 vistas

The product of the distinct primes in a number is called the
radical of that number. Notation: rad(). For example,
rad(22×34) = 2×3 = 6, rad(2×3×52) = 2×3×5 = 30.
I Three positive integers A,B, C are called ABC-triple if they
are coprime, A < B and
A + B = C
I Compute rad(ABC) and check whether rad(ABC) < C. If
this inequality is true we say that we have an ABC-hit!
I Among all 15 × 106 ABC-triples with C < 10000 we have 120
ABC-hits.
I Among all 380 × 106 ABC-triples with C < 50000 we have
276 hits.
Theorem: There are infinitely many ABC-hits.
ABC-Conjecture (Masser-Oesterl´e, 1985): Let > 1. Then,
with finitely many exceptions we have C < rad(ABC).

Attribution Non-Commercial (BY-NC)

- Section17 Greatest Common Factors and Least Common Multiples
- Chapter04 Quadratic Equations
- Aitchison College Syllabus Guide
- Algebraic Fractions
- OMOFall13Solns
- MAT 221 Professional Tutor
- Complete_thesis.pdf
- 2015 Grade 4 MTAP Math Challenge Division Orals
- CV MANJUL
- Modular Arithmetic
- 10 Factorization
- ukmog-2011.pdf
- edexel math c2 qp
- MCQ Ch 1 FSC Part1 Nauman
- 1_Grade_5[1]
- 3_2.pdf
- 2year Sample Paper-6
- Group Challenge d
- lots-of-questions.pdf
- methods lesson final

Está en la página 1de 65

The ABC-conjecture

Frits Beukers

The ABC-conjecture

The riddle The conjecture Consequences Evidence

ABC-hits

I The product of the distinct primes in a number is called the

radical of that number. Notation: rad(). For example,

rad(22 ×34 ) = 2×3 = 6, rad(2×3×52 ) = 2×3×5 = 30.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

ABC-hits

I The product of the distinct primes in a number is called the

radical of that number. Notation: rad(). For example,

rad(22 ×34 ) = 2×3 = 6, rad(2×3×52 ) = 2×3×5 = 30.

I Three positive integers A, B, C are called ABC -triple if they

are coprime, A < B and

A+B =C

The ABC-conjecture

The riddle The conjecture Consequences Evidence

ABC-hits

I The product of the distinct primes in a number is called the

radical of that number. Notation: rad(). For example,

rad(22 ×34 ) = 2×3 = 6, rad(2×3×52 ) = 2×3×5 = 30.

I Three positive integers A, B, C are called ABC -triple if they

are coprime, A < B and

A+B =C

I Compute rad(ABC ) and check whether rad(ABC ) < C . If

this inequality is true we say that we have an ABC -hit!

The ABC-conjecture

The riddle The conjecture Consequences Evidence

ABC-hits

I The product of the distinct primes in a number is called the

radical of that number. Notation: rad(). For example,

rad(22 ×34 ) = 2×3 = 6, rad(2×3×52 ) = 2×3×5 = 30.

I Three positive integers A, B, C are called ABC -triple if they

are coprime, A < B and

A+B =C

I Compute rad(ABC ) and check whether rad(ABC ) < C . If

this inequality is true we say that we have an ABC -hit!

I Among all 15 × 106 ABC -triples with C < 10000 we have 120

ABC -hits.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

ABC-hits

I The product of the distinct primes in a number is called the

radical of that number. Notation: rad(). For example,

rad(22 ×34 ) = 2×3 = 6, rad(2×3×52 ) = 2×3×5 = 30.

I Three positive integers A, B, C are called ABC -triple if they

are coprime, A < B and

A+B =C

I Compute rad(ABC ) and check whether rad(ABC ) < C . If

this inequality is true we say that we have an ABC -hit!

I Among all 15 × 106 ABC -triples with C < 10000 we have 120

ABC -hits.

I Among all 380 × 106 ABC -triples with C < 50000 we have

276 hits.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

k

I Proof: Let us take A = 1 and C = 3, 32 , 34 , 38 , . . . , 32 , . . ..

k

We determine how many factors 2 occur in B = 32 − 1.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

k

I Proof: Let us take A = 1 and C = 3, 32 , 34 , 38 , . . . , 32 , . . ..

k

We determine how many factors 2 occur in B = 32 − 1.

I Notice

= (332 + 1)(316 + 1)(316 − 1)

···

= (332 + 1)(316 + 1)(38 + 1) · · · (3 + 1)(3 − 1)

So 364 − 1 is divisible by 2 · 28 .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

I Theorem: There are infinitely many ABC -hits.

k

I Proof: Let us take A = 1 and C = 3, 32 , 34 , 38 , . . . , 32 , . . ..

k

We determine how many factors 2 occur in B = 32 − 1.

k

I In general 32 − 1 is divisible by 2k+2 . So

k k

rad(B) = rad(32 − 1) ≤ (32 − 1)/2k < C /2k+1

We conclude

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

I Theorem: There are infinitely many ABC -hits.

k

I Proof: Let us take A = 1 and C = 3, 32 , 34 , 38 , . . . , 32 , . . ..

k

We determine how many factors 2 occur in B = 32 − 1.

k

I In general 32 − 1 is divisible by 2k+2 . So

k k

rad(B) = rad(32 − 1) ≤ (32 − 1)/2k < C /2k+1

We conclude

I In other words, C > rad(ABC ) · 2k+1 /3. So when k ≥ 1 we

have an ABC -hit.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

More hits

I Theorem: There are infinitely many ABC -hits.

k

I Proof: Let us take A = 1 and C = 3, 32 , 34 , 38 , . . . , 32 , . . ..

k

We determine how many factors 2 occur in B = 32 − 1.

k

I In general 32 − 1 is divisible by 2k+2 . So

k k

rad(B) = rad(32 − 1) ≤ (32 − 1)/2k < C /2k+1

We conclude

I In other words, C > rad(ABC ) · 2k+1 /3. So when k ≥ 1 we

have an ABC -hit.

I But we have shown more. For any number M > 1 there exist

infinitely many ABC -triples such that C > M · rad(ABC ).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Super hits

I Instead of something linear in rad(ABC ) let us take

something quadratic.

Question: Are there ABC -triples such that C > rad(ABC )2 ?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Super hits

I Instead of something linear in rad(ABC ) let us take

something quadratic.

Question: Are there ABC -triples such that C > rad(ABC )2 ?

I Answer: Unknown

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Super hits

I Instead of something linear in rad(ABC ) let us take

something quadratic.

Question: Are there ABC -triples such that C > rad(ABC )2 ?

I Answer: Unknown

I Working hypothesis: For every ABC -triple: C < rad(ABC )2 .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Super hits

I Instead of something linear in rad(ABC ) let us take

something quadratic.

Question: Are there ABC -triples such that C > rad(ABC )2 ?

I Answer: Unknown

I Working hypothesis: For every ABC -triple: C < rad(ABC )2 .

I Consequence: Let x, y , z, n be positive integers such that

gcd(x, y , z) = 1 and x n + y n = z n . Then the hypothesis

implies n < 6.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Super hits

I Instead of something linear in rad(ABC ) let us take

something quadratic.

Question: Are there ABC -triples such that C > rad(ABC )2 ?

I Answer: Unknown

I Working hypothesis: For every ABC -triple: C < rad(ABC )2 .

I Consequence: Let x, y , z, n be positive integers such that

gcd(x, y , z) = 1 and x n + y n = z n . Then the hypothesis

implies n < 6.

I Proof: Apply the hypothesis to the triple

A = x n , B = y n , C = z n . Notice that

rad(x n y n z n ) ≤ xyz < z 3 . So, z n < (z 3 )2 = z 6 . Hence n < 6.

Fermat’s Last Theorem for n ≥ 6 follows!

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Formulation

I Question: Are there ABC -triples such that C > rad(ABC )1.5 ?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Formulation

I Question: Are there ABC -triples such that C > rad(ABC )1.5 ?

I or C > rad(ABC )1.05 ?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Formulation

I Question: Are there ABC -triples such that C > rad(ABC )1.5 ?

I or C > rad(ABC )1.05 ?

I or C > rad(ABC )1.005 ?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Formulation

I Question: Are there ABC -triples such that C > rad(ABC )1.5 ?

I or C > rad(ABC )1.05 ?

I or C > rad(ABC )1.005 ?

I We expect at most finitely many instances.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Formulation

I Question: Are there ABC -triples such that C > rad(ABC )1.5 ?

I or C > rad(ABC )1.05 ?

I or C > rad(ABC )1.005 ?

I We expect at most finitely many instances.

I ABC-Conjecture (Masser-Oesterlé, 1985): Let κ > 1. Then,

with finitely many exceptions we have C < rad(ABC )κ .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan

The Fermat-Catalan equation x p + y q = z r in x, y , z coprime

positive integers. Of course we assume p, q, r > 1. We distinguish

three cases.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan

The Fermat-Catalan equation x p + y q = z r in x, y , z coprime

positive integers. Of course we assume p, q, r > 1. We distinguish

three cases.

I 1) p1 + q1 + 1r > 1. It is an exercise to show that (p, q, r ) is a

permutation of one of (2, 2, k), (2, 3, 3), (2, 3, 4), (2, 3, 5). In

any such case the number of solutions is infinite.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan

The Fermat-Catalan equation x p + y q = z r in x, y , z coprime

positive integers. Of course we assume p, q, r > 1. We distinguish

three cases.

I 1) p1 + q1 + 1r > 1. It is an exercise to show that (p, q, r ) is a

permutation of one of (2, 2, k), (2, 3, 3), (2, 3, 4), (2, 3, 5). In

any such case the number of solutions is infinite.

I 2) p1 + q1 + 1r = 1. Again it is an exercise to show that

(p, q, r ) is a permutation of one of (2, 4, 4), (2, 3, 6), (3, 3, 3).

There are finitely many solutions.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan

The Fermat-Catalan equation x p + y q = z r in x, y , z coprime

positive integers. Of course we assume p, q, r > 1. We distinguish

three cases.

I 1) p1 + q1 + 1r > 1. It is an exercise to show that (p, q, r ) is a

permutation of one of (2, 2, k), (2, 3, 3), (2, 3, 4), (2, 3, 5). In

any such case the number of solutions is infinite.

I 2) p1 + q1 + 1r = 1. Again it is an exercise to show that

(p, q, r ) is a permutation of one of (2, 4, 4), (2, 3, 6), (3, 3, 3).

There are finitely many solutions.

I 3) p1 + q1 + 1r < 1. There are infinitely many possible triples

(p, q, r ). For any such triple the number of solutions is at

most finite (Darmon-Granville, 1995).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Numeric results

14143 + 22134592 = 657 , 338 + 15490342 = 156133

438 + 962223 = 300429072 , 92623 + 153122832 = 1137 .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan conjecture

Consequence of ABC -conjecture:

The set of triples x p , y q , z r with x, y , z coprime positive integers

such that x p + y q = z r and 1/p + 1/q + 1/r < 1, is finite.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan conjecture

Consequence of ABC -conjecture:

The set of triples x p , y q , z r with x, y , z coprime positive integers

such that x p + y q = z r and 1/p + 1/q + 1/r < 1, is finite.

I Observation, 1/p + 1/q + 1/r < 1 implies

1/p + 1/q + 1/r ≤ 1 − 1/42.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan conjecture

Consequence of ABC -conjecture:

The set of triples x p , y q , z r with x, y , z coprime positive integers

such that x p + y q = z r and 1/p + 1/q + 1/r < 1, is finite.

I Observation, 1/p + 1/q + 1/r < 1 implies

1/p + 1/q + 1/r ≤ 1 − 1/42.

I Apply ABC with κ = 1.01 to A = x p , B = y q , C = z r . Notice

that rad(x r y q z r ) ≤ xyz < z r /p z r /q z.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan conjecture

Consequence of ABC -conjecture:

The set of triples x p , y q , z r with x, y , z coprime positive integers

such that x p + y q = z r and 1/p + 1/q + 1/r < 1, is finite.

I Observation, 1/p + 1/q + 1/r < 1 implies

1/p + 1/q + 1/r ≤ 1 − 1/42.

I Apply ABC with κ = 1.01 to A = x p , B = y q , C = z r . Notice

that rad(x r y q z r ) ≤ xyz < z r /p z r /q z.

I Hence, with finitely many exceptions we get

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Fermat-Catalan conjecture

Consequence of ABC -conjecture:

The set of triples x p , y q , z r with x, y , z coprime positive integers

such that x p + y q = z r and 1/p + 1/q + 1/r < 1, is finite.

I Observation, 1/p + 1/q + 1/r < 1 implies

1/p + 1/q + 1/r ≤ 1 − 1/42.

I Apply ABC with κ = 1.01 to A = x p , B = y q , C = z r . Notice

that rad(x r y q z r ) ≤ xyz < z r /p z r /q z.

I Hence, with finitely many exceptions we get

1 < κ(1/p + 1/q + 1/r ). But this is impossible because

κ = 1.01 and 1/p + 1/q + 1/r ≤ 1 − 1/42.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Catalan

solutions.

But this was shown in 1974 by Tijdeman and completely solved in

2002 by Michailescu.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Mordell’s conjecture

rational numbers x, y .

For example

x 5 + 3x 2 y − y 3 + 1 = 0, x 4 + y 4 + 3xy + x 3 − y 3 = 0, etc.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Mordell’s conjecture

rational numbers x, y .

For example

x 5 + 3x 2 y − y 3 + 1 = 0, x 4 + y 4 + 3xy + x 3 − y 3 = 0, etc.

Noam Elkies (1991) observed:

The ABC -conjecture implies: If genus(P) > 1 then the number of

rational solutions to P(x, y ) = 0 is at most finite.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Mordell’s conjecture

rational numbers x, y .

For example

x 5 + 3x 2 y − y 3 + 1 = 0, x 4 + y 4 + 3xy + x 3 − y 3 = 0, etc.

Noam Elkies (1991) observed:

The ABC -conjecture implies: If genus(P) > 1 then the number of

rational solutions to P(x, y ) = 0 is at most finite.

Previously known as Mordell’s conjecture (1923) and Faltings’

theorem (1983).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman theorem

cube, a fourth power, etc of another integer.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman theorem

cube, a fourth power, etc of another integer.

I Let P(x) be a polynomial with integer coefficients and at least

three simple zeros.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman theorem

cube, a fourth power, etc of another integer.

I Let P(x) be a polynomial with integer coefficients and at least

three simple zeros.

I Theorem (Schinzel-Tijdeman, 1976) Among the numbers

P(1), P(2), P(3), . . . there are at most finitely many perfect

powers.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman theorem

cube, a fourth power, etc of another integer.

I Let P(x) be a polynomial with integer coefficients and at least

three simple zeros.

I Theorem (Schinzel-Tijdeman, 1976) Among the numbers

P(1), P(2), P(3), . . . there are at most finitely many perfect

powers.

I Example: P(x) = x 3 + 17. We have

23 + 17 = 52 , 43 + 17 = 92 , 83 + 17 = 232 , 433 + 17 = 2822

523 + 17 = 3752 , 52343 + 17 = 3786612 .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman conjecture

with exponent 2 or higher in the prime factorisation.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman conjecture

with exponent 2 or higher in the prime factorisation.

I Gary Walsh (1998) observed that the ABC -conjecture implies

the Schinzel-Tijdeman conjecture: among the numbers

P(1), P(2), P(3), . . . there are at most finitely many powerful

numbers.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Schinzel-Tijdeman conjecture

with exponent 2 or higher in the prime factorisation.

I Gary Walsh (1998) observed that the ABC -conjecture implies

the Schinzel-Tijdeman conjecture: among the numbers

P(1), P(2), P(3), . . . there are at most finitely many powerful

numbers.

I Example: P(x) = x 3 + 17. We have

23 + 17 = 52 , 43 + 17 = 92 , 83 + 17 = 232 , 433 + 17 = 2822

523 + 17 = 3752 , 52343 + 17 = 3786612 .

The ABC-conjecture

The riddle The conjecture Consequences Evidence

State of knowledge

The ABC-conjecture

The riddle The conjecture Consequences Evidence

State of knowledge

Stewart, Kunrui Yu (1996): For any > 0:

C < exp γrad(ABC )1/3+

The ABC-conjecture

The riddle The conjecture Consequences Evidence

An analogy

The ABC-conjecture

The riddle The conjecture Consequences Evidence

An analogy

There is an analogy with polynomials with rational numbers as

coefficients: Q[x].

The ABC-conjecture

The riddle The conjecture Consequences Evidence

An analogy

There is an analogy with polynomials with rational numbers as

coefficients: Q[x].

A polynomial F (x) with rational coefficients and leading coefficient

1 is called prime if it cannot be factored into polynomials with

rational coefficients and lower degree.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

An analogy

There is an analogy with polynomials with rational numbers as

coefficients: Q[x].

A polynomial F (x) with rational coefficients and leading coefficient

1 is called prime if it cannot be factored into polynomials with

rational coefficients and lower degree.

Theorem: Any polynomial with rational numbers as coefficient can

be written in a unique way as a constant times a product of prime

polynomials.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Factors of polynomials

factorisation:

x 21 − 1 = (x 6 + x 5 + x 4 + x 3 + x 2 + x + 1) ×

(x − 1)(x 2 + x + 1) ×

(x 12 − x 11 + x 9 − x 8 + x 6 − x 4 + x 3 − x + 1).

The radical of a polynomial F (x) is the product of the prime

polynomials dividing F (x). Notation rad(F ).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

PQR-Theorem

coprime polynomials, not all constant, such that P + Q = R.

Suppose that deg(R) ≥ deg(P), deg(Q). Then

The ABC-conjecture

The riddle The conjecture Consequences Evidence

PQR-Theorem

coprime polynomials, not all constant, such that P + Q = R.

Suppose that deg(R) ≥ deg(P), deg(Q). Then

Note the analogy: deg(PQ) = deg(P) + deg(Q) for polynomials

and log(ab) = log(a) + log(b) for numbers. We get:

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, I

Observe that for any polynomial F ,

rad(F ) = F / gcd(F , F 0 )

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, I

Observe that for any polynomial F ,

rad(F ) = F / gcd(F , F 0 )

gcd(F , F 0 ) = x 2 (x − 1)4 and F / gcd(F , F 0 ) = x(x − 1).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, I

Observe that for any polynomial F ,

rad(F ) = F / gcd(F , F 0 )

gcd(F , F 0 ) = x 2 (x − 1)4 and F / gcd(F , F 0 ) = x(x − 1).

Start with

P +Q =R

and differentiate:

P0 + Q0 = R0

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, I

Observe that for any polynomial F ,

rad(F ) = F / gcd(F , F 0 )

gcd(F , F 0 ) = x 2 (x − 1)4 and F / gcd(F , F 0 ) = x(x − 1).

Start with

P +Q =R

and differentiate:

P0 + Q0 = R0

Muliply first equality by P 0 , second equality by P and subtract,

P 0 Q − pQ 0 = P 0 R − PR 0

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, II

P 0 Q − pQ 0 = P 0 R − PR 0

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, II

P 0 Q − pQ 0 = P 0 R − PR 0

P 0 Q − PQ 0

.

gcd(P, P 0 ) gcd(Q, Q 0 )

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, II

P 0 Q − pQ 0 = P 0 R − PR 0

P 0 Q − PQ 0

.

gcd(P, P 0 ) gcd(Q, Q 0 )

Consequently, if P 0 Q − pQ 0 6= 0,

deg(gcd(R, R 0 ) < deg(rad(P)) + deg(rad(Q)) = deg(rad(PQ)).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, II

P 0 Q − pQ 0 = P 0 R − PR 0

P 0 Q − PQ 0

.

gcd(P, P 0 ) gcd(Q, Q 0 )

Consequently, if P 0 Q − pQ 0 6= 0,

deg(gcd(R, R 0 ) < deg(rad(P)) + deg(rad(Q)) = deg(rad(PQ)).

Add deg(R/ gcd(R, R 0 )) = deg(rad(R)) to get

deg(R) < deg(rad(PQR)).

The ABC-conjecture

The riddle The conjecture Consequences Evidence

Proof of PQR, II

P 0 Q − pQ 0 = P 0 R − PR 0

P 0 Q − PQ 0

.

gcd(P, P 0 ) gcd(Q, Q 0 )

Consequently, if P 0 Q − pQ 0 6= 0,

deg(gcd(R, R 0 ) < deg(rad(P)) + deg(rad(Q)) = deg(rad(PQ)).

Add deg(R/ gcd(R, R 0 )) = deg(rad(R)) to get

deg(R) < deg(rad(PQR)).

constant.

The ABC-conjecture

The riddle The conjecture Consequences Evidence

The quest

Main questions

The ABC-conjecture

The riddle The conjecture Consequences Evidence

The quest

Main questions

I If the ABC -conjecture is true, there should be a minimal

number κ such that C ≥ rad(ABC )κ for all ABC -triples.

What is the value of κ ?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

The quest

Main questions

I If the ABC -conjecture is true, there should be a minimal

number κ such that C ≥ rad(ABC )κ for all ABC -triples.

What is the value of κ ?

I How does the number of ABC -hits with C < X grow as

X → ∞ ? Are there distribution laws? How are the ratios

log(C )/ log(rad(ABC )) distributed?

The ABC-conjecture

The riddle The conjecture Consequences Evidence

The quest

Main questions

I If the ABC -conjecture is true, there should be a minimal

number κ such that C ≥ rad(ABC )κ for all ABC -triples.

What is the value of κ ?

I How does the number of ABC -hits with C < X grow as

X → ∞ ? Are there distribution laws? How are the ratios

log(C )/ log(rad(ABC )) distributed?

The ABC-conjecture

- Section17 Greatest Common Factors and Least Common MultiplesCargado pormarchelo_chelo
- Chapter04 Quadratic EquationsCargado poriskenderbey
- Aitchison College Syllabus GuideCargado porbilalahmed78
- Algebraic FractionsCargado porMissMiller
- OMOFall13SolnsCargado porkid
- MAT 221 Professional TutorCargado porAnaAles1
- Complete_thesis.pdfCargado porIsabel Reyes
- 2015 Grade 4 MTAP Math Challenge Division OralsCargado porMarigrace Manipon Santos
- CV MANJULCargado porNischay Behal
- Modular ArithmeticCargado porHazel Clemente Carreon
- 10 FactorizationCargado porNilam Doctor
- ukmog-2011.pdfCargado porbritibanerjee
- edexel math c2 qpCargado porredrose_17
- MCQ Ch 1 FSC Part1 NaumanCargado porAngelic Shine
- 1_Grade_5[1]Cargado porHaironisaMalaoMacagaan
- 3_2.pdfCargado porMahmoud Badran
- 2year Sample Paper-6Cargado porManish Bhardwaj
- Group Challenge dCargado porMiggie Nurwibowo
- lots-of-questions.pdfCargado porHrittik Roy
- methods lesson finalCargado porapi-253865199
- Mid Term Syllabus & Blue Print VIIICargado porVishal Sharma
- Cube and Cube RootCargado porpoonam_goyal26
- PolynomialsCargado porKristanne Del Rosario
- MATH Q Paper-1 9thCargado porAmulya Kumar Roul
- ProgramsCargado porVasantha Kumari
- lero01Cargado porTravis Bennett
- Alcuin's Sequence - WikipediaCargado porGary Synthos
- assignment 4Cargado porapi-247112650
- Marco Mackaay, Marko Stosic and Pedro Vaz- sl(N)-Link Homology (N≥4) Using Foams and the Kapustin-Li FormulaCargado porDuncan_Vim
- 6. Wastewater EngineeringCargado porlasitha chandima jayasinghe

- Attacking and defending the McEliece cryptosystemCargado porChris Nash
- A Relational Model of Data for Large Shared Data BanksCargado porChris Nash
- Comparing Performance of Solid State Devices and Mechanical DisksCargado porChris Nash
- SP800-114Cargado porMichael Williams
- Cross-Site Request Forgeries: Exploitation and PreventionCargado porChris Nash
- Designing and implementing malicious hardwareCargado porChris Nash
- Guide to Enterprise Telework and Remote Access Security (Draft)Cargado porChris Nash
- Unraveling A Well Woven SoloCargado porChris Nash
- Catalan's Conjecture: Another Old Diophantine Problem SolvedCargado porChris Nash
- Press Advisory: Alglucerase Case Study Illustrates Challenges of Controlling Health Care Costs (OCR)Cargado porChris Nash
- Reconsidering Physical Key Secrecy: Teleduplication via Optical DecodingCargado porChris Nash
- Television's Performance on Election Night 2000: A Report for CNNCargado porChris Nash
- Google response Working Party 06 2007Cargado porChris Nash
- pressadvisory9212-ocrCargado porChris Nash
- The MD6 Hash FunctionCargado porChris Nash
- The Skein Hash Function FamilyCargado porChris Nash
- pressadvisory9209-ocrCargado porChris Nash
- Review of the Safety of LHC CollisionsCargado porChris Nash
- When Good Instructions Go Bad: Generalizing Return-Oriented Programming to RISCCargado porChris Nash
- The Geometry of Innocent Flesh on the Bone: Return-into-libc without Function Calls (on the x86)Cargado porChris Nash
- Shostack ModSec08 Experiences Threat Modeling at MicrosoftCargado porwolfenic
- Cross-Cultural Analysis of Students with Exceptional Talent in Mathematical Problem SolvingCargado porChris Nash
- On the potential for extinction by Muller's Ratchet in Caenorhabditis elegansCargado porChris Nash
- Digital Computational ImagingCargado porChris Nash
- Multi-hop whistler-mode ELF/VLF signals and triggered emissions excited by the HAARP HF heaterCargado porChris Nash
- google ogb article29 responseCargado porChris Nash
- Opinie%20WP29%20zoekmachinesCargado porChris Nash
- pressadvisory9218-ocrCargado porChris Nash
- pressadvisory9213-ocrCargado porChris Nash

- Ignition CoilCargado porwaterlife70
- IsisCargado porsud_mishra
- 2014 t2 Trial Ssi JbCargado pormasyati
- Grid Connection of Wind Farms - MPollerCargado pordjalmasa
- Hamming CodesCargado porAaron Merrill
- Nokia c3 00 Rm 614 Service SchematicsCargado porANDREKO88
- Artist Residency Programs in Rural Areas in Serbia - New Organizational ModelsCargado porSanja Lazić
- Technical Specs. (Vol-2)(17)Cargado pordeyvishwarup
- Oracle OPM WMS White Paper (1)Cargado por1lvlup
- Training for SAP ERP in for Applications.pdfCargado porSangoothura Vayasulay Sangeetha
- Saturn automatic transmissionCargado porDenis
- YPPH FBO Ground Handling Agent Perth International Airport, AustraliaCargado porUniversal Weather and Aviation, Inc.
- pp 533-541 HEAT AND MASS TRANSFER IN A SHRINKING CYLINDER DRYINGCargado porelatani
- The Early Chicago Tall Office Building: Artistically and Functionally ConsideredCargado porDorian Vujnović
- Assignmnet of OB TD SM & HRMCargado portouhedur
- Ut Procedure GeneralCargado porvsnaiduqc
- ARMA ModelingCargado pordervisis1
- Case Studies in Brickwork Pre AssemblyCargado porshshanks
- Beta Function TrigonometricCargado porGerardo Ariel Núñez Muñoz
- PDF Creator Plus 5.0 = UserguideCargado porTom Tampon
- NACCE & Verizon Partner with Community Colleges to Bring STEM Workshops to Young Girls in Rural AreasCargado porPR.com
- The Johari WindowCargado porShabnam Kapoor
- A740GM-M V80 ManualCargado porAntonio Valerio
- Personal-Development-Part-1.pptxCargado porYsay Francisco
- Sample-Spreadsheet-5000-rows.xlsxCargado porSivabaskaran Kumarasamy K
- HVAC BOQ R1- 29-08-2013 (2)Cargado porVishwajit Kale
- Chapter 9Cargado porhamadaxx2000
- Safety Report 170627Cargado porMax
- Tips for using diaphragms with analysis software.docxCargado porthailecanada
- Hettich_ProjectSolutions_0412_EN.pdfCargado poraudithan