Related papers: An arithmetical excursion via Stoneham numbers
We describe some studies related to the frequency of prime values of integer polynomials.
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 obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to…
$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…
We establish a local central limit theorem for primitive periodic orbits of expanding Thurston maps, providing a fine-scale refinement of the Prime Orbit Theorem in the context of non-uniformly expanding dynamics. Specifically, we count the…
We use only addition and multiplication to construct the primitive roots of $p^{k+1}$ from the primitive roots of $p^{k}$, where $p$ is an odd prime and $k$ is at least 2.
We prove an asymptotic formula for primes of the shape $f(a,b^2)$ with $a,b$ integers and of the shape $f(a,p^2)$ with $p$ prime. Here $f$ is a binary quadratic form with integer coefficients, irreducible over $\mathbb{Q}$ and has no local…
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…
Sidorov and Vershik showed that in base $G=\frac{\sqrt{5}+1}{2}$ and with the digits $0,1$ the numbers $x=nG ~(\text {mod} 1)$ have $\aleph_{0}$ expansions for any $n\in\mathbb{Z}$, while the other elements of $(0, \frac{1}{G-1})$ have…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
A deep conjecture of Montgomery and Soundararajan on the distribution of prime numbers in short intervals of length $h$ says that the third moment is bounded by $\ll h^{\frac {3}{2}-c}$ for some $c>0$. There is in the literature some…
We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…
For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…
We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…
We defined numbers of the form $p\cdot a^2$ as SP numbers (Square-Prime numbers) ($a\neq1$, $p$ prime) in the paper 'Distribution of Square-Prime numbers' (arXiv:2109.10238) along with proofs on their distribution. Some examples of SP…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…