2x-1

clowns789 · 2004-12-31, 04:45

I ws wondering if anyone was interested in this. I could find odd perfect numbers using the 2x-1 formula (which yields every odd number) and start at the lowest x over 10^300 ((10^300)+1 is the lowest possible OPN) using a software made by me or possibly someone else or we find bugs as a team or whatever comes to mind. It will have a worktodo with x=whatever or a range. It will find all factors of the number and if it has at least 47 factors it will add them up to see if it is equal to the number being tested. If so, we found an OPN!

jinydu · 2004-12-31, 05:44

There are some other restrictions you can make to narrow the search.

http://mathworld.wolfram.com/OddPerfectNumber.html

Don't worry, that article is mostly easy to read.

2004-12-31, 16:45

Try hunting for Semi-Perfect numbers.
All OPN, are semi-perfect.
Not all semi-perfect are OPN.
http://mathworld.wolfram.com/SemiperfectNumber.html
In particular, those that are the sum of most of their factors.
Use RMA to find General Mersenne prime numbers.
Then use that as your prime factor.

The full version of RMA, includes the option to view, semi-perfect numbers, from your prime file. This could narrow your search.

geoff · 2005-01-01, 12:51

Quote:

Originally Posted by jinydu

http://mathworld.wolfram.com/OddPerfectNumber.html

That article mentions mersenneforum.org, a reference to this thread: http://www.mersenneforum.org/showthread.php?t=3101.

Xyzzy · 2005-01-02, 02:50

Quote:

Originally Posted by geoff

That article mentions mersenneforum.org, a reference to this thread: http://www.mersenneforum.org/showthread.php?t=3101.

Neato!

Crook · 2005-01-14, 15:38

Quote:

Originally Posted by clowns789

I ws wondering if anyone was interested in this. I could find odd perfect numbers using the 2x-1 formula (which yields every odd number) and start at the lowest x over 10^300 ((10^300)+1 is the lowest possible OPN) using a software made by me or possibly someone else or we find bugs as a team or whatever comes to mind. It will have a worktodo with x=whatever or a range. It will find all factors of the number and if it has at least 47 factors it will add them up to see if it is equal to the number being tested. If so, we found an OPN!

In my humble opinion I think this would be wasted time.. OPN just don't exist. Or at least I think/hope so.

greetings

2004-12-31, 04:45	#1
clowns789 Jun 2003 The Computer 110001000₂ Posts	2x-1 I ws wondering if anyone was interested in this. I could find odd perfect numbers using the 2x-1 formula (which yields every odd number) and start at the lowest x over 10^300 ((10^300)+1 is the lowest possible OPN) using a software made by me or possibly someone else or we find bugs as a team or whatever comes to mind. It will have a worktodo with x=whatever or a range. It will find all factors of the number and if it has at least 47 factors it will add them up to see if it is equal to the number being tested. If so, we found an OPN!

2004-12-31, 05:44	#2
jinydu Dec 2003 Hopefully Near M48 3336₈ Posts	There are some other restrictions you can make to narrow the search. http://mathworld.wolfram.com/OddPerfectNumber.html Don't worry, that article is mostly easy to read. Last fiddled with by jinydu on 2004-12-31 at 05:45

2004-12-31, 16:45	#3
TTn 7887₁₀ Posts	coded Try hunting for Semi-Perfect numbers. All OPN, are semi-perfect. Not all semi-perfect are OPN. http://mathworld.wolfram.com/SemiperfectNumber.html In particular, those that are the sum of most of their factors. Use RMA to find General Mersenne prime numbers. Then use that as your prime factor. The full version of RMA, includes the option to view, semi-perfect numbers, from your prime file. This could narrow your search.