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

Continuum Mapping and S-base 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-base Space Solution to Coin Weighing Problem. Preprints 2023, 2023050825. https://doi.org/10.20944/preprints202305.0825.v3 Chen, L. Continuum Mapping and S-base Space Solution to Coin Weighing Problem. Preprints 2023, 2023050825. https://doi.org/10.20944/preprints202305.0825.v3

Abstract

A problem involving the government's inspection of coins in Lower Slobbovia is discussed in the American Mathematical Monthly. It is desirable to classify and correct counterfeit coins by utilizing the fewest possible measures. However, previous 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-base space.Finally, possible applications of this mathematical approach in gene mutation detection are also presented.

Keywords

Inspection of coins; Continuum mappings; S-base space

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (1)

Comment 1
Received: 22 May 2023
Commenter: Lizichen Chen
Commenter's Conflict of Interests: Author
Comment: 1.Added a method to further improve computational efficiency, discarding the original logarithmic estimation.
2.The core problem for the final solution of this problem is presented, which involves the decomposition of large prime factors.
3.Added some proofs involving theorems of number theory.
+ Respond to this comment

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 1
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.