Related papers: Prime numbers with Beatty sequences

The number of primes of a kind x^2+1 is infinite.

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…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

For all $\alpha_1,\alpha_2\in(1,2)$ with $1/\alpha_1+1/\alpha_2>5/3$, we show that the number of pairs $(n_1,n_2)$ of positive integers with $N=\lfloor{n_1^{\alpha_1}}\rfloor+\lfloor{n_2^{\alpha_2}}\rfloor$ is equal to…

Let $(q_{\alpha, n})_{n \geq 0}$ be the sequence of convergent denominators to the simple continued fraction expansion of $\alpha$. For certain specific choices of $\alpha$, this sequence is a Lehmer sequence. In this paper, we show that…

Write $\mathrm{ord}_p(\cdot)$ for the multiplicative order in $\mathbb{F}_p^{\times}$. Recently, Matthew Just and the second author investigated the problem of classifying pairs $\alpha, \beta \in \mathbb{Q}^{\times}\setminus\{\pm 1\}$ for…

We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result:…

In this work in progress, we study the asymptotic behaviour of the $p$-quantile of the Beta distribution, i.e. the quantity $q$ defined implicitly by $\int_0^q t^{a - 1} (1 - t)^{b - 1} \text{d} t = p B (a, b)$, as a function of the first…

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

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 2016, in the work related to Galois representations, Greenberg conjectured the existence of multi-quadratic $p$-rational number fields of degree $2^{t}$ for any odd prime number $p$ and any integer $t \geq 1$. Using the criteria provided…

Assume that $\lambda_1, \lambda_2, \lambda_3,\lambda_4,\lambda_5,\lambda_6,\lambda_7$ are non-zero real numbers , $\lambda_1/\lambda_2$ is an irrational number. Let $\mathcal{V} $ be a well-spaced sequence, and $\delta >0$. For any given…

We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.

We introduce the \emph{Parry order} $\mathrm{Ord}_P(\beta)$, defined as the largest integer $n$ for which $\beta^n$ is a Parry number. This leads to a natural partition of the set of Perron numbers as follows: \[ \mathcal{P} = \left(…

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…

Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…

In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…

Imagine that there are two bins to which balls are added sequentially, and each incoming ball joins a bin with probability proportional to the p-th power of the number of balls already there. A general result says that if p>1/2, there…

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

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…