Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFurther Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
369
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >= a and n >= 2*alpha*r, we have L_n >= u_0*r^{alpha+a-2}*(r+1)^n. In particular, letting a = 2 yields an improvement to the best previous lower bound on L_n (obtained by Hong and Yang) for all but three choices of alpha,r >= 2.
rate research
Read More
For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=mathrm{lcm}(u_0,u_1,ldots, u_n)$ of the finite arithmetic progression ${u_k:=u_0+kr}_{k=0}^n$. We derive new lower bounds on $L_n$ which improve upon those obtained previously when either $u_0$ or $n$ is large. When $r$ is prime, our best bound is sharp up to a factor of $n+1$ for $u_0$ properly chosen, and is also nearly sharp as $ntoinfty$.
Let $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${rm lcm}_{lceil n/2rceil le ile n} {f(i)}ge 2^n$ except that $f(x)=x$ and $n=1, 2, 3, 4, 6$ and that $f(x)=x^s$ with $sge 2$ being an integer and $n=1$, where $lceil n/2rceil$ denotes the smallest integer which is not less than $n/2$. This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013.
We study a Dirichlet series in two variables which counts primitive three-term arithmetic progressions of squares. We show that this multiple Dirichlet series has meromorphic continuation to $mathbb{C}^2$ and use Tauberian methods to obtain counts for arithmetic progressions of squares and rational points on $x^2+y^2=2$.
Let $a$ and $b$ be positive integers. In 1946, ErdH{o}s and Niven proved that there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/b, 1/(a+b),..., 1/(an-a+b)$ are integers. In this paper, we show that for any integer $k$ with $1le kle n$, the $k$-th elementary symmetric function of $1/b, 1/(a+b),..., 1/(an-a+b)$ is not an integer except that either $b=n=k=1$ and $age 1$, or $a=b=1, n=3$ and $k=2$. This refines the ErdH{o}s-Niven theorem and answers an open problem raised by Chen and Tang in 2012.
Given an abelian group $G$, it is natural to ask whether there exists a permutation $pi$ of $G$ that destroys all nontrivial 3-term arithmetic progressions (APs), in the sense that $pi(b) - pi(a) eq pi(c) - pi(b)$ for every ordered triple $(a,b,c) in G^3$ satisfying $b-a = c-b eq 0$. This question was resolved for infinite groups $G$ by Hegarty, who showed that there exists an AP-destroying permutation of $G$ if and only if $G/Omega_2(G)$ has the same cardinality as $G$, where $Omega_2(G)$ denotes the subgroup of all elements in $G$ whose order divides $2$. In the case when $G$ is finite, however, only partial results have been obtained thus far. Hegarty has conjectured that an AP-destroying permutation of $G$ exists if $G = mathbb{Z}/nmathbb{Z}$ for all $n eq 2,3,5,7$, and together with Martinsson, he has proven the conjecture for all $n > 1.4 times 10^{14}$. In this paper, we show that if $p$ is a prime and $k$ is a positive integer, then there is an AP-destroying permutation of the elementary $p$-group $(mathbb{Z}/pmathbb{Z})^k$ if and only if $p$ is odd and $(p,k) otin {(3,1),(5,1), (7,1)}$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
