Papers
Topics
Authors
Recent
Search
2000 character limit reached

Searching on the boundary of abundance for odd weird numbers

Published 26 Jul 2022 in math.NT and cs.DM | (2207.12906v1)

Abstract: Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which shows their non-existence up to 102110^{21}. We also searched up to 102810^{28} for numbers with an abundance below 101410^{14}, to no avail. Our approach to speed up the search can be viewed as an application of reverse search in the domain of combinatorial optimization, and may be useful for other similar quest for natural numbers with special properties that depend crucially on their factorization.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.