Related papers: Primes in the form $[\alpha p+\beta]$

We show that whenever $\delta>0$, $\eta$ is real and constants $\lambda_i$ satisfy some necessary conditions, there are infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying the inequality $|\lambda_1p_1 + \lambda_2p_2 +…

For a bounded measurable set $A\subseteq \mathbb{R}$ we denote the Lebesgue measure of $\{(x, y)\in A^2\colon x\le y\le x+1\}$ by $\Phi(A)$. We prove that if $I=A_1\cup\dots\cup A_{k+1}$ partitions an interval $I$ of length $L$ into $k+1$…

Schinzel and W\'ojcik have shown that if $\alpha, \beta$ are rational numbers not $0$ or $\pm 1$, then $\mathrm{ord}_p(\alpha)=\mathrm{ord}_p(\beta)$ for infinitely many primes $p$, where $\mathrm{ord}_p(\cdot)$ denotes the order in…

We produce an infinite family of transcendental numbers which, when raised to their own power, become rational. We extend the method, to investigate positive rational solutions to the equation $x^x = \alpha$, where $\alpha$ is a fixed…

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…

Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…

Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. We denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…

Let $H$ be a commutative multiplicative hyperring and $\alpha, \beta \in \mathbb{Z}^+$. A proper hyperideal $P$ of $H$ is called (weakly) $(\alpha,\beta)$-prime if $x^\alpha \circ y \subseteq P$ for $x,y \in H$ implies $x^\beta \subseteq P$…

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

For $p$ prime, $A \subseteq \mathbb{Z}/p\mathbb{Z}$ and $\lambda \in \mathbb{Z}$, the sum of dilates $A + \lambda \cdot A$ is defined by \[A + \lambda \cdot A = \{a + \lambda a' : a, a' \in A\}.\] The basic problem on such sums of dilates…

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

Let $p$ be a prime number. For a positive integer $n$ and a real number $\xi$, let $\lambda_n (\xi)$ denote the supremum of the real numbers $\lambda$ for which there are infinitely many integer tuples $(x_0, x_1, \ldots , x_n)$ such that…

Let $k \geq 3$ and let $L_i(n) = A_in + B_i$ be some linear forms such that $A_i$ and $B_i$ are integers. Define ${\mathcal{P}(n) = \prod_{i=1}^k L_i(n)}$. For each $k$ it is known that $\Omega (\mathcal{P} (n) ) \leq \rho_k$ infinitely…

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…