Related papers: Carryless Arithmetic Mod 10

We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…

We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

According to a popular belief, the decimal digits of mathematical constants such as {\pi} behave like statistically independent random variables, each taking the values 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 with equal probability of 1/10. If…

Tao has shown that in any fixed base, a positive proportion of prime numbers cannot have any digit changed and remain prime. In other words, most primes are "digitally delicate". We strengthen this result in a manner suggested by Tao: A…

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…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…

It is known that prime numbers occupy specific geometrical patterns or moduli when numbers from one to infinity are distributed around polygons having sides that are integer multiple of number 6. In this paper, we will show that not only…

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…

We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.

The notion of chiral prime concatenations is studied as a recursive construction of prime numbers starting from a seed set and with appropriate blocks to define the primality growth, generation by generation, either from the right or from…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

Let $\ell \geq 5$ be a prime and let $N$ be a square-free integer prime to $\ell$. For each prime $p$ dividing $N$, let $a_p$ be either $1$ or $-1$. We give sufficient criteria for the existence of a newform $f$ of weight 2 for…

Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…

We find asymptotics for $S_{K,c}(x)$, the number of positive integers below $x$ whose number of prime factors is $c \; \mathrm{mod}\; K$. We study this question in the context of Beurling integers.