Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
Sid Ali Bousla, Bakir Farhi

TL;DR
This paper establishes new nontrivial lower bounds for the least common multiple of quadratic sequences, using a novel algebraic approach, and provides explicit bounds depending on sequence parameters.
Contribution
It introduces a new algebraic method to derive lower bounds for the LCM of quadratic sequences, improving upon previous approaches.
Findings
Proves LCM is divisible by a specific rational expression.
Derives explicit lower bounds for LCM based on sequence parameters.
Demonstrates the effectiveness of algebraic methods over previous techniques.
Abstract
This paper is devoted to studying the numbers , where are positive integers such that . Precisely, we prove that is a multiple of the rational number \[\frac{\displaystyle\prod_{k=m}^{n}\left(k^2+c\right)}{c \cdot (n-m)!\displaystyle\prod_{k=1}^{n-m}\left(k^2+4c\right)} ,\] and we derive (as consequences) some nontrivial lower bounds for . We prove for example that if , then we have , where . Further, it must be noted that our approach (focusing on commutative algebra) is new and different from those using previously by Farhi, Oon and Hong.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · graph theory and CDMA systems
