Deleting digits
Number Theory
2018-03-12 v3 Combinatorics
Abstract
In 2000, J. Shallit introduced a special partial ordering of a subset of positive integers and proposed the problem of finding the set of minimal elements with respect to this ordering. Shallit himself solved this problem for the set of primes and also for the set of composite numbers. In this recreational mathematics note, we compute the minimal sets of a few other arithmetically interesting sets and discuss questions on size and shape of minimal sets in general.
Cite
@article{arxiv.1607.01548,
title = {Deleting digits},
author = {Ioulia N. Baoulina and Martin Kreh and Jörn Steuding},
journal= {arXiv preprint arXiv:1607.01548},
year = {2018}
}
Comments
8 pages; corrections in Theorem 5 and its proof