Nick Alexander ncalexan...@gmail.com writes:
On 11-Oct-10, at 6:53 PM, Minh Nguyen wrote:
Hi Martin,
On Tue, Oct 12, 2010 at 12:21 AM, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
Dear all,
I'm currently looking at sage-mode for emacs, but fail to find
documentation. C-h m
Martin Rubey martin.ru...@math.uni-hannover.de writes:
I just discovered
http://trac.sagemath.org/sage_trac/ticket/8978
does this imply that the binary on sagemath provided for suse 11.1 will
not work on suse 11.2?
It seems it doesn't! Below what happens. Any cure? Is it known which
Dear all,
I'm currently looking at sage-mode for emacs, but fail to find
documentation. C-h m doesn't really reveil much.
(or is there another canonical choice to use sage from within emacs?)
I should add: this is mainly for a course I'm going to give this term...
Thanks,
Martin
--
To post
I just discovered
http://trac.sagemath.org/sage_trac/ticket/8978
does this imply that the binary on sagemath provided for suse 11.1 will
not work on suse 11.2?
Many thanks,
Martin
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send
Mike Hansen mhan...@gmail.com writes:
I'm not sure whether you saw my answer yet... It shows that you can have
full evaluation (as in Python), and still work modulo n.
William was just saying that the mod function in
mod(2^(2^517)+1,84977118993*2^520+1) couldn't easily recognize of the
Jaakko Seppälä jaakko.j.sepp...@gmail.com writes:
True. I was just thinking that why Sage won't use the law of
congruences to evaluate the expression. 84977118993*2^520+1 is not too
large number to fit into the memory. Therefore one can use laws of
congruences to evaluate
William Stein wst...@gmail.com writes:
2010/1/27 Jaakko Seppälä jaakko.j.sepp...@gmail.com:
True. I was just thinking that why Sage won't use the law of
congruences to evaluate the expression. 84977118993*2^520+1 is not too
large number to fit into the memory. Therefore one can use laws of
ceterum censeo 2:
The problem -- which is a serious one -- is that Sage's symbolic
integration is by default done using Maxima (this is currently the
main way in which Maxima is used in Sage; the other big way is for
solving symbolic equations).
For my ears (well, eyes :-) this sounds like
Robert Bradshaw rober...@math.washington.edu writes:
Sage has an input form as well:
sage: R.t = QQ[]
sage: sage_input(t^3-t)
R.t = QQ[]
t^3 - t
sage: R.t = GF(101)[]
sage: sage_input(random_matrix(ZZ, 2, 2) + t)
R.t = GF(101)[]
matrix(R, [[t, 1], [96, t + 98]])
Oh, this is wonderful!
William Stein wst...@gmail.com writes:
On Sun, Dec 27, 2009 at 12:42 AM, Martin Rubey
martin.ru...@math.uni-hannover.de wrote:
ceterum censeo 2:
The problem -- which is a serious one -- is that Sage's symbolic
integration is by default done using Maxima (this is currently the
main way
Jason Grout jason-s...@creativetrax.com writes:
3. Use an alternative system for evaluating the integral, like sympy or
mathematica_free
ceterum censeo:
sage: fricas.integrate('sec(t)*tan(t)','t=0..%pi/3','noPole')
1
the noPole argument instructs FriCAS to ignore possible poles that the
William Stein wst...@gmail.com writes:
I admit however, that calling FriCAS from sage is very awkward, since
the interface is absolutely dumb.
Could you please give constructive criticism instead? I for one
appreciate the work Bill Page did at Sage Days 2 to write an axiom
interface. I
William Stein wst...@gmail.com writes:
On Mon, Dec 7, 2009 at 11:04 AM, Matt Bainbridge
bainbridge.m...@gmail.com wrote:
Thanks, William!
I guess so far it only works over Q?
--Matt
It calls off to PARI, so it probably works (or can trivially be made
to work) over any base that PARI
kcrisman kcris...@gmail.com writes:
Of course, it would be worth seeing whether one of the other CASs can
solve this one exactly.
possibly FriCAS can, it seems:
(2) - DEiii := %pi * (39/100*y t+ 1/2)^2* D(y t,t) + a * sqrt(2*g*y t)
2 ,
William Stein wst...@gmail.com writes:
The above definition of binomial is documented if you type binomial?
in Sage. This is also arguable the standard usage of binomial,
since it is the same in Mathematica, Maple, Maxima, Pari, GAP, and
Magma:
sage: mathematica('Binomial[-7,1]')
-7
William Stein wst...@gmail.com writes:
FriCAS give 0 for the input above, *but* this is only half of the story.
In FriCAS (and Axiom, and I believe Sage too), the answer of a
computation depends on the domain of the input. Eg.:
(1) - 0::INT^0::NNI
(1) 1
Martin Rubey martin.ru...@math.uni-hannover.de writes:
Are you writing at length about 0^0 only by analogy to give an example
of a function F(x) such that the value of F depends on the parent (or
type) of x such that applying F does not commute with some natural
inclusion of sets
Minh Nguyen nguyenmi...@gmail.com writes:
I'm using Ubuntu 9.04.
Before installing FriCAS, make sure you first install Clisp:
sudo apt-get install clisp
Isn't sage meanwhile providing ecl? That should be better than clisp, I
think.
In any case,
sudo sage -i fricas-1.0.3.p0
is
William asked me to forward his reply...
(One remark: William always developed for Axiom. In Sage, the variant
of Axiom usually provided is FriCAS. To the best of my knowledge, all
libraries developed for Axiom is provided by FriCAS as well.)
William Sit wy...@sci.ccny.cuny.edu writes:
Dear
Daniel Bearup daniel.diff...@googlemail.com writes:
Apologies if this is the wrong place to ask this question.
Does SAGE incorporate support for differential algebra? That is can it
handle differential rings/ideals and does it have an implementation of
the Rosenfeld-Groebner and Ritt
If you are running longer jobs with fricas, you should consider
switching to a faster lisp implementation. For FriCAS, clisp is
aboutthe slowest.
from the INSTALL file of FriCAS:
All Lisp impementations should give essentially the same
functionality, however performance (speed) may
mailing list, so you get
help quickly.
On Jul 24, 3:36 am, Martin Rubey martin.ru...@math.uni-hannover.de
wrote:
If you are running longer jobs with fricas, you should consider
switching to a faster lisp implementation. For FriCAS, clisp is
aboutthe slowest.
Well, the speed it runs at now
Hi all,
is there any way to get a recent sage version running on my laptop?
output of /proc/cpuinfo below, operating system is linux ubuntu 8.04.2.
compiling from source won't work anymore (3.4 was already rather
difficult. Or did things improve there?), and the binaries from
sagemath for
William Stein wst...@gmail.com writes:
3. Having var at all is a compromise -- many symbolic calculus users
would prefer for undefined vars to just magically be defined, as is
done in Mathematica, Maple, Maxima, Axiom (?), etc.
In Axiom (FriCAS, OpenAxiom), there is a distinction between
Stan Schymanski schym...@gmail.com writes:
Hi Martin,
I can't imagine that such a change in the result is intended
behaviour of a simplify action. If it is, one should either stay
away from it if one is planning to do any numeric calculations or
understand when to use it and when not. I'm
Martin Rubey martin.ru...@math.uni-hannover.de writes:
I did not want to say that sqrt(a*b)=sqrt(a)*sqrt(b) is always good
behaviour, but there are circumstances where you want it. Eg., it
seems that it's necessary for symbolic integration, where you are
really working in a differential
Maurizio maurizio.gran...@gmail.com writes:
What is the reason to have such a bugged function?
I wouldn't consider
sage: var('omgo zr ys cz')
(omgo, zr, ys, cz)
sage: omgo = (sqrt(-zr^2 + 2*ys*zr + (2*cz - zr)^2 - 2*ys*(2*cz - zr))
+ 2*zr- 2*cz)/(2*zr - 2*cz)
sage:
William Stein [EMAIL PROTECTED] writes:
* Axiom?
Axiom does *elementary* integration. That is, if the Risch algorithm applies,
it will find the result except in a few cases. It does have some pattern
matching abilities, but these are not really worth mentioning.
FriCAS (axiom fork,
Jason Grout [EMAIL PROTECTED] writes:
Martin Rubey wrote:
I tried to demonstrate Cayley Hamilton in Sage, but failed. Here is what I
tries:
sage: f = function('f')
sage: m = matrix([[f(i,j) for j in range(2)] for i in range(2)])
sage: p=SR[x](m.characteristic_polynomial('x
Jason Grout [EMAIL PROTECTED] writes:
Why is your coefficients different from mine?
I specifically asked for the coefficient of x. You just asked for the
coefficients, but didn't specify what variable was the variable of your
polynomial.
OK, I think I understand now: Sage interprets
Alex Raichev [EMAIL PROTECTED] writes:
Hi all:
Is there Sage function that computes Taylor expansions for
multivariate functions?
If you are willing to install the optional fricas package:
sage: reset()
sage: X=axiom('x::TS FRAC INT')
sage: Y=axiom('y::TS FRAC INT')
sage:
I get the following very weird result:
sage: A=axiom.series(z,z=0)
sage: A
sage: A
z
sage: B = (1/(1-A^2))
sage: B
246810 11
1 + z + z + z + z + z + O(z )
sage: A
246810 11
1 + z + z + z + z + z + O(z )
sage: A
z
sage:
Bill Page [EMAIL PROTECTED] writes:
Expect.__init__(self,
name = 'axiom',
prompt = '\([0-9]+\) - ',
command = sh -c 'axiom -nox -noclef | cat',
Apart from modifying axiom.py, do I have to do anything else? Compiling,
mabshoff [EMAIL PROTECTED] writes:
On Oct 28, 9:55 am, Martin Rubey [EMAIL PROTECTED] wrote:
SNIP
After changing axiom.py in the $SAGE_ROOT/devel/sage tree run ./sage -
b from $SAGE_ROOT. Note that you are changing the main Sage library
and that the repo then has outstanding
mabshoff [EMAIL PROTECTED] writes:
Hm, not really. For my students, it's a site wide installation (and I'm not
root) and it was already quite an effort to get sage running in the first
place.
All you need to do is
./sage -i fricas-1.0.3.p0
This doesn't touch anything outside
mabshoff [EMAIL PROTECTED] writes:
You need to have write permission to the $SAGE_ROOT tree to install
any spkg.
Would be really nice, if this could be changed in future. Suppose university
provides sage, but without package SupiDupi, which is really super trooper.
Then I need to install all
Jason Grout [EMAIL PROTECTED] writes:
var(t)
y=function('y',t)
solve(diff(y,t,2)-2*diff(y,t)+diff(y,t)==3, y(t))
to solve for y(t).
Doesn't Axiom work this way?
Yes. (well, FriCAS is what I'm developing) Actually, one thing which is really
nice about FriCAS is that it's very
How come that solve doesn't solve this?
sage: solve(sqrt(sqrt(4*x^2 + 1) - x^2 - 1), x)
[x == -sqrt(sqrt(4*x^2 + 1) - 1), x == sqrt(sqrt(4*x^2 + 1) - 1)]
sage: axiom.solve(sqrt(sqrt(4*x^2 + 1) - x^2 - 1), x)
+-+ +-+
[x= 0,x= \|2 ,x= - \|2 ]
Furthermore, is there a way to
Dear William,
thanks for your quick answer, even though it doesn't make me too happy. I'm
having a hard time here, I must admit. So far I thought that sage would do
most things out of the box, and it's only inconsistent (eg., arguments to plot,
plot3d and integrate vary wildly. There are
David Joyner [EMAIL PROTECTED] writes:
On Mon, Oct 27, 2008 at 1:59 PM, Martin Rubey [EMAIL PROTECTED] wrote:
Dear William,
thanks for your quick answer, even though it doesn't make me too happy. I'm
having a hard time here, I must admit. So far I thought that sage would do
most
I tried to compile Sage from source, but it ran out of memory compiling
linbox. Is there a workaround?
Martin
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
As advised, I removed the broken installation I obtained via sage -upgrade and
installed sage 3.1.2.
Plotting worked nicely, until roughly 5 minutes ago. Now I get:
---
[EMAIL PROTECTED]:~$ sage
William Stein [EMAIL PROTECTED] writes:
On 21 Oct 2008 18:57:12 +0200, Martin Rubey [EMAIL PROTECTED] wrote:
As advised, I removed the broken installation I obtained via sage -upgrade
and
installed sage 3.1.2.
Plotting worked nicely, until roughly 5 minutes ago. Now I get
William Stein [EMAIL PROTECTED] writes:
Please paste the output of
cat /proc/cpuinfo
into an email response.
[EMAIL PROTECTED]:/tmp$ cat /proc/cpuinfo
processor : 0
vendor_id : GenuineIntel
cpu family : 6
model : 11
model name : Mobile Intel(R)
William Stein [EMAIL PROTECTED] writes:
Thanks. Here's are the flags for the cpu where the binary was built:
flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge
mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss nx lm
constant_tsc up pni ds_cpl ssse3 cx16 lahf_lm
mabshoff [EMAIL PROTECTED] writes:
On Oct 16, 7:33 pm, Burcin Erocal [EMAIL PROTECTED] wrote:
On 16 Oct 2008 20:21:55 +0200
Hi Martin,
Martin Rubey [EMAIL PROTECTED] wrote:
Some of my students complain that the vmware image of sage seems to
use english keyboard. Is there a way
William Stein [EMAIL PROTECTED] writes:
UPDATE:
using
dpkg-reconfigure console-setup works.
What *precisely* works?
That the key z prints a z and not a y in the console, and all the other
keys seem to be in the right place, too.
Where would be the most useful place to add this
William Stein [EMAIL PROTECTED] writes:
On Mon, Oct 20, 2008 at 6:20 AM, Martin Rubey [EMAIL PROTECTED] wrote:
William Stein [EMAIL PROTECTED] writes:
UPDATE:
using
dpkg-reconfigure console-setup works.
What *precisely* works?
That the key z prints a z and not a y
I am preparing the course for next week, but:
sage: plot(sin x, (-1,1))
File ipython console, line 1
plot(sin x, (-Integer(1),Integer(1)))
^
SyntaxError: invalid syntax
sage: plot(sin(x), (-1,1))
Alex Ghitza [EMAIL PROTECTED] writes:
The correct syntax is sin(x), not sin x. And so the following works:
sage: plot(sin(x), (-1,1))
please reread what I typed. Yes I made this error, but after that, I used the
correct syntax.
Martin
Some of my students complain that the vmware image of sage seems to use english
keyboard. Is there a way to configure this?
(I do not own a windows machine, so I cannot try it...)
Martin
--~--~-~--~~~---~--~~
To post to this group, send email to
Martin Albrecht [EMAIL PROTECTED] writes:
On Tuesday 14 October 2008, sonium wrote:
((a, b, 0, 0),
(b,-a,b,0),
(0,b,a,b),
(0,0,b,-a))
Hi, try this:
sage: A.echelon_form() # row_reduction by constant entries only
sage: A.echelon_form('frac') # over the fraction field
sage:
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? (Am I right that
all Sage parents inherit from Parent? Would be great to know this)
Set_object
William Stein [EMAIL PROTECTED] writes:
On Tue, Oct 14, 2008 at 4:15 AM, Martin [EMAIL PROTECTED] wrote:
Am I doing something wrong in the session below?
I guess so, given the error messages.
I admit that I do not understand python types and methods yet. When
can I apply the
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 this is a function, and not a method
Robert Bradshaw [EMAIL PROTECTED] writes:
Typically one uses the parent() function when one has an element
(such as an integer) and wants it's Parent. This is why it's not an
element of the Parent.
Hm, I do not understand that. Why wouldn't one want to use 5.parent (),
for example?
56 matches
Mail list logo
