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 . We also searched up to for numbers with an abundance below , 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.