User Portlet
| Discussions |
|---|
| Thanks Daniel. Sorry for my late reply. The computations work, but are the goal of the computations correct? I mean it looks good and all, but what I am trying to do is factor large RSA numbers. The last one was a 2048 bit one. Mathematica gave... |
| Are these numbers close that took less than 2 seconds close to the factors? &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/ef5ae021-fac6-4b21-9fa1-f17736c70407 |
| Clear[x,p]; p=2564855351; x=3; Monitor[While[x |
| This screenshot gives an equation that will solve for the 2 Semi-Prime factors that make up 2564855351. Yes I know they are already known. It is for proof of concept. Where y equals zero x is the smaller factor of the equation. We graph to reveal... |
| Attached is a PDF that proves this work. I hope it is clear enough. I need feedback because I am trying to write an article. I know it has to be simplified but does anyone follow this? |
| I have used smaller numbers and the graph appeared to work. I post the test here below. I have to use float point. I don’t know the max value an Mathematica type integer can hold. But pnp is an integer, but what I am comparing it too is not. It... |
| We are group of mathematicians. Although I am only an amateur, does no one see that this is a polynomial representation of factoring? This is factoring semi-prime numbers. And an error of 0.17 is the difference of finding an 11 digit semi Prime n... |
| I know what you are thinking after the last equation: "You call yourself Trurl the Constructor and you throw a junk equation into an already hard to follow problem?" Well I will show you a relationship between Prime numbers that doesn't take... |
| I really didnt explain this as clearly as needed because I see that no one commented. I will explain again to get some feedback. The picture I posted above is an orthogonal view of the snowflake. We learn in art classes that every object is a... |