Papers
Topics
Authors
Recent
Search
2000 character limit reached

On primitive weird numbers of the form $2^k p q$

Published 7 Apr 2015 in math.NT | (1504.02761v1)

Abstract: We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(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\le k\le14$. We also find primitive weird numbers of the same form, larger than any previously published.

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.

Collections

Sign up for free to add this paper to one or more collections.