Abstract
In this paper we consider an analogue of the problem of Erdős and Woods for arithmetic progressions. A positive answer follows from theabc conjecture. Partial results are obtained unconditionally.
Similar content being viewed by others
References
Balasubramanian, R., Shorey, T. N., Waldschmidt, M.: On the maximal length of two sequences of consecutive integers with the same prime divisors. Acta Math. Hung.54, 225–236 (1989).
Györy, K.: Explicit upper bounds for the solutions of some Diophantine equations. Ann. Acad. Sci. Fenn. Ser. A. I.5, 3–12 (1980).
Lang, S.: Algebra, 3rd edn. Reading, Mass.: Addison Wesley. 1993.
Shorey, T. N., Tijdeman, R.: On the greatest prime factor of an arithmetical progression. In: A Tribute to Paul Erdős (A. Baker, B. Bollobas, A. Hajnal, eds.) pp. 385–389. Cambridge: Univ. Press. 1990.
Sylvester, J. J.: On arithmetical series. Messenger of Math.21, 1–19 and 87–120; Math. Papers IV, pp. 686–731. Cambridge. 1912.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Balasubramanian, R., Langevin, M., Shorey, T.N. et al. On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors. Monatshefte für Mathematik 121, 295–307 (1996). https://doi.org/10.1007/BF01308722
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01308722