mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Math (https://www.mersenneforum.org/forumdisplay.php?f=8)
-   -   2x-1 (https://www.mersenneforum.org/showthread.php?t=3486)

clowns789 2004-12-31 04:45

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!

jinydu 2004-12-31 05:44

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

[url]http://mathworld.wolfram.com/OddPerfectNumber.html[/url]

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

TTn 2004-12-31 16:45

coded
 
Try hunting for Semi-Perfect numbers.
All OPN, are semi-perfect.
Not all semi-perfect are OPN.
[url]http://mathworld.wolfram.com/SemiperfectNumber.html[/url]
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=jinydu][url]http://mathworld.wolfram.com/OddPerfectNumber.html[/url][/QUOTE]
That article mentions mersenneforum.org, a reference to this thread: [url]http://www.mersenneforum.org/showthread.php?t=3101[/url].

Xyzzy 2005-01-02 02:50

[QUOTE=geoff]That article mentions mersenneforum.org, a reference to this thread: [url]http://www.mersenneforum.org/showthread.php?t=3101[/url].[/QUOTE]Neato!

:smile:

Crook 2005-01-14 15:38

[QUOTE=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![/QUOTE]

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

greetings


All times are UTC. The time now is 10:37.

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