mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2019-04-12, 21:29   #56
nesio
 
Apr 2019

2016 Posts
Default

Quote:
Originally Posted by nesio View Post
5. if the value "k" becomes k > m*n then continue the calculations by the RM (Recursive Multiplication) algorithm using there rules №№3,4 there also.
Small clarification (we wrote about above):

5. if the value "k" becomes k > (m*n)^(1/3) then continue the calculations by the RM (Recursive Multiplication) algorithm using rules №№3,4 there also.
nesio is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Diamond multiplication and factorization method datblubat Computer Science & Computational Number Theory 6 2018-12-25 17:29
The natural progression of (even perfect numbers)*3 Dubslow Aliquot Sequences 6 2018-05-15 15:59
Montgomery method in Prime Numbers: ACP SPWorley Math 5 2009-08-18 17:27
Elliptic Curve Method factoring - Fermat numbers philmoore Math 131 2006-12-18 06:27
Prime Numbers: Nothing but Errors in Multiplication??? Pax_Vitae Miscellaneous Math 15 2005-11-14 12:41

All times are UTC. The time now is 08:03.

Thu May 6 08:03:40 UTC 2021 up 28 days, 2:44, 0 users, load averages: 1.82, 1.88, 1.84

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.