In number theory, a weird number is a natural number that is abundant but not semiperfect. In other words, the sum of the proper divisors (divisors including 1 but not itself) of the number is greater than the number, but no subset of those divisors sums to the number itself.
The smallest weird number is 70. Its proper divisors are 1, 2, 5, 7, 10, 14, and 35; these sum to 74, but no subset of these sums to 70. The number 12, for example, is abundant but not weird, because the proper divisors of 12 are 1, 2, 3, 4, and 6, which sum to 16; but 2+4+6 = 12.
The first few weird numbers are
|Are there any odd weird numbers?|
It is not known if any odd weird numbers exist; if any do, they must be greater than 232 ≈ 4×109.
Sidney Kravitz has shown that for k a positive integer, Q a prime exceeding 2k, and
also prime and greater than 2k, then
is a weird number. With this formula, he found a large weird number
- Benkoski, Stan (Aug.-September 1972). "E2308 (in Problems and Solutions)". The American Mathematical Monthly 79 (7): 774. doi:10.2307/2316276. JSTOR 2316276.
- Richard K. Guy (2004). Unsolved Problems in Number Theory. Springer-Verlag. ISBN 0-387-20860-7. OCLC 54611248. Section B2.
- Benkoski, Stan; Paul Erdős (April 1974). "On Weird and Pseudoperfect Numbers". Mathematics of Computation 28 (126): 617–623. doi:10.2307/2005938. MR 347726. Zbl 0279.10005.
- CN Friedman, "Sums of Divisors and Egyptian Fractions", Journal of Number Theory (1993). The result is attributed to "M. Mossinghoff at University of Texas - Austin".
- Kravitz, Sidney (1976). "A search for large weird numbers". Journal of Recreational Mathematics (Baywood Publishing) 9 (2): 82–85. Zbl 0365.10003.