Preprint Short Note Version 1 Preserved in Portico This version is not peer-reviewed

Continuum Mapping and S-binary Space Solution to Coin Weighing Problem

Version 1 : Received: 10 May 2023 / Approved: 11 May 2023 / Online: 11 May 2023 (08:41:46 CEST)
Version 2 : Received: 16 May 2023 / Approved: 17 May 2023 / Online: 17 May 2023 (10:46:44 CEST)
Version 3 : Received: 20 May 2023 / Approved: 22 May 2023 / Online: 22 May 2023 (13:34:58 CEST)
Version 4 : Received: 9 September 2023 / Approved: 11 September 2023 / Online: 12 September 2023 (05:00:39 CEST)

How to cite: Chen, L. Continuum Mapping and S-binary Space Solution to Coin Weighing Problem. Preprints 2023, 2023050825. https://doi.org/10.20944/preprints202305.0825.v1 Chen, L. Continuum Mapping and S-binary Space Solution to Coin Weighing Problem. Preprints 2023, 2023050825. https://doi.org/10.20944/preprints202305.0825.v1

Abstract

In the American Mathematical Monthly there is a problem that related to the governmental inspection of coins in the Lower Slobbovia, where it is desirable to classify and correct counterfeit coins by using a minimum number of measurements, but the article only proves the existence of the solution, which does not give a practical solution to the problem. In this article, we provide an effective method to achieve the identification of coin heaps using Dirac delta functions, Singularity functions and their selectivity, unit-order construction of continuum mappings and construction of discretization of unique basis vectors without attempted expansions in S-binary space.

Keywords

Inspection of coins; Continuum mappings; S-binary space

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.