At first, I appology my poor English and I am a non-proessional on mathematics and programing. I am an old retired engineer/researcher.
I found strange phenomena with maple.
Could someone please verify this result?
This is sound like a stupid joke.
This queation is related to factorization of composite number N=p*q
p, q are large prime number respectively.
1. Let p is large prime such as 50 degits
2. Let R is small integer such as 3
3. Let q is nearest prime R*p
4. Let N=p*q
5. Let f=frac(N/(q+s))
for s from -m to m by r do
if f=0 OR 1.0 then f:=100000; # zero dev exeption;
elif f <= 0.5 then f:=log10(f);
elif f > 0.5 AND f < 1.0 then f:=-log10(1.0-f);
else print(“error”) break;
F:=[F[ ], [s, f]]; # maple plot format
6. Draw a Graph s vs F
You wil find a oscillating graph with step at s=0;
7. b:=8 and c:=75; and try same caluclation.
You will find a graph with dip at s=0;
Caution! Resolution and Scanwidth can not go together.
8. Let qx=q+10^25;
10. Let ps:=sqrt(N/3.0) and let qs:=3.0*sqrt(N/3.0);
Caution! Nx not equal Ns:=p*qs
12. Draw a graph s vs Fs with Nx, p, qs
You will find a similar graph dip point shifted from s=0
13. Verify qx=ps-dip point s
My questions are
1. Is it a kaind of factorization of Nx?
2. This phenomena hava posibirity to make a vulneravility for RSA crypto?
3. Power spectrum of F( c=0) indicates R=q/p; with an peak
4. Is it an rediscovery of “Wheel”? Are thea any papers similar to this phenomena
I appreciate to read this questions.
Environment: Windows 10 for workstation and Maple 2019(64bit) CPU: Intel Xeon.
15 Dec 2019 some miss spelling corrected
A graph added frac(N(q+s)) vs s b=8 c=75