Related papers: Dirichlet's theorem and Jacobsthal's function

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

Let $X_{n}$ denote the unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$. We continue the study of cases in which the inequality $\gamma_t(X_n) \le g(n)$ is strict, where $\gamma_t$ denotes the total domination number, and $g$ is the…

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,\ldots,d_{k}],$ with all partial quotients…

We consider the learning task consisting in predicting as well as the best function in a finite reference set G up to the smallest possible additive term. If R(g) denotes the generalization error of a prediction function g, under reasonable…

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Let $d$ be a real number, let $s$ be in a fixed compact set of the strip $1/2<\sigma<1$, and let $L(s, \chi)$ be the Dirichlet $L$-function. The hypothesis is that for any real number $d$ there exist 'many' real numbers $\tau$ such that the…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

A famous conjecture of Chowla on the least primes in arithmetic progressions implies that the abscissa of convergence of the Weil representation zeta function for a procyclic group $G$ only depends on the set $S$ of primes dividing the…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

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 fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

The classical theorem of Schnirelmann states that the primes are an additive basis for the integers. In this paper we consider the analogous multiplicative setting of the cyclic group $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$, and…