mabshoff wrote:
>> I think this should be documented somewhere so others don't fall into
>> the same trap. Thanks.
>
> Cool. Thanks for telling us - I have made this #5961.
Glad to be of some assistance. BTW, the .pydistutils.cfg will affect
any new spkg installs also since distutils will alw
On May 2, 1:25 am, Prabhu Ramachandran wrote:
> mabshoff wrote:
> >> I think this should be documented somewhere so others don't fall into
> >> the same trap. Thanks.
Hi,
> > Cool. Thanks for telling us - I have made this #5961.
>
> Glad to be of some assistance. BTW, the .pydistutils.cfg w
mabshoff wrote:
>> So one option would be to backport the patch to the Python version you
>> ship and always invoke setup.py such that it ignores the
>> .pydistutils.cfg. Of course, a simple test script that looks for the
>> file and warns the user (like the macports warning/error) would also wor
On Fri, May 1, 2009 at 5:13 PM, mabshoff wrote:
>
> While going over the open tickets in 4.0 I noticed this ticket:
>
> #5943 (Sage 3.4.2.a0: prime_pi(2^50) segfaults)
>
> If someone could take a stab at that it would be nice since that is
> brand new code and ought to be a little bit more stab
rjf,
On a number of your points I agree (see below). However, I think
there is one significant problem with your point of view. In my
roughly 30 years of experience as a chemist and professor using
software for:
1) computations
2) writing
3) database work
4) data acquisition
5) data analysis/re
"We never have time to do it right, but always have time to do it again."
from: http://www.netbeans.org/kb/60/uml/why-model.html
I do not support personally the idea of rewriting/replacing maxima but
the discussions remembered me the words above. This is why I mostly
spent my large percent of time
On May 2, 6:15 am, Jonathan wrote:
snip
[How programs written by application specialists in your area and in
others have been more useful than programs written by others not
familiar with the application area]
Sure, this is true. It is certainly true of computer algebra systems
where (fo
Great report!
David and I are now at the East Coast Computer Algebra Day which
followed his conference, and David Bailey is speaking about PSLQ. Any
sense on the status of http://trac.sagemath.org/sage_trac/ticket/853
? It seems like this is one of the few things Maple etc. have that
Sage does
On May 2, 10:06 am, rjf wrote:
perhaps I've missed something?
Well, you've missed so much that you clearly just enjoyed writing a
flame.
I use Sage for a number of research purposes for which it is the only
system that integrates all the things I need (for example, gfan). For
me, speeding up
mark mcclure wrote:
> There's a lovely little article in the February 2009 issue
> of the monthly on using integrals to approximate pi. The
> author "discovers" some nice rational approximations of pi
> by systmeatically searching through integrals of the
> form
>
> integrate(
> (x^m * (1 -
Hello
> Sure, this is true. It is certainly true of computer algebra systems
> where (for example) relative large amounts of effort are devoted to
> parts of systems which are pretty much doomed to be of almost no use
> except demonstrations. Simple example: almost no one other than
> freshman c
To everyone participating in this thread:
PLEASE LET IT GO.
This is a list discussing the development of sage, both technical and
social aspect. Is this thread helping? Is this thread significantly
different from previous incarnations? Have any of those threads
helped the sage project?
Hi,
On Sun, Apr 26, 2009 at 7:43 PM, Tim Lahey wrote:
> I do it from a mathematical perspective. The code to do the variation
> itself is
Thanks Tim. I played around further with current Sage to see what
stuffs need to be improved in implementing functional derivative in Sage.
I followed t
On May 2, 1:02 pm, Robert Dodier wrote:
> Maybe a different example is needed; Maxima can now
> compute such integrals.
Thanks Robert,
I did see on the Maxima discussion list back on February 20
that CVS Maxima could do these integrals. However, I checked
Maxima 5.18.1 on my Mac laptop and the
Hi,
I had previously been interested in implementing delta dirac function
in pynac, especially for Laplace transform, so maybe I can give you a
couple of references.
First of all, the (quite long) thread about this in the sage-devel
group:
http://groups.google.com/group/sage-devel/browse_frm/th
On May 2, 2:58 am, Alex Ghitza wrote:
> On Fri, May 1, 2009 at 5:13 PM, mabshoff wrote:
>
> > While going over the open tickets in 4.0 I noticed this ticket:
>
> > #5943 (Sage 3.4.2.a0: prime_pi(2^50) segfaults)
>
> > If someone could take a stab at that it would be nice since that is
> > br
On Fri, May 01, 2009 at 10:32:41AM -0700, Brian Granger wrote:
> I bring this up because I think we need to have better reasons about
> why open source is important - arguments that are compelling to folks
> who have been working successfully for years without reading the
> source. I don't know w
On May 2, 1:00 pm, mabshoff wrote:
> On May 2, 2:58 am, Alex Ghitza wrote:
> > I played around with prime_pi() for a while, both on sage.math and on
> > my laptop at the office (macbook running 32-bit archlinux). I didn't
> > manage to get a segfault on either machine with prime_pi(2^50).
On Sat, May 2, 2009 at 12:54 PM, Maurizio wrote:
>
> Hi,
>
> I had previously been interested in implementing delta dirac function
> in pynac, especially for Laplace transform, so maybe I can give you a
> couple of references.
>
> First of all, the (quite long) thread about this in the sage-devel
Alex Ghitza wrote:
> On Fri, May 1, 2009 at 5:13 PM, mabshoff wrote:
>> While going over the open tickets in 4.0 I noticed this ticket:
>>
>> #5943 (Sage 3.4.2.a0: prime_pi(2^50) segfaults)
>>
>> If someone could take a stab at that it would be nice since that is
>> brand new code and ought to
On May 2, 2:44 pm, "Dr. David Kirkby" wrote:
> Alex Ghitza wrote:
Hi David,
> > I'm pretty sure that the sage.math answer is more likely to be the
> > right one. You can maybe guess from the timings why I didn't try
> > prime_pi(2^51). I have, however, tried smaller values. I'm going to
Alex Ghitza wrote:
> On Fri, May 1, 2009 at 5:13 PM, mabshoff wrote:
>> While going over the open tickets in 4.0 I noticed this ticket:
>>
>> #5943 (Sage 3.4.2.a0: prime_pi(2^50) segfaults)
>>
>> If someone could take a stab at that it would be nice since that is
>> brand new code and ought to
On Sat, May 2, 2009 at 2:50 PM, mabshoff wrote:
>
>
>
> On May 2, 2:44 pm, "Dr. David Kirkby" wrote:
>> Alex Ghitza wrote:
>
> Hi David,
>
>
>
>> > I'm pretty sure that the sage.math answer is more likely to be the
>> > right one. You can maybe guess from the timings why I didn't try
>> > prim
On May 2, 3:52 pm, William Stein wrote:
> On Sat, May 2, 2009 at 2:50 PM, mabshoff wrote:
> > The suggestion then was to implement something on top of the range
> > computed with floats using MPFR for example, but we will see what
> > happens. I am sure that if I asked if someone needed to
This is such an amusing thread. Try re-reading the thread as if everyone
were arguing that "we should improve Maxima because it is open source
and many people can improve upon it". Sure, you'd have to learn lisp
but Guido argues that python is lisp, so is the learning curve so steep?
On average o
On Sat, May 2, 2009 at 10:34 AM, Nick Alexander wrote:
>
> To everyone participating in this thread:
>
> PLEASE LET IT GO.
>
> This is a list discussing the development of sage, both technical and
> social aspect. Is this thread helping? Is this thread significantly
> different from previous in
mabshoff wrote:
ed smaller values. I'm going to
>>> put that data up on the trac ticket.
>> Mathematica 6 (on a Sun SPARC) gives an answer in far less time than Sage:
>>
>> In[3]:= PrimePi[2^50]
>>
>> PrimePi::largp:
>> Argument 1125899906842624 in PrimePi[1125899906842624]
>> is too la
I've just returned from the NSF conference.
There was a big push for teaching, especially related to CAS. I suggested
a joint effort with the game industry. The idea would be to use a game
like the bridge building game (www.bridgebuilder-game.com) and a CAS.
The idea of the bridge game is to con
On May 1, 6:54 am, Kiran Kedlaya wrote:
> Clean build on 64-bit Fedora 10 (Opteron) fails one doctest:
>
> sage -t "devel/sage/sage/sets/primes.py"
> **
> File "/opt/sage/sage-3.4.2.rc0/devel/sage/sage/sets/primes.py", line
>
>
> For the record: This is now #5966 and will be fixed in 3.4.2.final.
It also has been #5959, with a patch, since yesterday morning -
figured if I caused the trouble, I should fix it :) That doesn't
address "needlessly starting Maxima" but unfortunately I won't be able
to address that til at
On May 2, 6:39 pm, kcrisman wrote:
> > For the record: This is now #5966 and will be fixed in 3.4.2.final.
>
> It also has been #5959, with a patch, since yesterday morning -
> figured if I caused the trouble, I should fix it :) That doesn't
> address "needlessly starting Maxima" but unfortuna
mabshoff wrote:
>> He told me Mathematica can go up to about 2^45 or so, but not beyond.
>
> At least for MMA 6.0 on linux x86-64 the limit seems to be around
> 2^47:
As I said in the other post, the limit is PrimePi[249].
> MMASage
>
> 2^44: 18.04 110.88
On Sat, May 2, 2009 at 11:42 PM, Dr. David Kirkby
wrote:
>
> mabshoff wrote:
>
>>> He told me Mathematica can go up to about 2^45 or so, but not beyond.
>>
>> At least for MMA 6.0 on linux x86-64 the limit seems to be around
>> 2^47:
>
> As I said in the other post, the limit is PrimePi[24999
mabshoff wrote:
>> He told me Mathematica can go up to about 2^45 or so, but not beyond.
>
> At least for MMA 6.0 on linux x86-64 the limit seems to be around
> 2^47:
As I said in the other post, the limit is PrimePi[249].
> MMASage
>
> 2^44: 18.04 110.88
34 matches
Mail list logo
