On the Universal Encoding Optimality of Primes

Ioannis N. M. Papadakis
Additional contact information
Ioannis N. M. Papadakis: Independent Researcher, Charlotte, NC 28226, USA

Mathematics, 2021, vol. 9, issue 24, 1-14

Abstract: The factorial-additive optimality of primes, i.e., that the sum of prime factors is always minimum, implies that prime numbers are a solution to an integer linear programming (ILP) encoding optimization problem. The summative optimality of primes follows from Goldbach’s conjecture, and is viewed as an upper efficiency limit for encoding any integer with the fewest possible additions. A consequence of the above is that primes optimally encode —multiplicatively and additively—all integers. Thus, the set P of primes is the unique, irreducible subset of ℤ—in cardinality and values —that optimally encodes all numbers in ℤ, in a factorial and summative sense. Based on these dual irreducibility/optimality properties of P, we conclude that primes are characterized by a universal “ quantum type ” encoding optimality that also extends to non-integers.

Keywords: prime number; prime factor; factorization; optimization; integer programming; ILP; Goldbach conjecture; encoding; cryptography; quantum (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/24/3155/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/24/3155/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:24:p:3155-:d:697172

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().