Re: Simple integer factorization algorithm

On Nov 28, 11:17 pm, "Mike Schilling" <mscottschill...@xxxxxxxxxxx>
wrote:
JSH wrote:
On Nov 28, 3:29 pm, Joshua Cranmer <Pidgeo...@xxxxxxxxxxxxxxx>
wrote:
JSH wrote:
I've found that you can solve directly for f_1 and f_2 when
f_1*f_2
= T, where T is a composite to be factored.

What does this have to do with Java?

I want it coded in java, and need some help with an implementation.

Any Java coders interested?

How much an hour are you offering?

If you survived the secret agents coming after you for the
implementation, I'd pay 0.

If you didn't, there would be a straight salary of 1 million dollars
(fantasy money in case your heirs did).

But then you could go collect some prizes or something and brag about
dodging sniper bullets.

I'm moving the discussion to comp.theory at Patricia Shanahan's
suggestion.

But, um, did it occur to anyone that as the coder of Class Viewer I
could probably code this thing myself?

So why wouldn't I?

I'm too freaking terrified that's why.

But I'm still not certain it works, so I'm talking it out, as the
worst thing would be to code it, have it factoring great and
immediately have a panic attack as I try to figure out how to survive
from that point on.


James Harris
.

Relevant Pages

  • Re: why did you choose the programming language(s)you currently use?
    ... That's the factoring program (factor.exe from ... I don't know how to fix the bug nor how to bind ... The Python program, as it captures the StdOut, ... composite back to the beginning and start over. ...
    (comp.lang.python)
  • Re: prime or not
    ... or generally for a j-1 - fold concatenation: ... If j is composite, then immediately it is clear, that n is composite, ... So we may rewrite our factoring ... To see, whether this is possible, let's rewrite this: ...
    (sci.math)
  • Re: Breaking Large Composite Numbers...???
    ... around very large composite numbers that have 2 very large prime ... RSA is typically used a key exchange mechanism. ... Block ciphers do not use the hardness of integer factorisation as the ... Testing whether a number is prime is much easier than factoring. ...
    (sci.crypt)
  • Re: Breaking Large Composite Numbers...???
    ... around very large composite numbers that have 2 very large prime ... RSA is typically used a key exchange mechanism. ... Testing whether a number is prime is much easier than factoring. ... It holds a deep sense of ...
    (sci.crypt)
  • Re: Breaking Large Composite Numbers...???
    ... around very large composite numbers that have 2 very large prime ... RSA is typically used a key exchange mechanism. ... Block ciphers do not use the hardness of integer factorisation as the ... Testing whether a number is prime is much easier than factoring. ...
    (sci.crypt)