On primitive weird numbers of the form $2^k p q$
Douglas E. Iannucci

TL;DR
This paper classifies all primitive weird numbers of the form 2^k p q with p<q primes for 1≤k≤14, expanding the known set of such numbers and providing a comprehensive analysis of their structure.
Contribution
It systematically finds all primitive weird numbers of the form 2^k p q for specified k and introduces new larger primitive weird numbers of this form.
Findings
Complete classification for 1≤k≤14
Discovery of larger primitive weird numbers
Expanded the known set of primitive weird numbers
Abstract
We say a natural number~ is abundant if , where denotes the sum of the divisors of~. The aliquot parts of~ are those divisors less than~, and we say that an abundant number~ is pseudoperfect if there is some subset of the aliquot parts of~ which sum to~. We say~ is weird if~ is abundant but not pseudoperfect. We call a weird number~ primitive if none of its aliquot parts are weird. We find all primitive weird numbers of the form ( being odd primes) for . We also find primitive weird numbers of the same form, larger than any previously published.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Coding theory and cryptography · Analytic Number Theory Research
