Hello,
I would like to make the jupyter notebook use the full width of my screen.
I found this link:
https://stackoverflow.com/questions/21971449/how-do-i-increase-the-cell-width-of-the-jupyter-ipython-notebook-in-my-browser
which says that I need to create a custom.css file in the directory
sage: version()
'Sage Version 4.8, Release Date: 2012-01-20'
sage: L = [-4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -4, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 1, 0, 0, 0, 0, 0, 0,
0, 0, 0, -4
--
| Sage Version 5.0, Release Date: 2012-05-14 |
| Type notebook() for the GUI, and license() for information.|
--
sage: time floo
hello,
In the notebook, is it possible to make the various controls (e.g.
the "action..." menu) somehow "float", so that I can access them
without having to scroll back to the beginning of the page, when I'm
working somewhere at the bottom of a very long notebook?
david
--
To post to thi
On Feb 3, 2010, at 1:22 AM, David Roe wrote:
After I create the residue field of a p-adic ring, how do I cast
elements of the field back into the ring? Any lift is fine. The
obvious thing doesn't work:
Sadly, residue fields for p-adic rings currently suck. My hope is
that they'll be better
On Sep 23, 2008, at 8:45 AM, aniura wrote:
>
> hi,
>
> I wanted to know if there is a way to work in Sage with arrays of
> matrices or something similar (something like a[i,j,k], so that
> a[i,:,:], a[:,j,:] and a[:,:,k] are all matrices. I tried to use a
> list of matrices but apparently sage i
On Jul 15, 2008, at 10:36 PM, Mats wrote:
> Thank you David and Jason.
>
> On Jul 12, 2:25 pm, David Harvey <[EMAIL PROTECTED]> wrote:
>> If you build from source, you can apply the attached patch file to
>> get future division *everywhere* in the notebook.
> Wil
On Jul 12, 2008, at 2:48 PM, Jason Grout wrote:
>
> David Harvey wrote:
>> On Jul 12, 2008, at 1:22 PM, Mats wrote:
>>
>>> Clarification: I would like fast ints&reals, with 2/3=0., and
>>> not
>>> 2/3=0, but I cannot figure out how to do t
On Jul 12, 2008, at 1:22 PM, Mats wrote:
> Clarification: I would like fast ints&reals, with 2/3=0., and not
> 2/3=0, but I cannot figure out how to do this in notebook mode.
Hi Mats,
If you build from source, you can apply the attached patch file to
get future division *everywhere* in th
On Jul 5, 2008, at 3:27 AM, Daryl Hammond wrote:
> Finally I spent several hours trying to reduce the SAGE code down to
> the
> smallest number of lines that would still present the problem. I
> believe I've
> done that with the following:
>
> cat /home/daryl/UserData/sage/add.sage
> # 2008-07-
On Jul 4, 2008, at 3:44 PM, Daryl Hammond wrote:
> [EMAIL PROTECTED] ~]$ /home/daryl/sage-3.0.1/sage
> --
> | SAGE Version 3.0.1, Release Date: 2008-05-05 |
> | Type notebook() for the GUI, and license() fo
On Jul 4, 2008, at 2:59 PM, Daryl Hammond wrote:
> David, I ran your two line program on Sage-3.0.3 and obtained:
>
> [EMAIL PROTECTED] ~]$ /home/daryl/sage-3.0.3/sage
> --
> | SAGE Version 3.0.3, Release Date: 2008-06-17
On Jul 4, 2008, at 2:36 PM, Daryl Hammond wrote:
> [EMAIL PROTECTED] ~]$ /home/daryl/sage-3.0.1/sage
> --
> | SAGE Version 3.0.1, Release Date: 2008-05-05 |
> | Type notebook() for the GUI, and license() fo
On Jul 4, 2008, at 6:34 AM, David Harvey wrote:
> On Jul 4, 2008, at 6:22 AM, David Harvey wrote:
>
>> On Jul 3, 2008, at 8:30 PM, David Harvey wrote:
>>
>>> On Jul 3, 2008, at 8:22 PM, Daryl Hammond wrote:
>>>
>>>> I do not have a place to pos
On Jul 4, 2008, at 6:22 AM, David Harvey wrote:
> On Jul 3, 2008, at 8:30 PM, David Harvey wrote:
>
>> On Jul 3, 2008, at 8:22 PM, Daryl Hammond wrote:
>>
>>> I do not have a place to post the install logs.
>>
>> If you like, you can email them to me of
On Jul 3, 2008, at 8:30 PM, David Harvey wrote:
> On Jul 3, 2008, at 8:22 PM, Daryl Hammond wrote:
>
>> I do not have a place to post the install logs.
>
> If you like, you can email them to me off-list and I can post them
> somewhere.
Thanks.
The logs may be d
On Jul 3, 2008, at 8:22 PM, Daryl Hammond wrote:
> I do not have a place to post the install logs.
If you like, you can email them to me off-list and I can post them
somewhere.
> Here is the cat /proc/
> cpuinfo output:
>
> [EMAIL PROTECTED] ~]$ cat /proc/cpuinfo
> processor : 0
> vendor
On Jul 3, 2008, at 6:30 PM, Daryl Hammond wrote:
> David, I have both install logs available. I have edited them "down"
> to about 3,600 lines and 280 KB each. I hesitate to post that much
> data here.
If you are able to put them up somewhere on the web that would be great.
Could you please
On Jul 3, 2008, at 1:56 PM, IanSR wrote:
> I have just tested the following example re code in sage, and it fails
> both on a Linux install and a Mac OS X install:
>
> import re
> p = re.compile('(a(b)c)d')
> m = p.match('abcd')
> m.group(0)
> # expect: 'abcd'
> m.group(1)
> # expect: 'abc'
> m.
On Jul 3, 2008, at 8:29 AM, David Harvey wrote:
>
> There is no slowdown between sage-3.0.1 and 3.0.2 with the original
> posted code, on sage.math:
>
> Linux sage 2.6.18-6-amd64 #1 SMP Sun Feb 10 17:50:19 UTC 2008 x86_64
> GNU/Linux
>
> So it looks like something pr
Daryl,
Do you have available the original install.log from your 3.0.1 and
3.0.2 builds? It would be very interesting to see what happened
during the GMP build.
david
On Jul 2, 2008, at 7:11 PM, Daryl Hammond wrote:
>
> I recently did a clean install of Fedora 9 (formerly running Fedora 8)
There is no slowdown between sage-3.0.1 and 3.0.2 with the original
posted code, on sage.math:
Linux sage 2.6.18-6-amd64 #1 SMP Sun Feb 10 17:50:19 UTC 2008 x86_64
GNU/Linux
So it looks like something processor-specific.
david
On Jul 2, 2008, at 7:11 PM, Daryl Hammond wrote:
>
> I recentl
On Apr 23, 2008, at 12:47 PM, William Stein wrote:
>
> On Wed, Apr 23, 2008 at 9:08 AM, Jim Clark
> <[EMAIL PROTECTED]> wrote:
>> Will you be providing a binary for OS X 10.4 PowerPC?
>
> Unfortunately I no longer have access to *any* OS X 10.5 powerpc
> machines.
> I personally don't own a
On Apr 16, 2008, at 3:01 PM, terry-s wrote:
>>
>> Sage is 100% local. It *does not* install any files anywhere else
>> on your hard drive unless you type "make install", and even then
>> the install only happens at the very end. In other words, just
>> delete
>> the directory where you tried
On Mar 6, 2008, at 6:14 PM, Hector Villafuerte wrote:
>> That one *does* currently give a syntax error, because lambda really
>> is a python keyword. But there aren't too many python keywords. Off
>> the top of my head:
>
> Hi David, I'm aware of that behavior currently happening (the syntax
On Mar 6, 2008, at 5:56 PM, Hector Villafuerte wrote:
>
>> On Thu, Mar 6, 2008 at 12:53 PM, Jason Grout
>> <[EMAIL PROTECTED]> wrote:
> ...
>>> What does "reserved words" mean? Do you mean that we should
>>> throw an
>>> error when those variables are assigned? I don't think that
>>> w
On Feb 15, 2008, at 5:37 PM, William Stein wrote:
>
> On Feb 15, 2008 2:31 PM, Marshall Hampton <[EMAIL PROTECTED]> wrote:
>>
>> I agree that two lists are better than four - sage-support and sage-
>> devel should be enough.
>>
>
> I strongly agree. I would like us to have only sage-support and
On Feb 10, 2008, at 2:13 PM, Simon King wrote:
> {}. Moreover, a.Data and b.Data should be different objects, because
> "D={}" should create a *new* empty dictionary each time.
No -- this is incorrect. The new dictionary is created when the
interpreter *reads the class definition*. It happens
On Feb 4, 2008, at 9:19 AM, vgermrk wrote:
>
> I think it would be nice to have a signum-function (i.e.
> sign(x)=abs(x)/x or sign(x)=cmp(x,0) ) in sage.
> There is none, right?
>
> Of course it should work on integers, floats, lists, etc.
Yep, just noting that this has been requested before:
On Jan 14, 2008, at 10:09 PM, Carl Witty wrote:
> Here is a more idiomatic way to do this computation in Sage. We work
> in the fraction field of a multivariate polynomial ring; this means
> that our polynomial arithmetic is handled by libSingular instead of by
> maxima, and that we can get the
On Dec 19, 2007, at 8:19 PM, David Joyner wrote:
>> Oh they know that sage exists. I had a drink with an OLPC developer a
>> few months ago, he showed me a demo model and we had the sage
>> notebook running in the browser.
>
> Was this the same (secure) version we have on sagemath now?
Well I l
On Dec 19, 2007, at 7:57 PM, Ted Kosan wrote:
>> I tried to connect to the online server on sagemath.org
>> but the laptop apparently could not achieve a secure connection.
>> I wonder if a SAGE binary can be run from an SD card?
>
> What comes to mind is to file this as a bug report in the OLPC
On Dec 13, 2007, at 9:19 PM, mekaj wrote:
> def get_partitions(x,y=[]):
The problem might be your default argument above. This is really a
python issue. Every time your function is called, it's getting the
*same* list object. The standard python idiom to get around this is:
def get_partiti
On Dec 4, 2007, at 5:09 AM, fwc wrote:
>>> 1) Taylor series of a rational function.
>>
>>> This works:
>>> sage: cos(x).taylor(x,0,2)
>>
>>> This doesn't:
>>> sage: x/(1+x).taylor(x,0,2)
>>
>>> This is very confusing:
>
>> This is due to the fact that '.' binds tighter than '/'. For
>> examp
Hi Ahmad,
Unfortunately I know nothing about multivariate polynomials in sage,
but in case you didn't already know, there is an easy way to find out
what methods an object supports. For example I did this:
sage: k = GF(7)
sage: R = MPolynomialRing(k,2,x)
sage: x = R.gens()
sage: g = x[0]^3 +
On Nov 30, 2007, at 2:45 AM, Ahmad wrote:
>
> Dear Sage Supporters,
>
> As nobody continued to pay attention to the question I asked in sept 3
> about how I want to change the field basis "permanently", I am using
> john Cremona's idea to ask my question in another way, in hope to
> attract more
On Sep 17, 2007, at 8:38 PM, David Stahl wrote:
> I need to generate large, random integers and tried to use
> ntl.ZZ_random(). Unfortunately the output is not recognized by sage
> as an integer and I don't see any information in the reference guide
> about such a conversion. Any guidance woul
007, at 1:31 PM, William Stein wrote:
>
> On 8/7/07, David Harvey <[EMAIL PROTECTED]> wrote:
>> I have a G5 powerpc. It's certainly not pristine, but if there's a
>> way I can help without destroying my OS then I'm willing to give it a
>> try.
>
> Thank
On Aug 7, 2007, at 1:31 PM, William Stein wrote:
>> You said below that /usr/local needs to be empty. So what if I
>> temporarily rename /usr/local, build SAGE, and then rename it back.
>> Will this fry my OS? Will this make the build work? There doesn't
>> seem to be too much important stuff in
I have a G5 powerpc. It's certainly not pristine, but if there's a
way I can help without destroying my OS then I'm willing to give it a
try.
You said below that /usr/local needs to be empty. So what if I
temporarily rename /usr/local, build SAGE, and then rename it back.
Will this fry my
Because I is the square root of -1.
sage: type(I)
sage: type(J)
sage: type(R)
Yeah this is pretty confusing if it's not what you expected.
david
On Jul 3, 2007, at 7:18 AM, Ted Kosan wrote:
>
> Does anyone have any thoughts on why solve() returns [R == -1*I*E] in
> the following SA
Fixed. Patch at
http://sage.math.washington.edu/home/dmharvey/patches/
alternating_group.hg
david
On May 30, 2007, at 9:34 PM, David Harvey wrote:
>
>
> On May 30, 2007, at 9:30 PM, Green Kobold wrote:
>
>>
>> in the middle of a code (600 lines), i use a Alternatin
On May 30, 2007, at 9:30 PM, Green Kobold wrote:
>
> in the middle of a code (600 lines), i use a AlternatingGroup and get
> always the same error:
>
> Traceback (most recent call last):
> File "../../python/dev/wx-dev/granulador8.py", line 496, in MkSnd
> MakeGrains(self.name)
> File ".
Hmmm this sounds like a bug in the cputime() command. I will ask
around on the sage-devel list.
david
On Apr 19, 2007, at 3:52 AM, DanK wrote:
> For the problem with the negative time i have started following
> computation:
>
> Zeit=cputime()
> for i in range(10):
> g=maxima('193^99484')
On Apr 18, 2007, at 11:52 AM, DanK wrote:
>for i in range(1,((p-1)/2)+1):
> e=i^(p-1-t)%p
Here is another example where modular arithmetic is important.
The variable i could be as large as about p/2, and you are raising it
to a power which is about as large as p. That means that i^(p-
On Apr 17, 2007, at 3:44 PM, DanK wrote:
>
> Hi,
>
> for low p the computations are no problem and the time shown in the
> results seemed to be correct. But by larger p around 10 it takes
> about 5 to 8 hours on the wall clock and the results seem tob be
> correct, but the time is negative.
On Apr 17, 2007, at 6:38 AM, DanK wrote:
>
> Nobody any idea? Or perhaps another command to mesure the time the
> algorithm used?
I'm curious; how long did the computation actually take? Are we
talking seconds? minutes? weeks?
david
--~--~-~--~~~---~--~~
To
On Mar 26, 2007, at 3:57 PM, Timothy Clemans wrote:
>
> Apparently I was incorrectly defining x as an integer, however, I did
> not get an error the first I tried.
>
> incorrect way: x = PolynomialRing(ZZ)
> correct way: g. = PolynomialRing(ZZ)
>
> The len method works now. Thanks.
Be careful t
On Mar 20, 2007, at 7:11 AM, DanK wrote:
> sage: v=1; w=1; x=1 #Berechnung von Vp,t noch ohne modulo q
> sage: for i in range(1,((p-1)/2)+1):
> ... v=z^i-z^(-i)%q
> ... w=v^(i^expo)
> ... x=(x*w)%q
One serious problem is, that on the line
> ... w=v^(i^expo)
you are doing the modular arithmeti
I put the following into a file "test.sage", and then run "sage -t
test.sage", and it just freezes. Eventually it times out and restarts
SAGE. What's going on?
=== snip
def test():
"""
sage: for x in range(5): pass
"""
pass
=== snip
David
--~--
On Jan 18, 2007, at 1:25 PM, Justin C. Walker wrote:
Is it not possible to directly print a tuple ('...%(T)' doesn't work
either)? This seems to be a python problem, not related to the
layers between sage and python.
This is one of the very few ugly pieces of python syntax:
sage: T = (1
On Oct 27, 2006, at 7:43 AM, David Joyner wrote:
>
> Hello all:
>
> I'm trying to import Numeric to fix the eigenvalues bug for real
> and complex
> matrices. The following function should do it but it has problems I
> think with the
> eigenvalues line. Am I importing something wrong?
smells
On Oct 25, 2006, at 3:50 PM, Kate Minola wrote:
> Running sage-1.4.1.2 on my x86_64-Linux system,
> if I run the following command:
>
> maxima.eval("-(1/2)*taylor (sqrt (1-4*x^2), x, 0, 15)")
>
> and then quit, I find that there is a process
> 'lisp.run' unexpectedly still running on my system
>
53 matches
Mail list logo
