log in

Inquiries on creating tasks

Message boards : Questions/Problems/Bugs : Inquiries on creating tasks
Message board moderation

To post messages, you must log in.

AuthorMessage
Klarijon

Send message
Joined: 14 Sep 20
Posts: 1
Credit: 100
RAC: 0
Message 2106 - Posted: 14 Sep 2020, 9:19:12 UTC

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?
ID: 2106 · Rating: 0 · rate: Rate + / Rate - Report as offensive     Reply Quote
Greg
Project administrator

Send message
Joined: 26 Jun 08
Posts: 640
Credit: 437,685,558
RAC: 203,399
Message 2107 - Posted: 16 Sep 2020, 18:19:20 UTC - in response to Message 2106.  

No, numbers of that size are well beyond the capabilities of SNFS. You should focus on other factoring methods like ECM.
ID: 2107 · Rating: 0 · rate: Rate + / Rate - Report as offensive     Reply Quote

Message boards : Questions/Problems/Bugs : Inquiries on creating tasks


Home | My Account | Message Boards