On the gcd of an infinite number of integers

zbMATH Open1156.11300arXivmath/0409377MaRDI QIDQ3545958FDOQ3545958

Authors: T. N. Venkataramana 

Publication date: 11 December 2008

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

Recommendations

• Counting congruence subgroups.
• Subgroup growth and congruence subgroups
• On the greatest common divisor of \(u-1\) and \(v-1\) with \(u\) and \(v\) near \(\mathcal S\)-units
• Torsion points on curves and common divisors of a^k-1 and b^k-1
• A cyclotomic generalization of the sequence \(\gcd(a^n-1, b^n-1)\)

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited In (2)

• On an Integer's Infinitary Divisors
• Common divisors of totients of polynomial sequences

This page was built for publication: On the gcd of an infinite number of integers

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