mersenneforum.org RSA - Oops I think I did it again
 Register FAQ Search Today's Posts Mark Forums Read

2020-03-01, 21:57   #12
Alberico Lepore

May 2017
ITALY

22×97 Posts

Quote:
 Originally Posted by CRGreathouse Hmm... ok. But this isn't something you could detect from looking at the number to be factored, so it's a bit less useful for a factoring algorithm compared to one where you could tell if it applied or not. Here if you just see a number you wouldn't know what type it is. 50 bits: 730518607478393 (500 μs in gp -- SQUFOF) 100 bits: 718009979005367478539949203041 (500 μs in gp -- MPQS) 150 bits: 788147109545943410763272181909253057469476849 (500 ms in gp - MPQS) 200 bits: 1480011537446014095552865655792207870614938765157503182334313 (6 seconds in yafu -- SIQS)

Thanks for the numbers,
when I find an efficient algorithm I will try them
returning to mathematical discourse
have you noticed the symmetry of two symmetric schemes [(q-p) mod 8 == 0 and (q-p) mod 8 == 2] below in h and k?

Quote:
 Originally Posted by Alberico Lepore In summary Given an N = p * q in the form (p + q-4) mod 8 = 0 with p and q not necessarily prime but odd numbers then given the system solve h=[x^2-[4*x-1+4*x-1-3*(y-2)]*(y-1)/2] , k=(x+1)*(2*(x-y+1)+1)+(x-y)*(x-y+1) , (3*N-1)/8+h=2*((3*N-1)/8-1)/3+k , k-2*h=(x+1)^2+2*[x^2-(x-y+1)^2] , k>0 , y>0 , x>0 , y you will have that q=2*(3*x+1-(x-y+1))+1 e p=2*(3*x+1-(x-y+1))+1-(4*y-2)

Last fiddled with by Alberico Lepore on 2020-03-01 at 22:08

2020-03-02, 02:17   #13
CRGreathouse

Aug 2006

22×5×293 Posts

Quote:
 Originally Posted by Alberico Lepore when I find an efficient algorithm I will try them
I thought you already had implemented a base case? You can just use it on the 50-bit one for now.

Why do you call it a base case? Do you have a more sophisticated algorithm that uses this one for small numbers as a subroutine?

Quote:
 Originally Posted by Alberico Lepore returning to mathematical discourse have you noticed the symmetry of two symmetric schemes [(q-p) mod 8 == 0 and (q-p) mod 8 == 2] below in h and k?
What are h and k?

2020-03-02, 21:16   #14
Alberico Lepore

May 2017
ITALY

22·97 Posts

Quote:
 Originally Posted by CRGreathouse I thought you already had implemented a base case? You can just use it on the 50-bit one for now. Why do you call it a base case? Do you have a more sophisticated algorithm that uses this one for small numbers as a subroutine?
I don't have efficient algorithms.

Quote:
 Originally Posted by CRGreathouse What are h and k?
h and k are one of the bridges connecting the two schemes.

N is in the scheme (q-p) mod 8 == 0

(3*N-1)/8+h=2*((3*N-1)/8-1)/3+k=G

G=[[2*[3*x+1-(x-y+1)]+1+2*(x-y+1)]*[2*[3*x+1-(x-y+1)]+1+2*(x-y+1)+2+8*(x-y+1)]-3]/12

12*G+3 is in the scheme (q-p) mod 8 == 2

and it is biunivocal

2020-03-02, 21:31   #15
retina
Undefined

"The unspeakable one"
Jun 2006
My evil lair

22×29×47 Posts

Quote:
 Originally Posted by Alberico Lepore I don't have efficient algorithms.
We know.

So what ARE you claiming in your posts?

2020-03-02, 21:41   #16
Alberico Lepore

May 2017
ITALY

22·97 Posts

Quote:
 Originally Posted by retina We know. So what ARE you claiming in your posts?
play with math

2020-03-02, 21:54   #17
mathwiz

Mar 2019

5×13 Posts

Quote:
 Originally Posted by Alberico Lepore play with math
1. toss equations at screen
2. disregard test cases
4. go back to 1

 2020-03-04, 09:54 #18 LaurV Romulan Interpreter     Jun 2011 Thailand 22·2,137 Posts You forgot 3.7 don't give a sh!t about what is said/answered by people who know, and who actually want to help him... Last fiddled with by LaurV on 2020-03-04 at 09:55
 2020-03-04, 15:31 #19 Alberico Lepore     May 2017 ITALY 22×97 Posts it's not true ! I listen to advice a lot
2020-03-04, 16:14   #20
chalsall
If I May

"Chris Halsall"
Sep 2002

214428 Posts

Quote:
 Originally Posted by Alberico Lepore I listen to advice a lot
Do you internalize any of it?

 2020-03-05, 06:36 #21 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 2×52×7×23 Posts Good time to close this thread.

 Similar Threads Thread Thread Starter Forum Replies Last Post fivemack Msieve 1 2017-11-30 17:30 Prime95 News 631 2017-11-10 20:35 Dubslow YAFU 6 2015-02-26 01:32 ltd Prime Sierpinski Project 21 2006-01-04 14:50 Xyzzy Lounge 4 2003-01-06 22:18

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

Fri Jun 5 16:13:17 UTC 2020 up 72 days, 13:46, 0 users, load averages: 1.83, 1.65, 1.57