English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We show that if you represent all primes with less than n-digits as points inn-dimensional space, then they can be stored and retrieved conveniently usingn-dimensional geometry. Also once you have calculated all the prime numbersless than n digits, it is very easy to find out if a given number having lessthan n-digits is or is not a prime. We do this by separating all the primeswhich are represented by points in n-dimension space by planes. It so turns outthat the number of planes q, required to separate all the points represented byprimes less than n-digit, are very few in number. Thus we obtain a veryefficient storage and retrieval system in n-dimensional space. In addition thestorage and retieval repository has the property that when new primes are addedthere is no need to start all over, we can begin where we last left off and addthe new primes in the repository and add new planes that separate them as andwhen necessary. Also we can arrange matters such that the repository can beginto accept larger primes which has more digits say n' where n' > n. Thealgorithm does not make use of any property of prime numbers or of integers ingeneral,except for the fact that any n-digit integer can be represented as apoint in n-dimension space. Therefore the method can serve to be a storage andretrieval repository of any set of given integers, in practical cases they canrepresent information. Thus the algorithm can be used to devise a veryefficient storage and retrieval system for large amounts of digital data.

On the storage and retrieval of primes and other random numbers using n-dimensional geometry