A NEW, MORE FRUITFUL, DETERMINATION OF THE METRIC (DISTANCE) IN A SET OF FINITE SETS, AND A METRIC CRITERION FOR THE SIMPLICITY OF A NATURAL NUMBER
Keywords:
set, finite set, discrete set, distance, metric, Hamming distance, metric space, discrete metric space, number theory.Abstract
In this paper, we introduce a new, previously unknown, distance (i.e., a new metric) in a set whose elements are some other (any) finite sets. It is proved that with such a metric the set under consideration is a metric space. A direct relationship is established between this distance and the Hamming distance: it is exactly two times smaller than the Hamming distance and it is much easier to calculate it. As an application, the set of natural numbers is considered as a discrete metric space with a new metric introduced, and a new metric criterion for the simplicity of a natural number is established. This is the first metric criterion for the simplicity of a natural number in the history of mathematics.
Downloads
References
R.W. Hamming. Coding theory and information theory: Translated from English. – Moscow, “Radio and communication”, 1983. – 176 p.
(Р. В. Хэмминг. Теория кодирования и теория информации: Пер. с англ. – Москва, “Радио и связь”, 1983. – 176 с)
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (CC-BY 4.0). Under this license:
- Share: Copy and redistribute the material in any medium or format
- Adapt: Remix, transform, and build upon the material for any purpose, including commercially
Attribution required: You must give appropriate credit, provide a link to the license, and indicate if changes were made.
License URL: https://creativecommons.org/licenses/by/4.0/
Authors retain copyright of their work while granting the journal first publication rights.
