A Fowler-Nordheim Integrator can Track the Density of Prime Numbers

11/24/2017
by   Liang Zhou, et al.
0

"Does there exist a naturally occurring counting device that might elucidate the hidden structure of prime numbers ?" is a question that has fascinated computer scientists and mathematical physicists for decades. While most recent research in this area have explored the role of the Riemann zeta-function in different formulations of statistical mechanics, condensed matter physics and quantum chaotic systems, the resulting devices (quantum or classical) have only existed in theory or the fabrication of the device has been found to be not scalable to large prime numbers. Here we report for the first time that any hypothetical prime number generator, to our knowledge, has to be a special case of a dynamical system that is governed by the physics of Fowler-Nordheim (FN) quantum-tunneling. In this paper we report how such a dynamical system can be implemented using a counting process that naturally arises from sequential FN tunneling and integration of electrons on a floating-gate (FG) device. The self-compensating physics of the FG device makes the operation reliable and repeatable even when tunneling-currents approach levels below 1 attoamperes. We report measured results from different variants of fabricated prototypes, each of which shows an excellent match with the asymptotic prime number statistics. We also report similarities between the spectral signatures produced by the FN device and the spectral statistics of a hypothetical prime number sequence generator. We believe that the proposed floating-gate device could have future implications in understanding the process that generates prime numbers with applications in security and authentication.

READ FULL TEXT

page 1

page 18

page 20

page 21

page 22

research
05/24/2022

All Prime Numbers Have Primitive Roots

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under mult...
research
02/23/2018

Counting Extended Irreducible Goppa Codes

We obtain an upper bound on the number of extended irreducible q-ary Gop...
research
08/15/2023

Quantum and Classical Combinatorial Optimizations Applied to Lattice-Based Factorization

The availability of working quantum computers has led to several proposa...
research
05/25/2019

Counting Homomorphisms Modulo a Prime Number

Counting problems in general and counting graph homomorphisms in particu...
research
11/09/2020

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order

We study the problem of counting the number of homomorphisms from an inp...
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
11/24/2018

Three Euler's Sieves and a Fast Prime Generator (Functional Pearl)

The Euler's Sieve refines the Sieve of Eratosthenes to compute prime num...

Please sign up or login with your details

Forgot password? Click here to reset