On Mon, Aug 9, 2010 at 9:10 AM, MayX shi...@foxmail.com wrote:
I have some program to compiling native code on windows platform.
when I use the command:
ocamlopt -ccopt -LC:/out/gtk/lib -I +lablgtk2 lablgtk2 lablgtk.cmxa
gtkInit.cmx testgtk.ml -o testgtk.exe
it display a fatal
Hi, I think I've identified some arithmetic errors in the behavior of
the Bignum libraries. I may well be making some mistake of my own,
though, so I thought I'd expose this to a few more eyes before making it
a bug report.
Background:
Fermat's Little Theorem says that when p is prime, then for
On 10 August 2010 08:34, Jim Pryor lists+c...@jimpryor.net wrote:
Fermat's Little Theorem says that when p is prime, then for all 1=ap,
a**(p-1) mod p = 1. However, some composite p also have this property
for some choices of a. However, if one checks a handful of a, only a few
composite p
