On Nov 25, 2008, at 11:08 PM, Tim Lahey wrote:
Hi,
I'm comparing two results in an automated fashion and I've
run into a snag. One of the results is: asin(x/a) and
the other is calculated to be asin(x/sqrt(a^2)). If I let
Sage (well, Maxima) simplify the latter, it will give me,
On Nov 25, 2008, at 11:46 PM, Tim Lahey wrote:
On Nov 26, 2008, at 2:14 AM, Robert Bradshaw wrote:
Yes, there is.
sage: var('a')
sage: assume(a=0)
sage: sqrt(a^2)
a
Thanks.
Is there a way to do this for just a single call?
Or is one supposed to just clear the assumption after
On Nov 22, 2008, at 11:09 PM, Tim Lahey wrote:
On Nov 23, 2008, at 2:00 AM, mabshoff wrote:
It is my understand that it cannot compete with MMA or Maple there
and
various people have claimed that Maxima's integration code is better
than the code in Axiom. I do not know if that is true.
On Nov 21, 2008, at 3:44 PM, dean moore wrote:
Haven't posted anything to this list in a long time. Posting to
both lists -- unsure of proper bin.
Searched googled, couldn't find this previously reported or
solved -- sorry if I'm spamming.
Running SAGE Version 3.1.2 on Ubuntu Linux
On Nov 20, 2008, at 11:00 AM, Simon King wrote:
Hi folks,
assume that some function/method produces files on the disk. What
should a doc test look like for such functions/methods? Is there a
standard? My fear is to have doc tests that destroy user data. I'd
like to know your opinion on my
On Nov 20, 2008, at 12:04 PM, Simon King wrote:
Dear Robert,
On Nov 20, 8:45 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
a) In what directory should the files be created? [Subdirectories
of] SAGE_TMP perhaps?
Yes.
b) How can one avoid name conflicts with user data? E.g
all of maxima's functionality any
time soon.
All the best,
Stan
On Nov 19, 6:46 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Nov 18, 2008, at 11:18 PM, Stan Schymanski wrote:
Hi Robert,
Will the fix of the interaction with Maxima allow conservation of
precision of arguments passed
implement this and see if it gets a positive
review.
- Robert
Robert Bradshaw wrote:
On Nov 18, 2008, at 5:57 AM, Stan Schymanski wrote:
Ah, I see:
dummy1 = RealField(8)(0.1);dummy1
0.10
dummy2 = RealField(16)(0.1);dummy2
0.1000
latex(x*dummy1)
{0.1001 x}
latex(x*dummy2)
{0.1 x
On Nov 19, 2008, at 2:23 PM, Alex Raichev wrote:
Hi all:
I want to check if an expression A is a complex number? I tried the
obvious
sage: if A in CC:
print Yep.
but that doesn't work.
This should work for everything *except* symbolic objects. sqrt(2) is
symbolic...
The side effect is that now real numbers of different precisions all
print the same, so I'm not sure that this would be considered a fix
as the trailing zeros are intentional. There should be print modes
that one can set (globally, on the ring, or with contexts).
- Robert
On Nov 17, 2008,
Any decimal number that goes into maxima turns into a 53-bit floating
point number (at least by default), which then turns into a 53 bit
MPFR coming out. The reason all the trailing 0's are exposed is to
show how much precision is known. Maxima (as far as I know) doesn't
have the concept
On Nov 15, 2008, at 11:57 PM, pong wrote:
I was a bit reluctant to post this question here since support
shouldn't mean teaching me how to write programs. But Jason Grout
suggested me to post it here anyway.
Short snippets of code (like the one below) are very useful. It's
hard to give a
On Nov 15, 2008, at 5:02 PM, pong wrote:
According to diveintopython .extend should be faster than + since the
former does not return a value.
I was curious and tried
%timeit [ ]+[2]
100 loops, best of 3: 741 ns per loop
and
%timeit [ ].extend([2])
100 loops, best of 3: 870 ns
On Nov 14, 2008, at 3:08 PM, Jason Grout wrote:
William Stein wrote:
I did try pasting that example into sagenb.org and it gives
some weird errors involving _fast_float. Jason Grout -- maybe
you could look at why your interact appears broken?
Robert Bradshaw: I've asked a question
On Nov 14, 2008, at 3:44 PM, Jason Grout wrote:
Robert Bradshaw wrote:
It certainly could be done, but I don't know how worth it it would
be. What notation should we use. (I'd much rather have an error when
one enters an incomplete list of arguments).
In that case, let's just leave it how
.
On Nov 12, 7:56 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Nov 12, 2008, at 5:52 PM, kcrisman wrote:
put those three lines in where indicated and it will be orders of
magnitude faster for most cases, plus will handle constants, lambda
functions, etc., automatically.
fast_float is one
If one does
sage: Ii.subs(pars).variables()
(x,)
so that is fine. However,
sage: RR(Ii.subs(pars)(x=-10))
Traceback (most recent call last):
...
TypeError
which tells you what the error is (not very helpful in this case). On
a hunch
sage: CC(Ii.subs(pars)(x=-10))
2.59329101030962e-14*I
so
On Nov 12, 2008, at 5:52 PM, kcrisman wrote:
put those three lines in where indicated and it will be orders of
magnitude faster for most cases, plus will handle constants, lambda
functions, etc., automatically.
fast_float is one of Sage's coolest secrets.
Thanks :)
That brings up a
for the cities in 3D.
Thanks
On Nov 10, 3:44 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Nov 10, 2008, at 12:57 PM, acardh wrote:
One more question about this. How can I draw a line between any two
given points?
I am doing this
world = sphere((0,0,0), size=1, color='blue')
cities = [(38.7598
On Nov 10, 2008, at 11:23 AM, Nasser Abbasi wrote:
Hello;
I was just browsing something to learn about sage, and noticed this on
this web site
http://wiki.sagemath.org/sage_mathematica
where it says:
sage: [f(i) for i in range(1, 11)]
[g(1), g(2), g(3), g(4), g(5), g(6), g(7), g(8),
Robert, it's exactly what I needed. It was so easy for you, I
guess.
:o)
On Nov 9, 12:28 am, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Nov 8, 2008, at 7:52 PM, acardh wrote:
Hi,
Plotting an sphere is straightforward but I need help in how to
draw
points on the sphere. The sphere
I think what William meant to say is that lists and dictionaries are
mutable. When you do LL = L, both LL and L point to the same actual
list, so things you do to the one are reflected in the other. When
you do LL = 2*L, it's making a completely new list.
This is a Python thing, not
There are two ways to use Sage, via the notebook or via a command
prompt. Which is better depends on personal preference, but I don't
think they can be used at the same time (without starting a new copy
of Sage), as the prompt console is used by the notebook server.
To get the prompt, one
[a] and get a number field, a
looses
the choice of sign. That's changing in the next version of Sage
though,
due to work of Robert Bradshaw.
Assuming somebody reviews that patch of course (hint, hint :).
There's also a faster SR minpoly patch up as well, which should help
here a lot.
- Robert
On Oct 29, 2008, at 7:45 AM, Georg wrote:
Hi,
I'm using sage 3.1.3 on Debian system.
Is this a bug or a feature?
sage: type(5. + RDF(5)); type(RDF(5) + 5.)
type 'sage.rings.real_mpfr.RealNumber'
type 'sage.rings.real_double.RealDoubleElement'
somehow '+' ist not comutative, allthough
From: pong [EMAIL PROTECTED]
Date: Tue, Oct 28, 2008 at 9:42 PM
Subject: Re: Bug in ploting odd roots?
To: William Stein [EMAIL PROTECTED]
Hi William,
I have a similar problem and found this old post. Is there a less
complicated solution by now?
As far as I am aware, there is not.
On Oct 29, 2008, at 8:28 AM, Georg wrote:
Hi Robert,
thanks for your fast answer, just one more question,
RDF and RealField(35) are canonically isomorphic,
what does that mean exactly,
There is a bijection between them which preserves addition and
multiplication.
as far is I know,
(diff(y,x) + y - 1, y)
e^(-x)*(e^x + c)
sage: f = desolve(diff(y,x) + y - 1, y, ics=[10,2]); f
e^(-x)*(e^x + e^10)
sage: plot(f)
See calculus/desolvers for more details/examples. Hats off to
Robert Bradshaw for this.
Ah, great. That's exactly what I
On Oct 27, 2008, at 2:15 PM, cesarnda wrote:
is there a way to do that in a fancy way in pure cython?
No, the cartesian_product_iterator will still work in the context of
Sage though, as will Georg's solution.
If I needed to do this loop super fast for an arbitrary number of k,
I might
On Oct 28, 2008, at 12:38 PM, John Cremona wrote:
2008/10/28 Robert Bradshaw [EMAIL PROTECTED]:
On Oct 27, 2008, at 2:15 PM, cesarnda wrote:
is there a way to do that in a fancy way in pure cython?
No, the cartesian_product_iterator will still work in the context of
Sage though
On Oct 23, 2008, at 4:51 AM, David Møller Hansen wrote:
Is there a function for FiniteField_ext_pari objects that in the same
way as fetch_int for the FiniteField_givaro objects can give me the
field element representation of an integer?
I'm not seeing which fetch_int you're referring to
On Oct 23, 2008, at 7:57 AM, Simon King wrote:
Dear Sage team,
I have two cdef'd classes (lets call them A and B). They have some
cdef'd attributes that should be harmless, namely of type int or list
or dict. The entries of these lists/dicts may be objects of class A
though.
Let me
On Oct 21, 2008, at 10:17 PM, pong wrote:
Thanks to both Dan and William. However, Dan's result puzzled me.
Aren't they suggested that the for loop is faster?
Here is what I got:
sage: timeit('list(2*vector([random() for j in range(10)]))')
625 loops, best of 3: 332 µs per loop
sage:
On Oct 18, 2008, at 10:14 PM, Alex Ghitza wrote:
Hmmm. As far as I know you can use _ as a placeholder for a
variable, and it's meant for this kind of use (where you don't
really want to introduce a new variable name). It's strange that
it doesn't work for you. Can you post the
On Oct 16, 2008, at 2:21 AM, Harald Schilly wrote:
On Oct 16, 1:55 am, Dan Drake [EMAIL PROTECTED] wrote:
runs `kill -9' on the guest -- which
is about the same as pulling the plug -- ...
Uhm, since virtual box has a python scripting interface, a more humane
reset to snapshot functionality
On Oct 16, 2008, at 7:41 AM, Jason Grout wrote:
Creating accounts makes a barrier to entry, but it also makes it so
that
people don't mess with other people's worksheets (i.e., if I'm playing
with Sage, someone else won't come in and start changing my worksheet
around under me). So I
On Oct 14, 2008, at 1:33 PM, Martin Rubey wrote:
I believe I understood now:
sage: ?parent
Type: function
snip
Return x.parent() if defined, or type(x) if not.
I wonder why this is a function, and not a method of Parent?
Typically one uses the parent() function when
On Oct 14, 2008, at 2:02 PM, Martin Rubey wrote:
Robert Bradshaw [EMAIL PROTECTED] writes:
On Oct 14, 2008, at 1:33 PM, Martin Rubey wrote:
I believe I understood now:
sage: ?parent
Type: function
snip
Return x.parent() if defined, or type(x) if not.
I wonder why
I use xcode (OS X) and emacs. Both can be configured to
recognize .pyx files as Python files, and if you can configure your
Eclipse plugin to do the same that would probably be ideal for you
(or, even better, modify the plugin to recognize cdef methods, etc.)
On Oct 8, 2008, at 10:04 PM,
On Oct 7, 2008, at 3:58 AM, Thierry Dumont wrote:
William Stein a écrit :
If your hardware is pretty good (which the OP's hardware is), the
problem is definitely the webserver and notebook interface.
Running many sage sessions at once gets around this.
ok, if I understand correctly,
On Oct 7, 2008, at 10:59 AM, Bob Wonderly wrote:
You support people fixed my long arithmetic problem. The patch applied
and worked!
Great.
Now here is another puzzlement:
alist =
[divmod(0,6),divmod(1,6),divmod(2,6),divmod(3,6),divmod(4,6),divmod
(5,6)]
#of course that's one line
On Oct 6, 2008, at 9:37 AM, William Stein wrote:
On Mon, Oct 6, 2008 at 4:37 AM, David Joyner [EMAIL PROTECTED]
wrote:
On Mon, Oct 6, 2008 at 12:08 AM, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Is it possible to add Latex equations to Sage plots?
In 2d plots, yes, for example
On Oct 6, 2008, at 10:21 AM, Jason Grout wrote:
William Stein wrote:
2008/10/6 Thierry Dumont [EMAIL PROTECTED]:
I would like to know if someone as used Sage with undergraduate
students. My question is mainly a question about the material which
would be necessary.
We are currently
On Oct 2, 2008, at 10:43 PM, Ondrej Certik wrote:
On Thu, Oct 2, 2008 at 6:43 PM, William Stein [EMAIL PROTECTED]
wrote:
On Thu, Oct 2, 2008 at 9:31 AM, jdmuys [EMAIL PROTECTED] wrote:
Hi,
I am a total newcomer, and here is very simple high-school level
question for which I could not
On Oct 3, 2008, at 11:40 AM, William Stein wrote:
On Fri, Oct 3, 2008 at 2:36 AM, Robert Bradshaw
[EMAIL PROTECTED] wrote:
On Oct 2, 2008, at 10:43 PM, Ondrej Certik wrote:
On Thu, Oct 2, 2008 at 6:43 PM, William Stein [EMAIL PROTECTED]
wrote:
On Thu, Oct 2, 2008 at 9:31 AM, jdmuys
On Oct 3, 2008, at 12:05 PM, William Stein wrote:
I'm worried that won't work, since CC is 53-bit precision floats, so
by extension SR means you'll end up with 1.0*I rather than I.
I just meant in the sense that fixing an embedding into CC fixes the
embedding into SR, QQbar,
On Oct 1, 2008, at 12:17 PM, Mike Hansen wrote:
Hi Bob,
On Wed, Oct 1, 2008 at 12:01 PM, Bob Wonderly
[EMAIL PROTECTED] wrote:
My follow up question pertains to the patch you'all hurried up to
create. I know you didn't apply it on my Mac so how do I take
advantage
of it? Do I
On Sep 25, 2008, at 7:06 PM, Jason Grout wrote:
cesarnda wrote:
why the line:
def primes(int kmax):
is in yellow?
It's yellow because it's handling a python function call (parsing the
arguments, converting a python object to an int, ...)
If you click on the line, you can see the
On Sep 25, 2008, at 7:53 PM, cesarnda wrote:
I am using the set([]) function, and is a set of vectors, I want to
convert it to a set because I want to use the methods for sets
On Sep 25, 9:09 pm, Jason Grout [EMAIL PROTECTED] wrote:
cesarnda wrote:
is there a function that can convert a
On Sep 25, 2008, at 5:15 PM, Erik Lane wrote:
Yes, I saw that in the solution of the other one (and have changed my
plots to take this into account), but what is the advantage of the
aspect ratio default *not* being 1? I'm very curious. I'm not a
mathematician, just a student going through
On Sep 26, 2008, at 12:09 AM, Simon King wrote:
On Sep 25, 6:45 pm, cesarnda [EMAIL PROTECTED] wrote:
...
result = []
...
result.append(n)
...
if I compile in the notebook I get a html file showing me the
following lines in yellow:
def primes(int kmax):
result = []
On Sep 25, 2008, at 3:45 PM, cesarnda wrote:
in http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/ there is
the following example:
def primes(int kmax):
cdef int n, k, i
cdef int p[1000]
result = []
if kmax 1000:
kmax = 1000
k = 0
n = 2
while k kmax:
= ((PyObject *)__pyx_2);
__pyx_2 = 0;
Yes, that is correct. Is this not what you want?
On Sep 26, 2:55 am, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Sep 26, 2008, at 12:09 AM, Simon King wrote:
On Sep 25, 6:45 pm, cesarnda [EMAIL PROTECTED] wrote:
...
result
On Sep 26, 1:43 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Sep 26, 2008, at 8:21 AM, cesarnda wrote:
I already did that and I get this:
cdef list codeSet = []
__pyx_1 = PyList_New(0); if (unlikely(!__pyx_1)) {__pyx_filename =
__pyx_f[0]; __pyx_lineno = 210; __pyx_clineno
Or, if you want to do it in a single line (which does the same as the
more explicit code below)
sage: mod(520622, 998171) ^ 430085
897985
On Sep 25, 2008, at 9:43 AM, John Cremona wrote:
sage: 520622^430085 % 998171
897985
It is very much faster to do it more like this:
sage:
On Sep 25, 2008, at 5:43 PM, William Stein wrote:
On Thu, Sep 25, 2008 at 5:33 PM, Quicksilver_Johny
[EMAIL PROTECTED] wrote:
If c=sqrt(a^2+b^2)
How would I check if c is an integer in order to get a true/false
value.
I tried is_Integer(ZZ(c)), this returns true when c is an integer,
On Sep 24, 2008, at 4:42 AM, John Cremona wrote:
2008/9/24 mabshoff [EMAIL PROTECTED]:
On Sep 24, 4:15 am, Raouf [EMAIL PROTECTED] wrote:
Hi,
I want to have a numerical value of a Dirichlet character :
I have this line code in my notebook:
sage:
G = DirichletGroup(21)
chi = G.1;
On Sep 24, 2008, at 7:09 AM, vpv wrote:
Is it possible to calculate the derivative of a boolean polynomial in
Sage using PolyBoRi?
I can do this for polynomials over GF(2):
sage: R.x,y,x = PolynomialRing(GF(2),3)
sage: f = 3*x^2*y + 2*x*y + y + 9*x^2 + 5*x - 3
sage: f
x^2*y + x^2 + x +
On Sep 22, 2008, at 11:37 PM, Mike Hansen wrote:
Hello,
On Mon, Sep 22, 2008 at 11:34 PM, cesarnda [EMAIL PROTECTED] wrote:
If I do:
sage: MS = MatrixSpace(IntegerModRing(9), 5,5)
sage: G = MS([[5, 0, 0, 0, 4],[4, 5, 0, 0, 0],[0, 4, 5, 0, 0],[0,
0,4,
5, 0], [0, 0, 0, 4, 5]])
sage:
On Sep 22, 2008, at 6:09 PM, William Stein wrote:
On Mon, Sep 22, 2008 at 6:04 PM, Jason Grout
[EMAIL PROTECTED] wrote:
Bob Wonderly wrote:
Using Sage I solved a long list of equations and put the
solutions (s)
in a list; e.g.:
sage: for j in range(52,54,1):
q = slst[j]
On Sep 22, 2008, at 6:17 PM, William Stein wrote:
On Mon, Sep 22, 2008 at 6:12 PM, Robert Bradshaw
[EMAIL PROTECTED] wrote:
On Sep 22, 2008, at 6:09 PM, William Stein wrote:
On Mon, Sep 22, 2008 at 6:04 PM, Jason Grout
[EMAIL PROTECTED] wrote:
Bob Wonderly wrote:
Using Sage I solved
On Sep 17, 2008, at 10:28 AM, Simon King wrote:
Dear Team,
suppose one has data that are addressed by a pair of integers i,j.
Suppose further that the occuring values of i form a range 0,...,n.
The occuring values of j, in contrast, do not come in a range.
How should these data be
You can also install nearly any Python library by doing sage -python
setup.py
- Robert
On Sep 16, 2008, at 4:26 AM, David Joyner wrote:
Besides Timothy's suggestion, you might be able to install PIL on
top of
Sage using
sage -i PIL-1.1.5
It is listed among Sage's experimental
Try running as sage -gdb , which will catch the error. Then you can
type bt at the prompt to get a c traceback.
On Sep 15, 2008, at 2:41 PM, Simon King wrote:
Dear team,
in some Cython module, i am raising an error, as i often did without a
problem. But this time, raising the error
On Sep 15, 2008, at 3:56 PM, Simon King wrote:
Dear Robert,
On Sep 16, 12:46 am, Robert Bradshaw [EMAIL PROTECTED]
wrote:
Try running as sage -gdb , which will catch the error. Then you can
type bt at the prompt to get a c traceback.
I don't understand what the following tells me.
When
On Sep 15, 2008, at 4:22 PM, Simon King wrote:
Dear Robert,
simply for testing, i raise an error as soon as the init-method of my
class is called. So, for the moment the code looks like this:
class COHO:
Docstring
def __init__(self, *args, **kwds):
raise
On Sep 13, 2008, at 12:26 PM, nk wrote:
Hello,
Sorry for asking this here but I couldn't find anything in the help
files - Is Sage able to find the domain and range of a function? And
if so, how?
Not that I am aware of. This is probably an insolvable problem in
general, and of course the
On Sep 7, 2008, at 2:11 AM, Jannick Asmus wrote:
Hi,
as newbie I am encountering some IT problems with SAGE causing heavy
crashes. I am not sure if this is the right place to ask. But
answers on
this are highly appreciated.
The VM Player crashed heavily on my WinXP machine after using
On Sep 7, 2008, at 6:56 AM, Jason Merrill wrote:
On Sep 7, 6:30 am, John Cremona [EMAIL PROTECTED] wrote:
It should be lightly easier than it is to convert a vector of
length n
to either an nx1 matrix or a 1xn matrix:
sage: v = vector(srange(5))
sage: v
(0, 1, 2, 3, 4)
sage:
On Sep 4, 2008, at 6:37 AM, William Stein wrote:
On Thu, Sep 4, 2008 at 3:53 AM, Maike
[EMAIL PROTECTED] wrote:
Hello,
I just upgraded from 3.0.5 to version 3.1.1 and several things aren't
working any more:
1. sliders aren't showing when used with the interact-functionality.
It
On Sep 1, 9:52 pm, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Sep 1, 2008, at 3:18 AM, Simon King wrote:
Hi,
one hint for doing *fast* computations:
Use Cython, rather than pure Python!
Certainly!
From my point of view, Cython is one of the main strengths of Sage:
You can do
On Sep 1, 2008, at 3:18 AM, Simon King wrote:
Hi,
one hint for doing *fast* computations:
Use Cython, rather than pure Python!
Certainly!
From my point of view, Cython is one of the main strengths of Sage:
You can do your computations with C data types, and you should do so,
because
On Sep 1, 2008, at 1:22 PM, Robert Dodier wrote:
Ondrej Certik wrote:
So what things do they have wrong? So that we can learn from it.
* all functions are capitalized
* BumpyCaseIsHardToRead
* square brackets for function arguments
* two square brackets for subscripts
*
On Aug 31, 2008, at 12:06 AM, vakaras wrote:
Hello,
I tried to plot Mandelbrot set using sage, but
function atkrenta works too long (sometimes
longer than 1 second). It seems that the main
problem is z.real() and z.imag() methods. Is
here any method to make this to work fast
enough?
On Aug 30, 2008, at 4:46 PM, Robert Dodier wrote:
Robert Bradshaw wrote:
On Fri, 29 Aug 2008, Jason Grout wrote:
Jason Merrill wrote:
The Mathematica syntax is Hold[Integral[x,{x,0,1}]]. This remains
unevaluated until it is wrapped with an Evaluate[]. The nice thing
about this syntax
On Aug 29, 2008, at 4:53 AM, Tim Lahey wrote:
On Aug 29, 2008, at 6:24 AM, William Stein wrote:
On Fri, Aug 29, 2008 at 2:46 AM, David Joyner [EMAIL PROTECTED]
wrote:
On Fri, Aug 29, 2008 at 3:07 AM, Burcin Erocal
[EMAIL PROTECTED] wrote:
This is not supported in Sage at the
On Fri, 29 Aug 2008, Jason Grout wrote:
Jason Merrill wrote:
On Aug 29, 3:07 am, Burcin Erocal [EMAIL PROTECTED] wrote:
On Thu, 28 Aug 2008 15:28:03 -0400
Tim Lahey [EMAIL PROTECTED] wrote:
Hi,
Maple has a really useful feature of inert integrals
and derivatives. Basically, the
On Fri, 29 Aug 2008, Martin Albrecht wrote:
On Friday 29 August 2008, Jason Grout wrote:
Martin Albrecht wrote:
For various objects and various software systems (like mathematica,
magma, maxima, etc.), we have a _mathematica_init_, _magma_init_, etc,
which convert an expression into syntax
On Aug 28, 2008, at 6:47 AM, kcrisman wrote:
Thanks for the replies (and the great work!). Some followup below:
Nope, none of these are fixed by the new changes. I tried Maple and
it did the same thing -- I don't know what Mathematica does. You can
do these as a workaround:
On Thu, 28 Aug 2008, MB wrote:
I'm converting over from mathematica to Sage. One thing I need to do
is write a large number of expressions to an ASCII file as C code, or
something reasonably close. Mathematica has the CForm[] operator for
this, which doesn't quite make C code but is
On Tue, 26 Aug 2008, William Stein wrote:
On Tue, Aug 26, 2008 at 5:34 PM, Jason Merrill [EMAIL PROTECTED] wrote:
I couldn't find a double factorial function in sage. That is,
n!! == n*(n - 2)*(n - 4)...
Does Sage have a double factorial somewhere that I'm missing. If not,
could it?
On Aug 21, 2008, at 8:04 AM, William Stein wrote:
On Thu, Aug 21, 2008 at 5:06 AM, Stan Schymanski
[EMAIL PROTECTED] wrote:
On Aug 21, 6:30 am, William Stein [EMAIL PROTECTED] wrote:
There are 3.1.1 binaries for every architecture except windows.
I noticed that the binaries for Mac
On Aug 19, 2008, at 4:31 AM, Stan Schymanski wrote:
I don't know if I have a mathematical blackout, but in my opinion, an
inequality such as the below one should be squarable, as long as all
variables are positive. Is this just not implemented, or am I trying
something stupid? Thanks already
On Jul 25, 2008, at 8:43 AM, hypermonkey2 wrote:
Thanks again for the reply, but i am running WINDOWS, so the
directories
/usr/local/sage/
still only exist within the VMPlayer. Can i find them in WINODWS for a
simple copy paste?
The short answer is No.
I think the way to copy files back
On Jul 18, 2008, at 12:04 PM, aniura wrote:
Hi,
I have no experience in sage, I began to use it two days ago because I
need arbitrary precision arithmetic and Octave is not so god for
that.
I wanted to write a script where I evaluate a function which is also
written in a script. this can
On Jul 20, 2008, at 1:24 PM, Shing Hing Man wrote:
If I submit a command that takes a long time to run,
eg
(1) http://localhost:8000/simple/compute?session=(session)
code=factor(2^1000
-1)
then the immediately returned JSON will have status equals computing.
I have modified my Java
On Jul 18, 2008, at 1:05 PM, Stefano Maggiolo wrote:
I'd like to solve some systems of linear equation with coefficients
and unknown in the integers modulo Z_n. I'm aware of solve_mod, but:
1. it's slow;
2. returns a list of solutions and not a list of generators/relations
for the
Sage comes with all the modules it needs, as well as Python itself.
On Jul 14, 2008, at 10:57 AM, JonasMo wrote:
Where can I get all the Python modules SAGE requires from? I am using
Windows XP and Python 2.5, if this should be important.
On Jul 11, 2008, at 6:32 AM, Brendan Arnold wrote:
Hi there,
Q: How do you evaluate or convert a surd value generated by SAGE into
numerical output?
A: Use the .n() method. i.e.
sage: sin(10)
sin(10)
sage: sin(10).n()
-0.544021110889370
This bugged me for ages when trying to export
On Jul 11, 2008, at 7:55 PM, Greg Landweber wrote:
I am running a Sage notebook server for my students. Every time one of
my students creates an account, the notebook sends the student an
e-mail with a link to confirm their e-mail address. However, that
e-mail gets bounced back to the server
On Jul 7, 2008, at 1:59 PM, Alejandro Jakubi wrote:
On Jul 7, 4:25 pm, Simon King [EMAIL PROTECTED] wrote:
Is there any problem up to this point? Probably not.
Yes, all these examples, and much more give the same error message.
Hmm... could you paste the whole traceback?
- Robert
Yes, there will definitely be code to do this. I've got a lot of
ideas but haven't gotten around to it because most of my sage
development efforts been spent on coercion.
- Robert
On Jul 5, 2008, at 12:16 AM, Thierry Dumont wrote:
Hello,
My question is: is there / will there be some
On Jul 4, 2008, at 1:52 PM, John H Palmieri wrote:
On Jul 4, 10:53 am, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Jul 4, 2008, at 10:44 AM, John H Palmieri wrote:
So I'm very confused. Any ideas what I should look at to try
to fix
this?
Yes, Sage caches some information so
On Jul 5, 2008, at 12:50 PM, John H Palmieri wrote:
On Jul 5, 10:08 am, Robert Bradshaw [EMAIL PROTECTED]
wrote:
On Jul 4, 2008, at 1:52 PM, John H Palmieri wrote:
I still don't understand two things: why the gen method is being
used,
and why if I multiply an element of SteenrodAlgebra
On Jul 5, 2008, at 12:42 PM, John H Palmieri wrote:
Ah, it looks like your __eq__ method is assuming that self and
other
are elements of the steenrod algebra. There are two solutions to
this:
1) Use __cmp__ which (in Sage) will ensure that self and other have
the same parent before
On Jul 4, 2008, at 7:12 AM, John H Palmieri wrote:
I'm running into a coercion problem. I'm trying to define a class
SteenrodAlgebra (based on the Algebra class); there should be one
Steenrod algebra for each prime number p, and it is an algebra over
GF(p). For example, you can do
sage:
On Jul 3, 2008, at 3:13 PM, phil wrote:
On Jul 2, 8:33 pm, Mike Hansen [EMAIL PROTECTED] wrote:
sage: var('x,y')
(x, y)
sage: t = x^2 + y^2
sage: type(t)
class 'sage.calculus.calculus.SymbolicArithmetic'
sage: t._operator
built-in function add
sage: t._operands
[x^2, y^2]
sage:
On Jun 29, 2008, at 6:54 PM, David Joyner wrote:
Thanks but although that eliminated one traceback error, it created
another.
Also, I'm worried that hacking Mike Hansen's combinatorial_algebra
module
will create much more serious problems in other parts of SAGE.
The apparent inability
On Jun 28, 2008, at 9:33 AM, David Joyner wrote:
On Sat, Jun 28, 2008 at 11:00 AM, John Cremona
[EMAIL PROTECTED] wrote:
It seems that what Dan Bump's instructions did not specify is what
properties the class assigned to ._combinatorial_class must have.
And it needs something which
On Jun 26, 2008, at 7:52 AM, Rose wrote:
Hi,
I want to save several (~ 100) parametric_plot3d drawn with Tachyon
in .png format. I want to avoid to save them manualy one by one. I
tryed with the command save(), but it didn't work (the help(save),
save? and the documentation don't help me
601 - 700 of 724 matches
Mail list logo
