Related papers: Lower bound for the remainder in the prime-pair co…

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

Let $\mathcal{P}$ be the set of primes and $\pi(x)$ the number of primes not exceeding $x$. Let also $P^+(n)$ be the largest prime factor of $n$ with convention $P^+(1)=1$ and $$ T_c(x)=\#\left\{p\le x:p\in \mathcal{P},P^+(p-1)\ge…

For any prime $p$ and real number and $\alpha$, the $p$-adic Littlewood Conjecture due to de Mathan and Teuli\'e asserts that \[\inf_{|m|\ge1}|m|_p\cdot |m|\cdot |\left\langle\alpha m\right\rangle|=0.\] Above, $|m|$ is the usual absolute…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

The results of the computer hunt for the primes of the form $q = m^2+1$ up to $10^{20}$ are reported. The number of sign changes of the difference $\pi_q(x) - \frac{C_q}{2}\int_2^x{du \over \sqrt{u}\log(u)}$ and the error term for this…

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that even among the idempotent polynomials there must exist…

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

Given positive numbers p_1 < p_2 < ... < p_n, and a real number r let L_r be the n by n matrix with its (i,j) entry equal to (p_i^r-p_j^r)/(p_i-p_j). A well-known theorem of C. Loewner says that L_r is positive definite when 0 < r < 1. In…

By means of Peres-Schlag's method we prove the existence of real numbers $\alpha, \beta$ such that $$ \liminf_{q\to \infty} (q\log^2 q)||\alpha q|| ||\beta q|| > 0.

The Hardy Inequality (HI) for potentials with countably many singularities of the form $V=\sum_{k\in \mathbf{Z}}\frac{1}{|x-a_k|^2}$ is not a trivial issue. In principle, the more singular poles are, the less the Hardy constant is: it is…

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A.…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by $\mathcal{P}_2(a,q)$ the least almost-prime…