On primitive weird numbers of the form 2k p q

Abstract

We say a natural number~n is abundant if σ(n)>2n, where σ(n) denotes the sum of the divisors of~n. The aliquot parts of~n are those divisors less than~n, and we say that an abundant number~n is pseudoperfect if there is some subset of the aliquot parts of~n which sum to~n. We say~n is weird if~n is abundant but not pseudoperfect. We call a weird number~n primitive if none of its aliquot parts are weird. We find all primitive weird numbers of the form 2kpq (p<q being odd primes) for 1 k14. We also find primitive weird numbers of the same form, larger than any previously published.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…