On 4/18/07, Martin Albrecht <[EMAIL PROTECTED]> wrote:\
> > In addition, the following tests reported:
> >
> > Exception pexpect.ExceptionPexpect: ExceptionPexpect() in > method spawn.__del__ of >
> > ignored
> >
> > devel/sage-main/sage/functions/constants.py
> > devel/sage-main/sage/f
Hi everybody,
I fixed most of the mentioned issues, see below for details.
> ***
> x86_64-Linux
> ***
>
> sage -t devel/sage-main/sage/graphs/graph.py
> **
> File "graph.py", line 3465:
> sage: enum(graphs.CubeGraph(3))
> Ex
I built sage-2.4.2 on the following three architectures using gcc-4.1.2:
i686-pc-linux-gnu (x86-Linux)
x86_64-unknown-linux-gnu (x86_64-Linux)
ia64-unknown-linux-gnu (ia64-Linux)
Sadly, none of them completely passed the test suite ('make test').
Details follow.
***
x86-Li
On Apr 18, 2007, at 11:52 AM, DanK wrote:
>for i in range(1,((p-1)/2)+1):
> e=i^(p-1-t)%p
Here is another example where modular arithmetic is important.
The variable i could be as large as about p/2, and you are raising it
to a power which is about as large as p. That means that i^(p-
I want to add:
I have a Toshiba Laptop with Intel centrino processor, 1,73 Ghz and
1GB Ram and windows XP on it.
Daniel Köhl
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [E
Hi,
I want to thank you for your fast and detailed help. I worked with the
text you mentioned in your post and you are right, that the
computation of the irregular pairs should take the most time of the
algorithm. In my algorithm I´m doing both first the irregular pairs,
with the command bernoull
