Related papers: A short note on the computation of the generalised…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…

We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…

We study the $q$-analogue of the average of Montgomery's function $F(\alpha, T)$ over bounded intervals. Assuming the Generalized Riemann Hypothesis for Dirichlet $L$-functions, we obtain upper and lower bounds for this average over an…

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).

Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

We prove new lower bounds for the upper tail probabilities of suprema of Gaussian processes. Unlike many existing bounds, our results are not asymptotic, but supply strong information when one is only a little into the upper tail. We…

The first part of the paper is devoted to two descriptions of all polynomial tau-functions of the KP hierarchy: by a generalized Jacobi-Trudy formula, and a generalized Giambelli formula. We use the latter formula in the second part to…

A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations…

Collatz Conjecture (also known as Ulam's conjecture and 3x+1 problem) concerns the behavior of the iterates of a particular function on natural numbers. A number of generalizations of the conjecture have been subjected to extensive study.…

Assuming the generalized Lindel\"of hypothesis for Dirichlet $L$-functions, we establish that the least prime $p\equiv a\pmod{q}$ satisfies $p\ll_{\varepsilon} q^{2+\varepsilon}$. This achieves a bound that nearly matches the classical…

For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

We resolve the function field analogue of the conjecture concerning distribution of twin primes in arithmetic progression.

A new approach to analyzing intrinsic properties of the Josephus function, $J_{_k}$, is presented in this paper. The linear structure between extreme points of $J_{_k}$ is fully revealed, leading to the design of an efficient algorithm for…