Deleting digits
classification
🧮 math.NT
math.CO
keywords
minimalsetsorderingproblemshallitarithmeticallycompositecompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.