Related papers: How Prime Factors Form Fractals
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…
In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…
The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…
For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…
Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…
This article describes a new method of producing space filling fractal dragon curves based on a hinged tiling procedure. The fractals produced can be generated by a simple L-system. The construction as a hinged tiling has the advantage of…
An elementary method for computing various prime sequences using the sequence of Farey sequences is described.
Fractals are ubiquitous natural emergences that have gained increased attention in engineering applications, thanks to recent technological advancements enabling the fabrication of structures spanning across many spatial scales. We show how…
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken…
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 $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…
In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
Let p(n) be the nth prime and p(p(n)) be the nth prime-indexed prime (PIP). The process of taking prime-indexed subsequences of primes can be iterated, and the number of such iterations is the prime-index order. We report empirical evidence…
The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…
In 1970, Davis and Knuth introduced the concept of revolving sequences to represent Gaussian integers. Much later, Kawamura and Allen recently generalized this idea to a wider class of revolving sequences that parametrize certain…