Sorry if this is belated. I sent it a few days ago and it appears to
have not been received.
One of the main theorems of elementary number theory is the
following:
For all integers "a" and "m" such that gcd(a,m) = 1,
a^(phi(m)) = 1 (mod m)
If you are not familiar with congruence classes, th
Hi Chris,
On Fri, 10 May 2002 18:06 +0200, Chris Notz wrote:
>
> I have several PCs, computing prime95. I have several big RS/6000 too
> and I would like to use them too for calculating prime. Does anyone know
> a program for AIX? I didn't found a program. I hope you know probably
> one.
>
you
On Fri 10 May 2002 18:06, you wrote:
> Hello
>
> I have several PCs, computing prime95. I have several big RS/6000 too
> and I would like to use them too for calculating prime. Does anyone know
> a program for AIX? I didn't found a program. I hope you know probably
> one.
>
You could try to comp
Hello
I have several PCs, computing prime95. I have several big RS/6000 too
and I would like to use them too for calculating prime. Does anyone know
a program for AIX? I didn't found a program. I hope you know probably
one.
Thanx and best regards
Chris
--
Hi David.
No, you're right. Nobody answered via the list. I can tell, because I
read the Digest, and your 2 mails were the only ones on the subject.
Regards,
Ernst Madsen
[EMAIL PROTECTED]
>
> Also, I had thought that this was a list for public
> discussion, and yet I have not received even o
