Artwell Ncube | UNISA - Academia.edu (original) (raw)

Artwell Ncube

태형 박 related author profile picture

Syra Mae Capoquian related author profile picture

Alan Bertossi related author profile picture

Gennadi  Malaschonok related author profile picture

Mingji Li related author profile picture

Seamus O'Shea related author profile picture

David Saunders related author profile picture

Koichi  Wada related author profile picture

Reiner Creutzburg related author profile picture

Stan Wagon related author profile picture

Uploads

Papers by Artwell Ncube

Research paper thumbnail of Prime numbers demystified

The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about... more The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about prime numbers. All the numerous arithmetic series patterns observed between various prime numbers are clearly explained with an elegant "pattern of remainders". With this algorithm we prove that odd numbers too can make an Ulam spiral contrary to current ""proofs". At the end of the paper this author proves the relationship between a simple arithmetic series pattern and the Riehmann's prime numbers distribution equation. This paper would be important for encryption too. As an example, prime integer 1979 is expressed as 1.2.4.5.10.3.7.3.1.7.26.18.11.1. This makes even smaller primes useful for encryption as well.

Research paper thumbnail of Prime numbers demystified

Research paper thumbnail of Prime numbers demystified

The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about... more The paper is the ultimate prime numbers algorithm that gets rid of the unneccessary mystery about prime numbers. All the numerous arithmetic series patterns observed between various prime numbers are clearly explained with an elegant "pattern of remainders". With this algorithm we prove that odd numbers too can make an Ulam spiral contrary to current ""proofs". At the end of the paper this author proves the relationship between a simple arithmetic series pattern and the Riehmann's prime numbers distribution equation. This paper would be important for encryption too. As an example, prime integer 1979 is expressed as 1.2.4.5.10.3.7.3.1.7.26.18.11.1. This makes even smaller primes useful for encryption as well.

Research paper thumbnail of Prime numbers demystified

Log In