Related papers: A logarithmic inequality involving prime numbers

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

We prove a Liouville type theorem for the linearly perturbed Paneitz equation: For $\epsilon>0$ small enough, if $u_\epsilon$ is a positive smooth solution of $$P_{S^3} u_\epsilon+\epsilon u_\epsilon=-u_\epsilon^{-7} \qquad…

Representative examples of our results are as follows. For any positive integer $N$ the equation $$ x^3+y^3=z^3+t^3, \quad x,y,z,t\in \mathbb{N}, \quad \{x,y\}\not=\{z,t\} $$ has no solutions satisfying $$ N\le x,y,z,t <…

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

We prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…

In this paper we show that for some constant $c>0$ and for any $A>0$ there exist some $x(A)>0$ such that, If $q\leq (\log x)^{A}$ then we have \begin{align} \Psi_z(x;\mathcal{N}_q(a,b),q) &= \frac{\Theta (z)}{2\phi(q)}x +…

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard and requires…

Let $p$ be a prime and $p_1,\ldots, p_r$ be distinct prime divisors of $p-1$. We prove that the smallest positive integer $n$ which is a simultaneous $p_1,\ldots,p_r$-power nonresidue modulo $p$ satisfies $$ n<p^{1/4 -…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…

This article concerns with the existence of multiple positive solutions for the following logarithmic Schr\"{o}dinger equation $$ \left\{ \begin{array}{lc} -{\epsilon}^2\Delta u+ V(x)u=u \log u^2, & \mbox{in} \quad \mathbb{R}^{N}, \\…

Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…

Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…

The main purpose of this paper is to show that there exists a positive number $\lambda_{1}$, the first eigenvalue, such that some $p(x)$-Laplace equation admits a solution if $\lambda=\lambda_{1}$ and that $\lambda_{1}$ is simple, i.e.,…

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

Let $1<k<7/6$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

Let a1,..., a9 be non-zero integers and n any integer. Suppose that a1 + ... + a9 = n (mod 2) and (ai, aj) = 1 for 1 <= i < j <= 9. We will prove that (i) if not all of the aj's are of the same sign, then the cubic diagonal equation a1p1^3…

For each positive integer $n$, we denote by $\omega^*(n)$ the number of shifted-prime divisors $p-1$ of $n$, i.e., \[\omega^*(n):=\sum_{p-1\mid n}1.\] First introduced by Prachar in 1955, this function has interesting applications in…

We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…