相关论文: The asymptotic distribution of the largest prime d…

The paper is concerned with estimating the number of integers smaller than $x$ whose largest prime divisor is smaller than $y$, denoted $\psi (x,y)$. Much of the related literature is concerned with approximating $\psi (x,y)$ by Dickman's…

Asymptotics for Dickman's number theoretic function $\rho(u)$, as $u \rightarrow \infty$, were given de Bruijn and Alladi, and later in sharper form by Hildebrand and Tenenbaum. The perspective in these works is that of analytic number…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…

Billingsley's theorem (1972) asserts that the Poisson--Dirichlet process is the limit, as $n \to \infty$, of the process giving the relative log sizes of the largest prime factor, the second largest, and so on, of a random integer chosen…

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this…

In this paper, we study the maximum likelihood estimate of the probability mass function (pmf) of $n$ independent and identically distributed (i.i.d.) random variables, in the non-asymptotic regime. We are interested in characterizing the…

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

We provide an asymptotic expansion for the mean-value of the logarithm of the middle prime factor of an integer, defined according to multiplicity or not, thus generalising a recent study of McNew, Pollack, and Singha Roy. This yields an…

For affine stochastic differential equation with uniformly distributed time delay the local asymptotic properties of the likelihood function are studied. Local asymptotic normality, local asymptotic mixed normality, periodic local…

For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

We establish an asymptotic formula for $\Psi(x,y)$ whose shape is $x \rho(\log x/\log y)$ times correction factors. These factors take into account the contributions of zeta zeros and prime powers and the formula can be regarded as an…

We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

Summation arithmetic functions with asymptotically independent terms are studied in the paper, the limit of which is the law of normal distribution. Assertions about the asymptotic behavior of the indicated functions are proved.

An asymptotic formula for the number of $n \le x$ such that $n$ does not divide $P(n)!$ is given, where P(n) is the largest prime factor of $n$.

A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…