Related papers: On Nov\'ak numbers

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

Assuming the generalized Riemann hypothesis and a bound for the negative discrete moments of the Riemann zeta function (resp. Dirichlet $L$-functions), we prove the existence of a logarithmic limiting distribution for the normalized partial…

Let X be a curve over a number field K with genus g>=2, $\pp$ a prime of O_K over an unramified rational prime p>2r, J the Jacobian of X, r=rank J(K), and $\scrX$ a regular proper model of X at $\pp$. Suppose r<g. We prove that…

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

A formulation of "Ne\v{c}iporuk's lower bound method" slightly more inclusive than the usual complexity-measure-specific formulation is presented. Using this general formulation, limitations to lower bounds achievable by the method are…

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

The distribution of prime numbers is here considered. We show a formula for $li^{-1}$ and we study the $\pi(x)$ function and Riemann's hypothesis.

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

Let $n,k,a$ and $c$ be positive integers and $b$ be a nonnegative integer. Let $\nu_2(k)$ and $s_2(k)$ be the 2-adic valuation of $k$ and the sum of binary digits of $k$, respectively. Let $S(n,k)$ be the Stirling number of the second kind.…

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…