[sage-support] Re: Sage 7.0 in virtualbox with jupyter notebook, interact not working

2016-03-08 Thread jamedrano
ne starts the new Juyyter notebook > $HOME/sage/sage --notebook=jupyter --ip='*' --port=8000 >& $LOG > snip off --- > > If you edit it according to the comments (and reboot the VM) you can > switch between the two > > > > On Tuesd

[sage-support] Re: Sage 7.0 in virtualbox with jupyter notebook, interact not working

2016-03-08 Thread jamedrano
t; > If you edit it according to the comments (and reboot the VM) you can > switch between the two > > > > On Tuesday, March 8, 2016 at 3:49:33 PM UTC+1, jamedrano wrote: >> >> I tried to create interactive graphs in Sage 7.0 virtual machine, but all >> I get is

[sage-support] Sage 7.0 in virtualbox with jupyter notebook, interact not working

2016-03-08 Thread jamedrano
I tried to create interactive graphs in Sage 7.0 virtual machine, but all I get is a bunch of HTML code, am I doing something wrong? Is there a way to use Sage 7.0 with the old worksheet interfase? Thanks for any help. -- You received this message because you are subscribed to the Google Gro

[sage-support] Load data when running Sage from a VM in Windows

2013-12-16 Thread jamedrano
Hi, is there a way to load data into Sage when I´m running it from a virtual machine in VirtualBox and the data is in Windows? Thanks. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from

[sage-support] Sage does not solve system of symbolic equations

2013-08-09 Thread jamedrano
I'm trying to use Sage for optimization using the Lagrange multipliers method, but it does not solve this apparently simple problem: var('x y l') f = x + 2*y g = 2*x^(1/4)*y^(1/2) L = f - l * (16 - g) dfdx = L.diff(x) dfdy = L.diff(y) dfdl = L.diff(l) solve([dfdx == 0, dfdy == 0, dfdl == 0

[sage-support] Possible bug working with graphs

2013-01-06 Thread jamedrano
Hello. I´m using Sage to teach some network algorithms. The strange thing is that when I define a graph using the weighted adjacency matrix, I'm able to get the min_spanning_tree but not the shortest path. However, when I define the graph using the dictionary form, everything works OK. Here's w