Add to ORKGAbstract. We obtain, for any irreducible quadratic polynomial f(x) in Z[x], the estimate log l.c.m. {f(1),..., f(n)} = n logn + Bn + o(n) where B is a constant depending on f. 1
Consider a time series T and the set of polynomial models of T. We discuss two types of linearalitie...
Let L(n; k) = n k n k . We prove that all the zeros of the polynomial Ln (x) = are real. The...
In [1] Smarandache LCM Sequence has been defined as Tn = LCM ( 1 to n) = LCM of all the natural numb...
For an irreducible polynomial f∈ℤ[x] of degree d≥2, Cilleruelo conjectured that the least common mul...
We study the logarithm of the least common multiple of the sequence of integers given by 12 + 1, 2 2...
We collect some results and problems about the quantity Lf(n) := lcm(f(1), f(2),..., f(n)), where ...
AbstractWe present here a method which allows to derive a nontrivial lower bounds for the least comm...
Let $k$ be any given positive integer. We define the arithmetic function $g_{k}$ for any positive ...
AbstractThe paper provides a system theoretic characterisation of the least common multiple (LCM) m(...
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli rando...
to appear in Proceedings of the AMSGiven a sequence of complex numbers ρ_n, we study the asymptotic ...
AbstractThe least common multiple of the first n positive integers divides a certain multinomial coe...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
There is the well known result that n! divides the product of any set of n consecutive numbers. Usin...
This licentiate consists of two papers treating polynomial sequences defined by linear recurrences. ...
Consider a time series T and the set of polynomial models of T. We discuss two types of linearalitie...
Let L(n; k) = n k n k . We prove that all the zeros of the polynomial Ln (x) = are real. The...
In [1] Smarandache LCM Sequence has been defined as Tn = LCM ( 1 to n) = LCM of all the natural numb...
For an irreducible polynomial f∈ℤ[x] of degree d≥2, Cilleruelo conjectured that the least common mul...
We study the logarithm of the least common multiple of the sequence of integers given by 12 + 1, 2 2...
We collect some results and problems about the quantity Lf(n) := lcm(f(1), f(2),..., f(n)), where ...
AbstractWe present here a method which allows to derive a nontrivial lower bounds for the least comm...
Let $k$ be any given positive integer. We define the arithmetic function $g_{k}$ for any positive ...
AbstractThe paper provides a system theoretic characterisation of the least common multiple (LCM) m(...
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli rando...
to appear in Proceedings of the AMSGiven a sequence of complex numbers ρ_n, we study the asymptotic ...
AbstractThe least common multiple of the first n positive integers divides a certain multinomial coe...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
There is the well known result that n! divides the product of any set of n consecutive numbers. Usin...
This licentiate consists of two papers treating polynomial sequences defined by linear recurrences. ...
Consider a time series T and the set of polynomial models of T. We discuss two types of linearalitie...
Let L(n; k) = n k n k . We prove that all the zeros of the polynomial Ln (x) = are real. The...
In [1] Smarandache LCM Sequence has been defined as Tn = LCM ( 1 to n) = LCM of all the natural numb...