20171214, 15:36  #12 
May 2017
ITALY
2·3^{2}·29 Posts 
Now place a decryptive paper.
To see if anyone can solve the problem 
20171214, 20:20  #13 
Aug 2006
5,987 Posts 
We start from a number N which has an unknown factorization N = a*b which we hope to discover. Your first step is computing the square root of (Nn*a)(2*a1) = a^2  2*a + 1. But we don't know the value of a, so how could we possibly find this?

20171214, 20:44  #14 
"Forget I exist"
Jul 2009
Dartmouth NS
20342_{8} Posts 
you typo a few words at very least. also the column that's supposed to sum the first column doesn't work out, so I'm lost. I can send you and email if needed for you to respond to this.edit: okay I can partially see how the table gets made.
Last fiddled with by science_man_88 on 20171214 at 20:47 
20171214, 20:53  #15  
May 2017
ITALY
522_{10} Posts 
Quote:
https://www.wolframalpha.com/input/?...3D187+,+a%3D11 

20171214, 21:12  #16 
Aug 2006
13543_{8} Posts 
In other words, you'll ask Mathematica/WA to solve a Diophantine quadratic, which will eventually involve factoring the number you set out to factor.

20171216, 14:29  #17 
May 2017
ITALY
2×3^{2}×29 Posts 
Hey @CRGreathouse I found a sixnary algorithm that at every level makes a square root.
Is it worth it to implement it? What is its computational complexity? It is fully functional. 
20171216, 15:19  #18 
"Forget I exist"
Jul 2009
Dartmouth NS
20E2_{16} Posts 
you could always learn from implementing it, computational complexity can have two parts time and space, which one do you want to know. in this case do you mean functional as it works, or that it is purely based on functions.

20171216, 15:22  #19  
May 2017
ITALY
2·3^{2}·29 Posts 
Quote:
How many levels of the tree will I have to go down as a function of N? 

20171216, 15:28  #20 
"Forget I exist"
Jul 2009
Dartmouth NS
20E2_{16} Posts 
depends on how many factors you plan on splitting off probably, also depends on how effective the algorithm is at factoring.

20171216, 15:37  #21 
May 2017
ITALY
2·3^{2}·29 Posts 

20171216, 15:53  #22 
"Forget I exist"
Jul 2009
Dartmouth NS
10000011100010_{2} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Modifying the Lucas Lehmer Primality Test into a fast test of nothing  Trilo  Miscellaneous Math  25  20180311 23:20 
Primality test based on factorization of n^2+n+1  carpetpool  Miscellaneous Math  5  20180205 05:20 
20th Test of primality and factorization of Lepore with Pythagorean triples  Alberico Lepore  Alberico Lepore  43  20180117 15:55 
18th Test of primality and factorization of Lepore in 5 * log_25 (N) (New Year's algorithm)  Alberico Lepore  Alberico Lepore  2  20180101 21:31 
14° Primality test and factorization of Lepore ( conjecture )  Alberico Lepore  Alberico Lepore  48  20171230 09:43 