I wrote a little program which almost brought my department's server down and would like to know why. Here is a brief description of the program [I can reproduce the actual code if necessary]:
1. Choose an odd prime p which is less than 100 2. Let a and b be small multiples of p (each no more than 30*p) and choose 7 integers randomly from [1,100]. Use these 9 integers to construct a 3x3 matrix (over QQ) with a & b as the (3,1) and (3,2) entries. 3. Let f be the characteristic polynomial of the above matrix. 4. If f is irreducible then set K=NumberField(f,'t') and check that K is galois over QQ. If not then select different multiples of p to use as a and b and return to the second step. If this cannot be done, then start over using the a different prime p. 5. Factor f modulo the prime p. 6. Display output (i.e. matrix, polynomial f, factorization mod p) I'm interested in seeing what sorts of factorizations of the polynomial f I obtain in this manner, so I have an outer for loop which I set to run 5000 times. Although my program goes through many loops, it doesn't do anything which I would think would be memory intensive (a little mod p arithmetic, testing a cubic for irreducibility, etc..) Yet when I ran it on my department's server last night, the server got so bogged down that it became unavailable to the outside world. Any ideas what happened and how I can avoid this problem in the future? By the way, the version of sage on the server is: SAGE Version 3.1.2, Release Date: 2008-09-19 Thanks, Ben Linowitz -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
