From owner-freebsd-hackers Thu Feb 26 08:45:31 1998 Return-Path: Received: (from majordom@localhost) by hub.freebsd.org (8.8.8/8.8.8) id IAA14150 for freebsd-hackers-outgoing; Thu, 26 Feb 1998 08:45:31 -0800 (PST) (envelope-from owner-freebsd-hackers@FreeBSD.ORG) Received: from mail.jmrodgers.com ([205.247.224.9]) by hub.freebsd.org (8.8.8/8.8.8) with ESMTP id IAA14140 for ; Thu, 26 Feb 1998 08:45:24 -0800 (PST) (envelope-from meuston@jmrodgers.com) Received: from max.jmrodgers.com (max.jmrodgers.com [205.247.224.209]) by mail.jmrodgers.com (8.8.8/8.8.7) with SMTP id LAA18195; Thu, 26 Feb 1998 11:44:09 -0500 (EST) (envelope-from meuston@jmrodgers.com) Received: by localhost with Microsoft MAPI; Thu, 26 Feb 1998 11:38:12 -0500 Message-ID: <01BD42AB.049D4B20.meuston@jmrodgers.com> From: Max Euston To: "'Eivind Eklund'" , Anatoly Vorobey , "hackers@freebsd.org" Subject: RE: New utilities: factor(1) and wid(1)? Date: Thu, 26 Feb 1998 11:38:09 -0500 Organization: J.M. Rodgers Co., Inc. X-Mailer: Microsoft Internet E-mail/MAPI - 8.0.0.4211 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG On Wednesday, February 25, 1998 5:29 PM, Anatoly Vorobey [SMTP:mellon@pobox.com] wrote: > You, Max Euston, were spotted writing this on Wed, Feb 25, 1998 at 04:41:11PM -0500: > > > when I should have tried: > > > > $ man factor > > > > Didn't expect to find it in 'games' ??? - That is not in my PATH=. > > That's history for you, I guess. > Does anyone know why this is in games? Shouldn't it be factor(1)? On Thursday, February 26, 1998 3:34 AM, Eivind Eklund [SMTP:eivind@yes.no] wrote: > On Thu, Feb 26, 1998 at 12:28:46AM +0200, Anatoly Vorobey wrote: > > It's time for to rewrite them both to use a more modern method > > of factoring, I guess. It's been some 2500 years or so; ole' good > > Eratosthenes could use some rest :) > > If somebody need a pure prime-generator, I've got one lying around > somewhere. A full sieve, no pre-computed tables. Not top-notch for > really large sieving, but OK for <32 bits at least (and could AFAIR > scale beyond that; I think I did it as a 2-layer sieve to be able to > scale to infinity. Still won't be the fastest method for factoring, > though.) If you can find this, please send me a copy. It's been _many_ years since I did any _real_ math, so if you would like me to use a faster method, I may need some clues (I will have _no_ problem optimizing an algorithm to C, but may not see if there is a better way mathamatically) (I might be over-stating my lack of experience somewhat). :) Max ----- Max Euston Sysadm, Programmer, etc... To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message