How Can I Find Perfect Numbers Using Matlab and the Mersenne Prime Relationship?

[blgna2]

hey guys anyone reply me the solution for the below problem ASAP.
can i ve a program to find the perfect numbers using this relationship
Mp=2^p-1 where Mp is the mersenne prime and p is the integer and the relationship related to perfect number is n=0.5(Mp+1)Mp=[2^(p-1) ]*((2^p)-1)

 

[robert Ihnot]

Apparently such software for this purpose does exist. http://www.mersenne.org/freesoft.htm I think this is some kind of group effort; you work on little bits of it. The latest find has almost 10,000,000 digits, and this problem has been around for centuries, so you'll be needing a lot of Good Luck!