Related papers: Prime avoiding numbers is a basis of order $2$

In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of…

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H…

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

In this report we present an off-the-number-line representation of the positive integers by expressing each integer by its unique prime signature as a grid point of an infinite dimensional space indexed by the prime numbers, which we term…

A natural number $n$ is called semi-prime if it is a product of two primes or a square of a prime. We denote $\mathbb{P}_2$ the set of all semi-primes. Our goal is to prove that for fixed integer number $a$ and sufficiently large $x$ the…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

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…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…