tag:blogger.com,1999:blog-8342851416423405349.post1681398815932747492..comments2023-11-05T02:06:02.486-08:00Comments on mudeltasigma: Python in Liouvillemudeltasigmahttp://www.blogger.com/profile/17001618592069897953noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8342851416423405349.post-55786732708370196322011-01-25T22:20:37.372-08:002011-01-25T22:20:37.372-08:00There's a proof and discussion of this result ...There's a proof and discussion of this result on my own blog: http://bit.ly/hJZjqB<br /><br />cheers,<br />AlasdairAlasdairhttps://www.blogger.com/profile/04737784638521665641noreply@blogger.comtag:blogger.com,1999:blog-8342851416423405349.post-15245772219729552912011-01-09T17:48:31.587-08:002011-01-09T17:48:31.587-08:00If you're using Python for mathematics, you sh...If you're using Python for mathematics, you should look at Sage (http://www.sagemath.com) which is based on Python. Here, for example, is Liouville's result in Sage:<br /><br />sage: n=1001<br />sage: L=[number_of_divisors(i) for i in divisors(n)]; L<br /> [1, 2, 2, 2, 4, 4, 4, 8]<br />sage: sum(L)^2, sum(i^3 for i in L)<br /> (729, 729)Alasdairhttps://www.blogger.com/profile/04737784638521665641noreply@blogger.com