Inquiries on creating tasks
Message boards :
Questions/Problems/Bugs :
Inquiries on creating tasks
Message board moderation
Author | Message |
---|---|
Send message Joined: 14 Sep 20 Posts: 1 Credit: 100 RAC: 0 |
In recent days, I have been studying the properties of the equation m^n+h=0 (mod n) for m,n \in N, and h \in Z, and I wanted to find the factors of 2^n+1 where n satisfies 2^n+1=0 (mod n) and n>=2187. Is it possible to create new tasks to factor these numbers, and if so, where can I do so? |
Send message Joined: 26 Jun 08 Posts: 645 Credit: 472,379,408 RAC: 255,162 |
No, numbers of that size are well beyond the capabilities of SNFS. You should focus on other factoring methods like ECM. |