The abc-conjecture is true for at least $N(c), 1 \leq N(c) <ϕ(c)/2$, partitions a, b of c
| dc.creator | Petridi, Constantin M. | |
| dc.date | 2003-01-07 | |
| dc.date.accessioned | 2026-07-07T04:54:18Z | |
| dc.date.available | 2026-07-07T04:54:18Z | |
| dc.description | We prove that for any positive integer c there are at least N(c), $1\leq N(c) < ϕ(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc, where k an absolute constant. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/math/0301050 | |
| dc.identifier | http://arxiv.org/abs/math/0301050 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66194 | |
| dc.subject | Number Theory | |
| dc.title | The abc-conjecture is true for at least $N(c), 1 \leq N(c) <ϕ(c)/2$, partitions a, b of c | |
| dc.type | text |