Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2010-01-06, 21:58   #1
sascha77's Avatar
Jan 2010

2×13 Posts
Default conjecture about mersenne numbers


My conjecture is :

Let 2^p-1 be an Mersenne-number, and
a is an element from 2^p-1

(1)\:\: a^{(p*p)} \equiv 1\: (mod\: 2^p-1)

(2)\:\: a^{p} \equiv 1\: (mod \: 2^p-1)

(1) --> (2)

This means, that if (1) is true, than is (2) also true.

It is easy to show that ?

My idea to do this with 2^p-1 is prime, was the following:

a^{pp}  \equiv 1

a^{p}   \equiv \sqrt[p]{1}

When 2^p-1 is prime, when the Elements with the form
2^x are the only ones, that have order of p

and therefore:
a^p   \equiv \sqrt[p]{1} \equiv 2^x

a \equiv \sqrt[p]{2^x}

- But the only solution to this is 1:
a \equiv \sqrt[p]{2^x}\equiv 1

a \equiv 1

-> So  pp can not be the order of a, because a is 1.

I have searched with google many sites, but could not find the answer to
this "problem".

I hope that anybody can help me with the conjecture.

kind regards,

sascha77 is offline   Reply With Quote
Old 2010-01-07, 07:20   #2
gd_barnes's Avatar
May 2007
Kansas; USA

33·17·23 Posts

This should be posted in the GIMPS forum.
gd_barnes is online now   Reply With Quote
Old 2010-01-07, 08:06   #3
sascha77's Avatar
Jan 2010

2×13 Posts

ok. thanks.
I will post this in the gimps->math Forum
sascha77 is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
New Mersenne Conjecture ATH Math 28 2021-08-05 05:50
Use of new Mersenne conjecture ? bhelmes Number Theory Discussion Group 0 2017-07-28 20:34
Conjecture prime numbers, demonstration possible? Godzilla Miscellaneous Math 5 2016-05-16 12:44
Mersenne Conjecture sascha77 Math 15 2010-05-08 00:33
The New Mersenne Conjecture Dougy Math 32 2008-10-26 07:17

All times are UTC. The time now is 21:59.

Wed Dec 8 21:59:09 UTC 2021 up 138 days, 16:28, 0 users, load averages: 1.73, 1.49, 1.54

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.