mersenneforum.org > Math Odd Perfect Numbers
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2003-05-24, 02:57 #1 Zeta-Flux     May 2003 7×13×17 Posts Odd Perfect Numbers I was just wondering if there is any computer program out there that looks for odd perfect numbers. Currently it has been proven that an odd perfect number must have at least 8 prime factors, but this bound could easily be improved with extensive computations. Anyone out there want to write such a program?
 2003-05-28, 19:41 #2 philmoore     "Phil" Sep 2002 Tracktown, U.S.A. 2×13×43 Posts I think this would make an interesting project. The Brent, Cohen, and te Riele paper (reference at http://www.utm.edu/research/primes/references/refs.cgi/BCR91) sketches a proof that any odd perfect number must have at least 8 distinct factors and at least 300 digits. Furthermore, their method of proving this would have discovered such an odd perfect number if one had existed with less than 300 digits. It would be interesting to see how much this bound can be improved with the increase in computing power since then. Since GIMPS can be looked at as the search for even perfect numbers, a search for odd perfect numbers seems a natural complementary project. The beauty of these papers on odd perfect numbers is that they are not extremely technical, and I think most amateur number theorists with only minimal background would be able to understand them.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post mahbel Miscellaneous Math 20 2017-03-01 22:41 Housemouse Math 34 2016-04-07 16:29 davar55 Miscellaneous Math 16 2011-01-29 01:53 jasong Factoring 1 2006-05-14 11:28 MajUSAFRet Math 3 2003-12-13 03:55

All times are UTC. The time now is 08:05.

Tue Jan 19 08:06:00 UTC 2021 up 47 days, 4:17, 0 users, load averages: 2.60, 2.47, 2.19

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.