It takes less than two minutes to run
./sage -c "n=121; l=range(1,n+1); x=matrix([[floor(n/lcm(i,j)) for i in l] for j in
l]).eigenvalues();"
But with n=122 calculation seems to get stuck.
Well, 122=61*2, so maybe it's because of a big factor? However, n=118=59*2
takes only about a minute. And n=123 takes less than one minute, so the
size of the matrix is not a problem in itself.
Is there some kind of magic limit in code? Size of cache? Something else?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
