English
Related papers

Related papers: On the distribution of lcm of k-tuples and related…

200 papers

We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integers in $\N\cap [1,x]$ satisfies $$ S_k(x)=P_{2^k-1}(\log x)+O(x^{-\theta_k+\epsilon}) $$ where $P$ is a polynomial of degree $2^k-1$ and…

Number Theory · Mathematics 2022-07-26 Sungjin Kim

This paper is devoted to the study of statistical properties of the greatest common divisor and the least common multiple of random samples of positive integers.

Number Theory · Mathematics 2013-05-03 José L. Fernández , Pablo Fernández

We study the typical behavior of the least common multiple of the elements of a random subset $A\subset \{1,\dots, n\}$. For example we prove that $\text{lcm}\{a:\ a\in A\}=2^{n(1+o(1))}$ for almost all subsets $A\subset\{1,\dots,n\}$.

Number Theory · Mathematics 2013-12-16 Javier Cilleruelo , Juanjo Rué , Paulius Šarka , Ana Zumalacárregui

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

Probability · Mathematics 2019-11-11 Alin Bostan , Alexander Marynych , Kilian Raschel

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

Number Theory · Mathematics 2015-09-30 Victor Volfson

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

Number Theory · Mathematics 2020-02-06 Titus Hilberdink , Florian Luca , László Tóth

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…

Number Theory · Mathematics 2008-03-04 Bakir Farhi

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

Number Theory · Mathematics 2024-12-09 László Tóth

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

Number Theory · Mathematics 2020-11-10 Sid Ali Bousla

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

Number Theory · Mathematics 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

This thesis is devoted to studying estimates of the least common multiple of some integer sequences. Our study focuses on effective bounding of the $\mathrm{lcm}$ of some class of quadratic sequences, as well as arithmetic progressions and…

Number Theory · Mathematics 2020-12-11 Sid Ali Bousla

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

Computational Geometry · Computer Science 2025-11-04 Ke Chen , Adrian Dumitrescu

Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…

General Mathematics · Mathematics 2024-10-15 Stijn Cambie

In 1940 Paul Erd\H{o}s made a conjecture about the distribution of reduced residues. Here we study the distribution of $k$-tuple of reduced residues.

Number Theory · Mathematics 2014-08-20 Farzad Aryan

We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…

Data Structures and Algorithms · Computer Science 2025-12-10 Gunjan Kumar , Yash Pote , Jonathan Scarlett

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

Number Theory · Mathematics 2012-06-29 D. A. Goldston , A. H. Ledoan

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…

Probability · Mathematics 2020-12-21 Ross G. Pinsky

For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…

Number Theory · Mathematics 2014-02-18 Eric F. Bravo , Jhon J. Bravo , Florian Luca

We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be applied to this question.

Number Theory · Mathematics 2018-02-22 Scott Funkhouser , Daniel A. Goldston , Andrew H. Ledoan
‹ Prev 1 2 3 10 Next ›