Arithmetic progressions in a unique factorization domain

DOI10.4064/AA154-2-4MaRDI QIDQ2893039zbMATH OpenOpenAlexFDO

Authors Sudhir R. Ghorpade, Samrith Ram

Publication date 25 June 2012

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.1267

zbMATH Keywords

arithmetic progressionsBezout domainconsecutive integersdecomposition numberGCD domainunique factorization domain

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic progressions (11B25) Divisibility and factorizations in commutative rings (13A05) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15)

Abstract: Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of integers and further extend it to arithmetic progressions in unique factorization domains of characteristic zero.

Recommendations

• Extending a problem of Pillai to Gaussian lines
• On a problem of Pillai and its generalizations
• Extending a theorem of Pillai to quadratic sequences
• Pillai's problem on consecutive integers
• scientific article; zbMATH DE number 4164942

Cited in

(4)

• Pillai's problem on consecutive integers
• Euclid Prime Sequences over Unique Factorization Domains
• Unique factorization and the fundamental theorem of arithmetic
• Extending a problem of Pillai to Gaussian lines

This page was built for publication: Arithmetic progressions in a unique factorization domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893039)