On 4/19/07, Jeff Allotta <[EMAIL PROTECTED]> wrote:
> Thanks for the quick response. The dict method should definitely be a
> help in general, but I have a couple more questions about this.
>
> After trying some things, I've noticed that it is possible to coerce a
> flat list into a sparse matrix
On 4/19/07, Kate Minola <[EMAIL PROTECTED]> wrote:
> This is a very minor thing, but as it caused me a
> few moments of confusion I will report it.
>
> When I do 'make distclean' I expect that
> after it finishes I will have a version just
> as if I had downloaded a fresh copy of
> the source tarb
This is a very minor thing, but as it caused me a
few moments of confusion I will report it.
When I do 'make distclean' I expect that
after it finishes I will have a version just
as if I had downloaded a fresh copy of
the source tarball.
This is currently not the case.
After 'make distclean', t
Hmmm this sounds like a bug in the cputime() command. I will ask
around on the sage-devel list.
david
On Apr 19, 2007, at 3:52 AM, DanK wrote:
> For the problem with the negative time i have started following
> computation:
>
> Zeit=cputime()
> for i in range(10):
> g=maxima('193^99484')
Hi,
sorry for the three posts, but I dont find the button to edit my older
posts.
I have fixed the Error in the following time and in the first few
tests the algorithm now only needs half of the time.
I fixed it the following way:
T=Integers(4096)
S=Integers(p)
for i in range(1,((p-1)/2)+1):
e=
Hi
I have tried to fasten up the modluar arithmetic at the point you
mentioned:
>for i in range(1,((p-1)/2)+1):
> e=i^(p-1-t)%p
in the following way:
S=Integers(p)
for i in range(1,((p-1)/2)+1):
e=S(i)^(p-1-t)
but then I get a error message at the following point:
e0=e%4096
error me
I will try to fasten the modular arithmetic.
For the problem with the negative time i have started following
computation:
Zeit=cputime()
for i in range(10):
g=maxima('193^99484')
Ergebnis=cputime(Zeit)
print Ergebnis
and get following intressting result:
130.62
262.78
393.85
524.81
656.
