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.
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
AIL PROTECTED]> wrote:
> On Apr 17, 2007, at 6:38 AM, DanK wrote:
>
> I'm curious; how long did the computation actually take? Are we
> talking seconds? minutes? weeks?
>
> david
--~--~-~--~~~---~--~~
To post to this group, send email to
Nobody any idea? Or perhaps another command to mesure the time the
algorithm used?
Daniel Köhl
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more option
Hi,
I made the following computations with SAGE:
p=10009 #Gewuenschte Primzahl bitt hier eingeben
Zeit=cputime()
print 'Die gewaehlte Primzahl ist:'; print p
if is_prime(p):
bernoullilist=bernoulli_mod_p(p)
for i in range(100): #Berechnung der Primzahl q
q=p*i+1
if is_prime(q):
break
Hi,
thank you for your help. I have changed it to:
v=1; w=1; x=1 #Berechnung von Vp,t noch ohne modulo q
for i in range(1,((p-1)/2)+1):
v=z^i-z^(-i)%q
R=Integers(q)
w=R(v)^(i^expo)
x=(x*w)%q
it give the same results like the faster algorithm and now I can
compute primes with a higher value w
One more question: Is there a command to get the total time for all
computings in one notebook sheet(?)?
I know the command time for one cell of sage.
Daniel Köhl
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscr
Hi,
I tried a little bit and I think I have programmed the test for
Vandiver´s conjecture like Buhler et. al. described it in their
papers. I have both ways the slow and fast in the notebook of sage. I
will show it to you here and hope you can eventually show me some
points were are mistakes, if
>
> You should explain the nature of this "exam". Obviously we don't want
> to help you "cheat" on an exam. What sort of exam is it? Please
> clarify.
>
Hi,
it is my first end exam (german: 1. Staatsexamen) to get a teacher of
mathematics and physical education, therefore I must write 50 to 7
Hi,
my name is Daniel Köhl and I´m a student of mathematics and physical
education at the Johannes-Gutenberg Universität of Mainz. I´m writing
to you, because I´m working on vandiver´s conjecture for my exam.
First I have written to Joe Buhler and he forwarded me to this list.
He wrote that you e
13 matches
Mail list logo
