Re: Finding the remainder from very large division

In article <f9jrk3p1eck5cgi6r8hq5bivs6cc5l3l0g@xxxxxxx>,
quasi <quasi@xxxxxxxx> wrote:
On Wed, 28 Nov 2007 20:17:58 +0000 (UTC), magidin@xxxxxxxxxxxxxxxxx
(Arturo Magidin) wrote:

In article <opirk3540sgujl707imifin3ru3sd9bkmm@xxxxxxx>,
quasi <quasi@xxxxxxxx> wrote:
On Wed, 28 Nov 2007 19:51:46 +0000 (UTC), magidin@xxxxxxxxxxxxxxxxx
(Arturo Magidin) wrote:

In article <528e9d88-0e84-4235-ba39-5d8276275263@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<marksmith@xxxxxxxxxxxxxxxxx> wrote:
I am trying to use Fermats Theorem to find: 3^201 mod 11

[...]

However it would be nice to verify my answer, since most
calculators

[...]

Thanks, I do know that. However, given the OP's original post, was it
reasonable to think he knew Fermat's Little Theorem?

Yes -- read the first line of the OP's post.

Ouch. Quite right.

Of course, he said he wanted to ->verify<- the answer, rather than to
apply the Theorem. So applying Fermat's Little defeats the purpose:
you don't verify that you applied the theorem correctly by applying
the theorem...

--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes" by Bill Watterson)
======================================================================

Arturo Magidin
magidin-at-member-ams-org

.

Quantcast