Message80618
| Author | LambertDW |
|---|---|
| Recipients | LambertDW, rhettinger, steve21 |
| Date | 2009-01-27.04:37:52 |
| SpamBayes Score | 8.4206374e-07 |
| Marked as misclassified | No |
| Message-id | <84B204FFB016BA4984227335D8257FBA849B9A@CVCV0XI05.na.corning.com> |
| In-reply-to | <1233028621.62.0.725226010085.issue5032@psf.upfronthosting.co.za> |
| Content | |
|---|---|
Probably a better prime factor algorithm uses Sieve of E. to generate primes through int(1+sqrt(n)) and test these. The other algorithm uses a custom generator anyway. Oh well, good luck, I'll shut up. You do have use cases that I couldn't think of. Dave. |
|
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2009-01-27 04:37:54 | LambertDW | set | recipients: + LambertDW, rhettinger, steve21 |
| 2009-01-27 04:37:53 | LambertDW | link | issue5032 messages |
| 2009-01-27 04:37:52 | LambertDW | create | |