On Mon, 28 Apr 2014, Nils Bruin wrote:
Nor is computing the characteristic polynomial. Note that `eigenvalues` returns its
answer in the field
of algebraic numbers. Equality testing is notoriously difficult there, and
since the characteristic
polynomials of your matrices are not square-free,
On Monday, April 28, 2014 12:56:48 AM UTC-7, jori.ma...@uta.fi wrote:
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
On 2014-04-28, Nils Bruin nbr...@sfu.ca wrote:
On Monday, April 28, 2014 12:56:48 AM UTC-7, jori.ma...@uta.fi wrote:
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
On Mon, Apr 28, 2014 at 11:55 AM, Dima Pasechnik dimp...@gmail.com wrote:
On 2014-04-28, Nils Bruin nbr...@sfu.ca wrote:
On Monday, April 28, 2014 12:56:48 AM UTC-7, jori.ma...@uta.fi wrote:
It takes less than two minutes to run
./sage -c n=121; l=range(1,n+1); x=matrix([[floor(n/lcm(i,j))
