Related papers: Some Notes on Digit Strings in the Primes
Recently, there has been a sharp rise of interest in properties of digits primes. Here we study yet another question of this kind. Namely, we fix an integer base $g \ge 2$ and then for every infinite sequence $${\mathcal D} =…
We show any power of five may be expressed arithmetically with the digits of its decimal representation. We also show powers of five (in decimal) contain any amount of zeros in a row.
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…
We prove a prime number theorem first for the classical Rankin-Selberg L-function $L(s,\pi\times\pi')$ over any Galois extension with $\pi$ and $\pi'$ unitary automorphic cuspidal representations of $GL_n$ and $GL_m$ respectively with at…
The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…
Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…
We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…
We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…
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…
In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter. As an example, we present a lower bound on signed domination number of trees in terms of the order, leaves and…
Given a prime number $l$ and a finite set of integers $S=\{a_1,...,a_m\}$ we find out the exact degree of the extension $\mathbb{Q}(a_1^{\frac{1}{l}},...,a_m^{\frac{1}{l}})/\mathbb{Q}$. We give an algorithm to compute this degree and then…
Let $k$ be a number field and $S$ a finite set of places of $k$ containing the archimedean ones. We count the number of algebraic points of bounded height whose coordinates lie in the ring of $S$-integers of $k$. Moreover, we give an…
We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…
As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm L}_n(q)$ is prime. We present…
A modified Lagrange Polynomial is introduced for polynomial extrapolation, which can be used to estimate the equally spaced values of a polynomial function. As an example of its application, this article presents a prime-generating…
We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…
This paper investigates the length of the repeating decimal part when a fraction is expressed in decimal form. First, it provides a detailed explanation of how to calculate the length of the repeating decimal when the denominator of the…