Related papers: The smallest invariant factor of the multiplicativ…
Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…
In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods…
Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…
We generalize the Mittag-Leffler function by attaching an exponent to its Taylor coefficients. The main result is an asymptotic formula valid in sectors of the complex plane, which extends work by Le Roy [Bull. des sciences math. 24, 1900]…
We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…
In this paper, we can show that \begin{align*} S_{\Lambda}(x)=\sum_{1\leq n\leq x}\Lambda \left(\left[\frac{x}{n}\right]\right)= \sum_{n=1}^{\infty} \frac{\Lambda(n)}{n(n+1)}x +O\left(x^{7/15+1/195+\varepsilon}\right), \end{align*} where…
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…
Let $f(n)$ be an arithmetic function with $f(1)\neq0$ and let $f^{-1}(n)$ be its reciprocal with respect to the Dirichlet convolution. We study the asymptotic behaviour of $|f^{-1}(n)|$ with regard to the asymptotic behaviour of $|f(n)|$…
We will use a discrete analogue of the classical Laplace method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansion of the scaled $q$-exponential $(-q^{-nt+1/2}u;q)_{\infty}$ could be expressed…
This note provides an effective bound in the Gauss-Kuzmin-L\'evy problem for some Gauss type shifts associated with nearest integer continued fractions, acting on the interval $I_0=[0,\frac{1}{2}]$ or $I_0=[-\frac{1}{2},\frac{1}{2}]$. We…
In this article we derive, using the Lagrange inversion theorem and applying twice the Fa\`a di Bruno formula, an expression of the minimum of the Gamma function $\Gamma$ as an expansion in powers of the Euler-Mascheroni constant $\gamma$.…
Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…
The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…
A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced…
We obtain asymptotic formulas for the number of matrices in the congruence subgroup \[ \Gamma_0(Q) = \left\{ A\in\mathrm{SL}_2(\mathbb Z):~c \equiv 0 \pmod Q\right\}, \] which are of naive height at most $X$. Our result is uniform in a very…
We compute the probability mass function of the random variable which returns the smallest denominator of a reduced fraction in a randomly chosen real interval of radius $\delta/2$. As an application, we prove that the expected value of the…
We describe a numerical algorithm for evaluating the numbers of roots minus the number of poles contained in a region based on the argument principle with the function of interest being written as a Mellin transformation of a usually…
In the late eighties, Hildebrand and Tenenbaum proved an asymptotic formula for the number of positive integers below $x$, having exactly $\nu$ distinct prime divisors: $\pi_{\nu}(x) \sim x \delta_{\nu}(x)$. Here we consider the restricted…