Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
Java
My OPE & the Euclicidean TSP
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="JSH, post: 3617397"] I have worked examples with my factoring research. And "rossum" has verified. The issue wasn't whether or not my surrogate factoring worked but how fast it was. Fact checks reveal that people like you have a contempt for the truth. There is no doubt that I found another factoring method. The only issue has been how fast it is, as in whether or not it might be a threat to public keys. And, oh wait, I also have my prime counting function, which counts primes. Kind of hard to fudge on whether or not that gets the count right, eh? You people do not realize it but I'm fighting for the survival of my country and you are trying to destroy it. History turns on stupidity. Later, what will you do, say you're sorry? That you just didn't know? Claim there was no way to be sure? I have mathematical proof. So my prime counting function is absolute perfection. It counts perfectly. And my surrogate factoring, factors. The issue is not whether or not my research works, but just how effective it is, and I'm saying there are implications that it could invalidate public key encryption, overnight, and in doing so, possibly collapse the global economy. And then what, you'll say, oops? Apologize to over 6.6 billion people for what you did? James Harris [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
My OPE & the Euclicidean TSP
Top