The Grand Algorithm: A mersenne determinate algorithm

By Mr Thomas O'Neil

Dear readers, This algorithm which I apply call The Grand Algorithm has been a life long pursuit of mine since I became involved with computers in the mid 1990's. There is a site which finds large Mersenne Primes named Gimps online. Yet the process of finding Mersenne primes through long trial factorization is a nightmare. Inside this book there is included two modules of python code. The first script is the Mersenne Determinate code and the second module is the Perfect Numbers code. Please download the Python shell; its free if you plan on using the code. If you check the code and type it correctly the numbers will role off at break neck speed. What you see is what you get, basically input and output. Is this statement true or is it an old adage for garbage in garbage out and do the results meet our expectations from cause and effect? We all utilize algorithms whether we know it or not. Bees with a brain the size of a pea utilize the "traveling sales man algorithm" which our computers devote many resources to figuring out. If you cook yes you use algorithms. So what is an algorithm? My simple definition is, "A procedure or steps which meet and end result." Most everything we do as humans require decisions and these choices effect the outcomes. In this book I will go on to describe my interest with Prime Numbers and what drove me to develop an algorithm which completely finds the true output of a Mersenne Prime Number A Mersenne prime is a perfect number where it can only be divided by 1 and itself. A mini-algorithm proves this to be true, 2 p-1, yet try doing this with pen and paper and you find with very large numbers you could take forever to find one guess for a prime number.

• Format: Paperback
• Language: English
• ISBN: 1717420095
• ISBN13: 9781717420091
• Release Date: April 2018
• Publisher: Createspace Independent Publishing Platform
• Length: 322 Pages
• Weight: 2.28 lbs.
• Dimensions: 0.8" x 8.5" x 11.0"