Related papers: Conjectures on representations involving primes
In this paper, we use the transference principle to investigate the representation of sufficiently large positive integers as the sum of prime powers and integer powers, where the primes are drawn from a positive density subset of the set…
Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…
Given a graph $G=(V,E)$ with $V=\{1,2,...,k\}$, the $k$ positive integers $a_1,a_2, ...,a_k$ are $G$-wise relatively prime if $(a_i, a_j)=1$ for $\{i,j\} \in E$. In this note we consider the problem of finding the probability $A_G$ that k…
Consider the operation of adding the same number of identical digits to the left and to the right of a number n. In OEIS sequence A090287, it was conjectured that this operation will not produce a prime if and only if n is a palindrome with…
The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.
The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…
Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…
This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles and their geometric interpretation. In addition to the well-known fact that the hypotenuse, z, of a right triangle, with sides of integral…
Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…
Making use of covering systems and a theorem of D. Shiu, the first and second authors showed that for every positive integer $k$, there exist $k$ consecutive widely digitally delicate primes. They also noted that for every positive integer…
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…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
Let $k \ge 2$ and $\alpha_1, \beta_1, ..., \alpha_k, \beta_k$ be reals such that the $\alpha_i$'s are irrational and greater than 1. Suppose further that some ratio $\alpha_i/\alpha_j$ is irrational. We study the representations of an…
The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(\pi(R_n))_{n \in \mathbb{N}}$, which…
I give some claims on primorial prime numbers for interested readers in number theory.
We prove that for any positive integer c and any s > 0 there are representations of c as a sum a+b of two coprime positive integers a, b, such that the respective radicals are all greater than K(s)R(c)^(1-s)c^2. For the reprasentations in…