Re: Simple integer factorization algorithm
- From: Joshua Cranmer <Pidgeot18@xxxxxxxxxxxxxxx>
- Date: Fri, 28 Nov 2008 18:29:46 -0500
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?
While I must admit computer science and math are quite related, strictly speaking, c.l.j.p is not a computer science-related newsgroup but a Java programming-related one. Please post this to more related newsgroups, such as sci.math and kill off this thread immediately as it is woefully off-topic.
Please refrain from posting on this topic on the future unless you are willing to provide Java code yourself. Even then, please restrict the discussion to the Java code and any questions you have on it.
*WARNING*
I apologize to anyone who feels they may be insulted by the following statement. I do not intend to imply anything about anyone except JSH.
*WARNING*
We have enough problems with trolls and spam as it is, thank you very much.
--
Beware of bugs in the above code; I have only proved it correct, not tried it. -- Donald E. Knuth
.
- Follow-Ups:
- References:
- Simple integer factorization algorithm
- From: JSH
- Simple integer factorization algorithm
- Prev by Date: Re: Simple integer factorization algorithm
- Next by Date: Re: Loading non-media files from applets
- Previous by thread: Re: Simple integer factorization algorithm
- Next by thread: Re: Simple integer factorization algorithm
- Index(es):