use PollardRho in searchFactors() for 63 bit numbers

Author: TilmanNeumann

src/main/java/de/tilman_neumann/jml/factor/CombinedFactorAlgorithm.java

@@ -1,6 +1,6 @@
 /*
  * java-math-library is a Java library focused on number theory, but not necessarily limited to it. It is based on the PSIQS 4.0 factoring project.
- * Copyright (C) 2018-2024 Tilman Neumann - [email protected]
+ * Copyright (C) 2018-2025 Tilman Neumann - [email protected]
  *
  * This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License
  * as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
@@ -140,6 +140,7 @@ public void searchFactors(FactorArguments args, FactorResult result) {
 		}
 		else if (NBits<46) hart.searchFactors(args, result);
 		else if (NBits<63) tinyEcm.searchFactors(args, result);
+		else if (NBits<64) pollardRhoBrentMontgomery64MH.searchFactors(args, result);
 		else {
 			if (SEARCH_SMALL_FACTORS) {
 				int actualTdivLimit;