On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors

Balasubramanian, R. ; Langevin, M. ; Shorey, T. N. ; Waldschmidt, M. (1996) On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors Monatshefte für Mathematik, 121 (4). pp. 295-307. ISSN 0026-9255

[img]
Preview
PDF - Publisher Version
872kB

Official URL: http://www.springerlink.com/content/x02214g777k883...

Related URL: http://dx.doi.org/10.1007/BF01308722

Abstract

In this paper we consider an analogue of the problem of Erdos and Woods for arithmetic progressions. A positive answer follows from the abc conjecture. Partial results are obtained unconditionally.

Item Type:Article
Source:Copyright of this article belongs to Springer-Verlag.
Keywords:Greatest Prime Factor; Divisors; Arithmetic Progression; Erdδs Woods; abc Conjecture; Linear Forms in Logarithms
ID Code:1315
Deposited On:04 Oct 2010 07:52
Last Modified:16 May 2016 12:27

Repository Staff Only: item control page