Re: [URGENT] help required for modulo arithmetic?
From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 11/30/03
- Next message: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Next in thread: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Maybe reply: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Maybe reply: Vikrama Sanjeeva: "Re: [URGENT] help required for modulo arithmetic?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sun, 30 Nov 2003 16:40:31 GMT
"Phil Carmody" <thefatphil_demunged@yahoo.co.uk> wrote in message
news:87znedke5r.fsf@nonospaz.fatphil.org...
> "Tom St Denis" <tomstdenis@iahu.ca> writes:
> > As a bonus exercise determine the shortcut I alluded to for a^65537 mod
257
> > [cuts the work in half].
>
> The proper shortcut reduces that to zero work.
> Fermat's little Theorem.
True dat. I wasn't trying to pick numbers along those lines...
Tom
- Next message: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Next in thread: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Maybe reply: Paul Rubin: "Re: [URGENT] help required for modulo arithmetic?"
- Maybe reply: Vikrama Sanjeeva: "Re: [URGENT] help required for modulo arithmetic?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
