相关论文: Dickman multiple polylogarithms and the Lindemann-…

The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=-…

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…

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…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…

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 establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

We consider the Dickman function $\Psi (x,y)$ in the limit when $\ln x/\ln y\to \infty $ and $\ln \ln x \ln y\to 0$. The asymptotic value is expressed in terms of the ratio of iterated loragithm of $x$ and $ln y$.

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to…

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…

Harvey Friedman gives a comparatively short description of an ``unimaginably large'' number $n(3)$ , beyond, e.g. the values $$ A(7,184)< A({7198},158386) < n(3)$$ of Ackermann's function - but finite. We implement Friedman's combinatorial…