Jump to content


Senior Members
  • Content Count

  • Joined

  • Last visited

Community Reputation

9 Neutral

About Trurl

  • Rank

Contact Methods

  • Website URL

Profile Information

  • Favorite Area of Science
    applied mathematics

Recent Profile Visitors

8722 profile views
  1. I am only kidding. I did not think of it either. My nephew said he had a friend that did math on excel and mathematics. But it didn't click because they never taught that in school. I was watching a video of The Great Courses and the instructor showed how computers solve differential equations. It is a cheap and powerful method. But it may be able to graph from 0 to pnp.
  2. One more post before I conclude this project. Why did no one recommend Excel for the graph and the list? It would graph and list an N of 100 digits easily. It has a segment of adjustable accuracy. Spread sheets are common to solve graphs and differential equations and it is a tool everyone has access to. It would take more adjustments with Mathematica. Of course if you didn’t believe in my work you wouldn’t mention this simple tool. However if you think it can be estimated with a simple graph you have already plugged it into the spreadsheet without sharing.
  3. Lock this thread. I have spent years reading encryption books and tinkering with Prime numbers. It was very valuable in that I could study statistics, game theory, review calculus and work on ideas. It was more than just crunching x’s and pnp’s. That is why I keep it up. I even learned the basics of Mathematica. My end result was to approximate x by graphing a pattern in division. I need to know what x will have a y value of N. I can’t graph it accurately enough with standard programs. I don’t know if there are any computer programs to graph a range that is pnp. I could take guess at the
  4. p3 = ((pnp^2 + x^3) / pnp) – ((pnp + (x^2 / (pnp^2 + x)) * pnp)) p5 = (pnp^2 + x^3) / pnp + (x^3 / pnp) where N = pnp for computer computation Given equations p3 and p5. p3 is equal to p5 a distance of N. Since N is the distance subtracted from p5 So, p3(x_semiPrime)=0 and p5(x_semiPrime)=N That is y=0 at an x equal to the smaller semi-Prime at p3. And at p5, y=N. Knowing the above, p3(x) = p5(x+N) so p3(N)=p5(N+N) since these equal the derivative of those should also equal p3’(x) = p5’(
  5. Both good explanations. I don’t know what to think of multiple realities. With all the histories and multiple realities, we forget we are living it. Our lives are just as significant as any reality.
  6. In Star Trek Next Generation the last episode “All Good Things,” the character Que, an omnipotent being, suggest the crew was not in space to map constellations. But all our physical sciences are based on these observations, So my question is what is Que suggesting?
  7. Ok, I hope this makes sense. It is only an idea. I just wanted to post it to see if it makes anyone else see something new in a plain graph. I had trouble finding the values on the graph of x when N is a hundred-digit number. I was certain that I could just zoom in or pan the graph to see the proper value. As I have found, this is difficult to do in practice. So I am back at just approximating x and using test values. But in trying to do this I noticed something else that would help in the search for x knowing only N. So for N = x *y, where x and y are 2 unknown Pri
  8. Ok, so I graphed the RSA 100. There is one problem in particular. I just can’t read the axis’ scale. I am researching how to evaluate the graph in Mathematica. I just need to find xongraph where yongraph equals pnp. That would be the range. I believe you can test for yongraph on a graphing calculator and find points on the graph. I post this as a mathematical challenge to the SFN community. How do I arrange the scales in mathematic software to find the y value I am looking for? It takes milliseconds to draw, but I need to be able to evaluate it.
  9. For a large N use a software like Mathematica and paste in N. Yes I know math types don’t like that. I apologize. It just needs some properties as an algorithm. So in the following Mathematica code replace pnp with N and graph and look for a yonthegraph of pnp. Work from the left side. I don’t know it’s speed compared to other methods. The truth is I don’t know the other methods. I know they rely on series. I took a simpler approach and looked for patterns in the division of semiPrimes. My question does it work for all factor, not just factors of
  10. Here is the summary of my work: The main equation is: (N^2+x^3)/N = N+[(x^2/((N^2/x)+x))*N] All the other math is the simplification of this equation. If you simplify the equation completely it results in zero equals zero. Which is not particularly useful. But we can put N the given semiprime product of x and y, where x and y are the Prime factors. As I have showed in the examples if you “plug and chug” “N” into the equation and graph the equation in its un-simplified form, then my hypothesis says that reading the graph in how I told you to read p3 and p5 should rev
  11. PNP is the variable name of the semiPrime in question. It is the given. It is usually referred to as N as in N=p*q, where p and q are the Prime number factors. PNP is my name because I cannot call it N because N is a keyword in Mathematica. PNP or N is the factor of 2 Primes and is the given in RSA cryptography. Finding x knowing only N is considered difficult with large Prime factors. The goal of this work is to use a simple mathematical pattern to list N in terms of x, than reveal the value of x in the graph of the equations. So basically, if you did not understand my write up, you coul
  12. PNP is N in this. Originally it was N = p*j. But N is protected in Mathematica so I renamed it pnp. N = p*J = x*y, because I also called p, x and j, y. This is a poor decision because when you graph it ygraph is different from y in the equation. So it created some confusion, but writing this up and coming up with a solution variables get jumbled. DLP is the discrete logarithmic problem. If this can factor semi-Primes then the DLP is next to go. Remember I am claiming I can factor semi-Primes and thus RSA cryptography would be no more. But it wouldn't matter because other cryptosystems wou
  13. I know I not the best math teacher. What parts do you not understand? I am taking the known semiPrime, PNP, and graphing it along the x axis to find the place where y equals zero. I do this to find x knowing only PNP. Look at the pdf I posted (see previous post attachment). You will see 2 equations, p3 and P5, and the graphs that correspond to them there. N=1847*2393=4419871=4.4199871*10^6. (These are N=x*y as an example) For p3 as y approaches 0, x will be 1847 or x. For p5 as x approaches 1847, y=4.4199871*10^6
  14. Thoughts? Do you believe the math? I’ve shared it with an engineer and he thought it worked but he said he wasn’t a mathematician. I am not a mathematician either. And I am biased. I envisioned it so it makes sense to me. I was hoping for some guidance from these boards. Is it worth publishing? I am not an elite mathematician so message boards and the net are where I publish. So now break large semiPrimes. And if the math holds true, break the DLP next. Primality test by multiplication and seeing if a semiPrime is formed. There are no prizes for factoring anymore. Patte
  15. The graph is what’s important. N=1847*2393=4419871=4.4199871*10^6 For p3 as y approaches 0, x will be 1847 or x. For p5 as x approaches 1847, y=4.4199871*10^6 or N Using graphing in polynomial time to get an answer that algebra can’t solve.
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.