On Fri, 26 Feb 2016 11:31:31 +0000
Dimitris Papastamos <s...@2f30.org> wrote:

> On Fri, Feb 26, 2016 at 12:28:32PM +0100, Mattias Andrée
> wrote:
> > On Fri, 26 Feb 2016 11:26:15 +0000
> > Dimitris Papastamos <s...@2f30.org> wrote:
> >   
> > > On Fri, Feb 26, 2016 at 12:19:32PM +0100, Mattias
> > > Andrée wrote:  
> > > > On Fri, 26 Feb 2016 10:07:31 +0000
> > > > Dimitris Papastamos <s...@2f30.org> wrote:
> > > >     
> > > > > On Fri, Feb 26, 2016 at 09:47:14AM +0100, Mattias
> > > > > Andrée wrote:    
> > > > > > On Fri, 26 Feb 2016 09:43:02 +0100
> > > > > > FRIGN <d...@frign.de> wrote:
> > > > > >       
> > > > > > > On Fri, 26 Feb 2016 09:37:12 +0100
> > > > > > > Mattias Andrée <maand...@kth.se> wrote:
> > > > > > > 
> > > > > > > Hey Mattias,
> > > > > > >       
> > > > > > > > Mostly random things, but regularly when I
> > > > > > > > correct maths tests.        
> > > > > > > 
> > > > > > > do the primes you ask your students to study
> > > > > > > fit in 64 bits?
> > > > > > >       
> > > > > > 
> > > > > > Yes. But sometimes the primes I factor do
> > > > > > not.      
> > > > > 
> > > > > Write a dc(1) script!    
> > > 
> > > man dc
> > >   
> > 
> > I know, but why?  
> 
> Because it can already handle arbitrary precision
> arithmetic.
> 

I'm lost. Do you think factor(1) shall be implemented as a
dc(1) script in sbase?

Attachment: pgpDemkUMM4RF.pgp
Description: OpenPGP digital signature

Reply via email to