Natural Wave Numbers, Natural Wave Co-numbers, and the Computation of the Primes

The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number u_n is the countable sequence of the nth roots of unity having frequencies k/n for all integer phases k. The space U is closed under a commutative and associative binary operation u_m ⊙ u_n= u_mn, termed the circular product, and is isomorphic with N under their respective product operators. Functions are defined on U that partition wave numbers into two complementary sequences, of which the co-number ∗ u_n is a function of a wave number in which zeros replace its positive roots of unity. The recursive procedure ∗ U_N+1= ∗ U_N⊙∗ u_N+1 represents prime numbers explicitly in terms of preceding prime numbers, starting with p_1=2, and is shown never to terminate. If p_1, ... , p_N+1 are the first N+1 prime phases, then the phases in the range p_N+1≤ k < p^2_N+1 that are associated with the non-zero terms of ∗ U_N are, together with p_1, ...,p_N, all of the prime phases less than p^2_N+1. When applied with all of the primes identified at the previous step, the recursive procedure identifies approximately 7^2(N-1)/(2(N-1)ln7) primes at each iteration for N>1. When the phases of wave numbers are represented in modular arithmetic, the prime phases are representable in terms of sums of reciprocals of the initial set of prime phases and have a relation with the zeta-function.

research
09/07/2022

Quadratic sequences with prime power discriminators

The discriminator of an integer sequence s = (s(i))_i ≥ 0, introduced by...
research
04/11/2019

On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM)...
research
06/25/2019

Partitioning the Primes and Efficient Non-trivial Factor Generation using the Least Odd Partition Identity in Conjunction with Dirichlet Linear Progressions and the Reduced Res

In this work we introduce the numerical constant, LOPI, N LOPI is congru...
research
11/25/2019

BiEntropy, TriEntropy and Primality

The order and disorder of binary representations of the natural numbers ...
research
01/17/2022

On digital sequences associated with Pascal's triangle

We consider the sequence of integers whose nth term has base-p expansion...
research
08/09/2018

Hardware realization of residue number system algorithms by Boolean functions minimization

Residue number systems (RNS) represent numbers by their remainders modul...
research
05/23/2011

A Tool for Integer Homology Computation: Lambda-At Model

In this paper, we formalize the notion of lambda-AT-model (where λ is a ...