✦ LIBER ✦

The least common multiple of a sequence of products of linear polynomials

✍ Scribed by Shaofang Hong; Guoyou Qian; Qianrong Tan

Book ID: 113060782
Publisher: Akadmiai Kiad
Year: 2011
Tongue: English
Weight: 473 KB
Volume: 135
Category: Article
ISSN: 1588-2632
DOI: 10.1007/s10474-011-0173-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The least common multiple of a quadratic

The least common multiple of a quadratic sequence

✍ Cilleruelo, Javier 📂 Article 📅 2010 🏛 Cambridge University Press 🌐 English ⚖ 671 KB

Numerical Computation of the Least Commo

Numerical Computation of the Least Common Multiple of a Set of Polynomials

✍ Nicos Karcanias; Marilena Mitrouli 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 649 KB

System theoretic based characterisation

System theoretic based characterisation and computation of the least common multiple of a set of polynomials

✍ Nicos Karcanias; Marilena Mitrouli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 274 KB

On the Minimal Polynomial of the Product

On the Minimal Polynomial of the Product of Linear Recurring Sequences

✍ R. Göttfert; H. Niederreiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 462 KB

A Remark on the Minimal Polynomial of th

A Remark on the Minimal Polynomial of the Product of Linear Recurring Sequences

✍ Emrah Çakçak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Nontrivial lower bounds for the least co

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

✍ Bakir Farhi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 201 KB

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic s