mersenneforum.org 14° Primality test and factorization of Lepore ( conjecture )
 Register FAQ Search Today's Posts Mark Forums Read

2017-12-20, 12:44   #1
Alberico Lepore

May 2017
ITALY

2·32·29 Posts
14° Primality test and factorization of Lepore ( conjecture )

Hey friends, could you take a look?

What do you think?
Attached Files
 14° Primality test and factorization of Lepore.pdf (30.5 KB, 258 views)

 2017-12-20, 14:37 #2 Alberico Lepore     May 2017 ITALY 52210 Posts Testing m, r, s, t, v, z, n-m=1 m-r=1 r-s=1 s-t=1 t-v=1 v-z=1 etc.etc.
 2017-12-20, 15:11 #3 CRGreathouse     Aug 2006 135438 Posts Would you use this method to factor, say, 647978103069410806903326919883810380070087355654969148727717? It is of the form pq for primes p and q, so you can choose a = p and n = q-1 to see that it is of the desired form a^2 + n*a. This is a small number as far as factoring is concerned -- yafu's SIQS cracks it in 2.8 seconds -- but it should be enough to show us how your method works. Please don't use other factoring tools for this, we're interested in how well your method works not how well others work.
2017-12-20, 15:14   #4
Alberico Lepore

May 2017
ITALY

2×32×29 Posts

Quote:
 Originally Posted by CRGreathouse Would you use this method to factor, say, 647978103069410806903326919883810380070087355654969148727717? It is of the form pq for primes p and q, so you can choose a = p and n = q-1 to see that it is of the desired form a^2 + n*a. This is a small number as far as factoring is concerned -- yafu's SIQS cracks it in 2.8 seconds -- but it should be enough to show us how your method works. Please don't use other factoring tools for this, we're interested in how well your method works not how well others work.
There's something wrong, yet.
If I find the problem I will start the implementation.

 2017-12-20, 16:16 #5 Alberico Lepore     May 2017 ITALY 2·32·29 Posts I will start the implementation (if I can) while I explain the algorithm from a structural error I found a very quick solution a^2+n*a=1829 3*a^2-m*a=1829 A=a^2+r*a=1829-[3*a^2-1829] -> r=n-m B=a^2+s*a=-[3*a^2-1829]+[1829-[3*a^2-1829]] ->s=r-m a^2+t*a=-A-B -> s+r=t ERROR=WIN s+r=t+1 I do not know exactly if I have to do X + Y or X-Y or -X + Y or -X-Y but I know there will be an error in the right path, using this error I find the solution a^2+n*a=1829 3*a^2-m*a=1829 A=a^2+r*a=1829-[3*a^2-1829] B=a^2+s*a=-[3*a^2-1829]+[1829-[3*a^2-1829]] a^2+t*a=-A-B s+r=t+1 test 1 and -1
 2017-12-20, 16:33 #6 CRGreathouse     Aug 2006 5,987 Posts So at each step there are four possibilities to explore, which suggests that with s steps the entire tree has 4^s possibilities with an average of 4^s / 2 before you find the desired one (if it is unique and you have no other information). One question that comes to mind: how many steps are there for a given number, and how does this grow with the size of the number?
2017-12-20, 16:41   #7
Alberico Lepore

May 2017
ITALY

2·32·29 Posts

Quote:
 Originally Posted by CRGreathouse So at each step there are four possibilities to explore, which suggests that with s steps the entire tree has 4^s possibilities with an average of 4^s / 2 before you find the desired one (if it is unique and you have no other information). One question that comes to mind: how many steps are there for a given number, and how does this grow with the size of the number?
I discovered this magic number 3 * a ^ 2 today, it is not a random number.
I still do not have much information.
I'm not a programmer so I could take weeks.
Would anyone want to implement it?
I would be happy to share it with someone else

CRGreathouse implements it?

 2017-12-20, 16:45 #8 CRGreathouse     Aug 2006 5,987 Posts I don't understand what you're doing, and the pdf you posted doesn't appear to contain an algorithm. It's not at all clear to me where the numbers you post come from, and in any case they're too small for me to figure out what calculations they could result from. I asked for an example with a somewhat larger number so I could follow it more easily but you weren't able to give it. Until you know what you're doing there is no hope of someone else implementing it for you.
2017-12-20, 17:08   #9
Alberico Lepore

May 2017
ITALY

52210 Posts

Quote:
 Originally Posted by CRGreathouse Would you use this method to factor, say, 647978103069410806903326919883810380070087355654969148727717? It is of the form pq for primes p and q, so you can choose a = p and n = q-1 to see that it is of the desired form a^2 + n*a. This is a small number as far as factoring is concerned -- yafu's SIQS cracks it in 2.8 seconds -- but it should be enough to show us how your method works. Please don't use other factoring tools for this, we're interested in how well your method works not how well others work.
you could give me the factoring of this number, in order to test the procedure

2017-12-20, 17:23   #10
ET_
Banned

"Luigi"
Aug 2002
Team Italia

3·1,619 Posts

Quote:
 Originally Posted by Alberico Lepore you could give me the factoring of this number, in order to test the procedure
You could give us the factors coming out from your procedure, and we would tell you whether the result is correct...

2017-12-20, 17:25   #11
CRGreathouse

Aug 2006

5,987 Posts

Quote:
 Originally Posted by Alberico Lepore you could give me the factoring of this number, in order to test the procedure
I don't understand, I thought your procedure was supposed to generate a factorization? Perhaps I misunderstood the purpose of your algorithm. What is it supposed to do?

 Similar Threads Thread Thread Starter Forum Replies Last Post carpetpool Miscellaneous Math 5 2018-02-05 05:20 Alberico Lepore Alberico Lepore 43 2018-01-17 15:55 Alberico Lepore Alberico Lepore 2 2018-01-01 21:31 Alberico Lepore Alberico Lepore 26 2017-12-17 18:44 Alberico Lepore Alberico Lepore 61 2017-09-23 21:52

All times are UTC. The time now is 13:17.

Wed Feb 1 13:17:59 UTC 2023 up 167 days, 10:46, 0 users, load averages: 2.61, 2.15, 1.63