Related papers: On an equation by primes with one Linnik prime

Let $X$ be a positive integer and $t$ a real number great than 1. The family of sets $\left\{\big\lfloor\frac{X}{n^t}\big\rfloor ~:~ 1\leq n\leq X\right\}$ have an interesting prime distribution property. We give an exact formula for the…

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).

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$

Let $d(n)$ be the divisor function and denote by $[t]$ the integral part of the real number $t$. In this paper, we prove that $$\sum_{n\leq x^{1/c}}d\left(\left[\frac{x}{n^c}\right]\right)=d_cx^{1/c}+\mathcal{O}_{\varepsilon,c}…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

Wright proved that there exists a number $c$ such that if $g_0 = c$ and $g_{n+1} = 2^{g_n}$, then $\lfloor g_n \rfloor$ is prime for all $n > 0$. Wright gave $c = 1.9287800$ as an example. This value of $c$ produces three primes, $\lfloor…

We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

Let $r_Q(n)$ be the representation number of a nonnegative integer $n$ by the quaternary quadratic form $Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$. We first prove the identity $r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$ for any prime $p$…

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

In this paper, we give a short and entirely elementary proof of the proposition ``For any positive integer $ N $, there exists a real number $ L $ such that for any real number $ x \geqq L $, there are at least $ N $ primes in the interval…

We consider various arithmetic questions for the Piatetski-Shapiro sequences $\fl{n^c}$ ($n=1,2,3,...$) with $c>1$, $c\not\in\N$. We exhibit a positive function $\theta(c)$ with the property that the largest prime factor of $\fl{n^c}$…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

In 2013, Farhi conjectured that for each $m\geq 3$, every natural number $n$ can be represented as $\lfloor x^2/m\rfloor+\lfloor y^2/m\rfloor+\lfloor z^2/m\rfloor$ with $x,y,z\in\Z$, where $\lfloor\cdot\rfloor$ denotes the floor function.…