On a Problem Relating to the ABC Conjecture

Details On a Problem Relating to the ABC Conjecture On a Problem Relating to the ABC Conjecture

2011-04-13

arxiv.org/abs/1104.2635v1

Mathematics

Number Theory

Scientific paper

We consider a variant of the ABC Conjecture, attempting to count the number of solutions to $A+B+C=0$, in relatively prime integers $A,B,C$ each of absolute value less than $N$ with $r(A)<|A|^a, r(B)<|B|^b, r(C)<|C|^c.$ The ABC Conjecture is equivalent to the statement that for $a+b+c<1$, the number of solutions is bounded independently of $N$. If $a+b+c \geq 1$, it is conjectured that the number of solutions is asymptotically $N^{a+b+c-1 \pm \epsilon}.$ We prove this conjecture as long as $a+b+c \geq 2.$

Affiliated with

Also associated with

No associations

Rating

On a Problem Relating to the ABC Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a Problem Relating to the ABC Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Problem Relating to the ABC Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164849