I assume you meant
sage: v = P(5)
sage: v(oo)
A positive finite number
This is because the elements of QQ coerce to the parent of oo, which
is the signed infinity ring. This is so we have
sage: P.x = PolynomialRing(QQ)
sage: w = x + 5
sage: v = w - x
w(1.0)
6.00
sage: v(1.0)
I do find this behavior quite surprising--diameter should be an alias
for either relative or absolute diameter, not depending on the
interval.
On Wed, Oct 22, 2014 at 2:44 AM, John Cremona john.crem...@gmail.com wrote:
I am trying to use the Real Interval Field (RIF), which in principle
does
http://sagemath.blogspot.com/2009/12/mathematical-software-and-me-very.html
On Thu, Aug 14, 2014 at 1:14 AM, John Cremona john.crem...@gmail.com wrote:
When William Stein first started the project it was an acronym SAGE
for (I think) System for Algebra and Geometry Experimentation. But
soon
https://github.com/sagemath/sage/pull/21 aka
http://trac.sagemath.org/ticket/16672
On Thu, Jul 17, 2014 at 9:45 AM, Mahrud Sayrafi sayraf...@gmail.com wrote:
Hi,
In this page:
http://www.sagemath.org/doc/constructions/linear_algebra.html#eigenvectors-and-eigenvalues
in the eigenvectors and
The very short answer is to type make and wait an hour or three.
On Jul 14, 2014 4:54 AM, Oscar Alberto Castillo Felisola
o.castillo.felis...@gmail.com wrote:
Checking it out! Thank you John.
--
You received this message because you are subscribed to the Google Groups
sage-support group.
What exactly do you mean by simplify a real number?
On Thu, May 29, 2014 at 8:32 AM, SiL588 . ch4r...@hotmail.com wrote:
Unfortunately I don't know the rules of Phyton language, i just started
using Sage notebook to do linear algebra computation.
I think I did what you said, I assinged m a
On Tue, Apr 29, 2014 at 10:57 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Tue, Apr 29, 2014 at 9:07 AM, Volker Braun vbraun.n...@gmail.com wrote:
On Tuesday, April 29, 2014 3:58:14 PM UTC+1, Simon King wrote:
Yes there is! The hook is the hash function.
CPython implementation
On Tue, Apr 29, 2014 at 9:07 AM, Volker Braun vbraun.n...@gmail.com wrote:
On Tuesday, April 29, 2014 3:58:14 PM UTC+1, Simon King wrote:
Yes there is! The hook is the hash function.
CPython implementation detail and subject to change... really Python makes
no guarantee that __hash__() is
On Fri, Mar 14, 2014 at 2:03 PM, Georgios Tzanakis gtzana...@gmail.com wrote:
On Fri, Mar 14, 2014 at 4:49 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
Note that
intL[i][introws[i]] + j %w == 0:
would probably be just (or nearly) as fast as
((int(tupleL[i])[int(rows[i])])+j
Note that
intL[i][introws[i]] + j %w == 0:
would probably be just (or nearly) as fast as
((int(tupleL[i])[int(rows[i])])+j %w)==0
If you're going to be dealing with arrays of ints you might want to
look into NumPy and/or memory views for even more speed.
On Thu, Mar 13, 2014 at 7:58 PM,
How hard would it be to let make -jN actually work from the top-level make?
On Tue, Dec 31, 2013 at 4:57 PM, Joseph P. Skudlarek jsku...@gmail.com wrote:
This is a request to update the README.txt file used when building from
sources -- the README.txt buries the fact that -jN in make -jN is
not be enabled in the top-level make, in my opinion. Typically,
make -jN makes parallel compiles within the same package (if the package
supports it). The parallel build in sage compiles different packages in
parallel, but each package still compiles as -j1.
On 01/03/2014 02:48 AM, Robert
sage: Integers(45)['t']
Univariate Polynomial Ring in t over Ring of integers modulo 45
I don't think we have linear algebra over general non-integral-domains, but
sage: R = GF(5)['x']
sage: M = random_matrix(R, 4, 4); b = random_vector(R, 4); x = M \ b
sage: M*x
(4*x^2 + x + 4, x^2 + 2*x + 4,
On Mon, Aug 19, 2013 at 6:30 PM, Dima Pasechnik dimp...@gmail.com wrote:
On 2013-08-19, Vincent Knight knigh...@cf.ac.uk wrote:
--001a1133aa8653f2ed04e4510b09
Content-Type: text/plain; charset=ISO-8859-1
Thanks for the answer kcrisman but I'm afraid I'm still not sure I
understand.
If by
Using a Python list is probably the fastest way to iterate over an
array of Python objects--it's a PyObject** under the hood and Cython
uses the C API calls to get at it. Your check might be the
bottleneck, especially if it's a Python call.
Also, no need to write this as a while loop; just use
sage: A = random_matrix(GF(2), 1, 1)
sage: A.det()
1
sage: b = random_vector(GF(2), 1)
sage: %time x = A \ b
CPU times: user 1.61 s, sys: 0.06 s, total: 1.67 s
Wall time: 1.67 s
sage: A * x == b
True
On Wed, Apr 17, 2013 at 1:45 PM, Juan Grados juan...@gmail.com wrote:
I have the
The syntax R.A,d = QQ[] creates a polynomial ring in two
variables, with generators A and d (bound to the current session). A^d
is not a polynomial in A and d over QQ.
sage: R.A,d=QQ[]
sage: R
Multivariate Polynomial Ring in A, d over Rational Field
On Sun, Mar 17, 2013 at 12:51 AM, Rolandb
On Mon, Mar 4, 2013 at 11:54 AM, Luis Finotti luis.fino...@gmail.com wrote:
On Monday, March 4, 2013 2:42:48 PM UTC-5, Dr. David Kirkby wrote:
I think Sage would have a hard job breaking into the MATLAB
strongholds in engineering. It is used to control a lot of instruments
and data
It's cPickle with a capital P.
On Wed, Feb 20, 2013 at 2:30 AM, akhil lalwani.ak...@gmail.com wrote:
Hello,
I want to use cpickle to store a matrix object in a text file. Sample code
is as follows:
A = matrix(GF(2),2,3) #creating a 2 * 3 matrix having all entries
zero
import
First, I would recommend reading up on floating point arithmetic. A
cannonical reference is
http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html , but
if that's a bit dense there are many other good sources on the web.
Things get more interesting for Sage, as there are several models
When you say plot these values, do you mean as real or complex
values? To do so you need to choose an embedding, e.g.
sage: K.a = QQ[sqrt(5)]; K
Number Field in sqrt5 with defining polynomial x^2 - 5
sage: K.embeddings(CC)
[
Ring morphism:
From: Number Field in sqrt5 with defining polynomial
On Wed, Oct 17, 2012 at 9:37 PM, Eric Kangas eric.c.kan...@gmail.com wrote:
code:
b = 11^2
a = b^2
pri = [int(is_prime(i)) for i in range(a)]
j = [i for i in range(a)][b+1:a:b]
k = [i for i in range(a)][(b*2)+1:a:b]
j.insert(0,0)
k.insert(0,b)
m =
On Wed, Sep 26, 2012 at 10:56 PM, Geoffrey Irving irv...@naml.us wrote:
On Wed, Sep 26, 2012 at 10:42 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Wed, Sep 26, 2012 at 8:54 PM, Geoffrey Irving irv...@naml.us wrote:
On Wed, Sep 26, 2012 at 6:03 PM, Robert Bradshaw
rober
I'd go for several 100M of RAM each, likely 0.5G to be comfortable,
plus some memory for the OS and server itself. Throw 4G at it and it
should behave much better, 8G and you should be good to go.
Something like https://github.com/jasongrout/sage-forker would likely
greatly reduce this
On Wed, Sep 26, 2012 at 4:28 PM, Geoffrey Irving irv...@naml.us wrote:
Hello,
I recently used sage to write a code generation script for exact
geometric predicates:
https://github.com/otherlab/simplicity
Since it's a python script that imports sage, the simplicity script is
GPL.
Not
On Wed, Sep 26, 2012 at 8:54 PM, Geoffrey Irving irv...@naml.us wrote:
On Wed, Sep 26, 2012 at 6:03 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Wed, Sep 26, 2012 at 4:28 PM, Geoffrey Irving irv...@naml.us wrote:
Hello,
I recently used sage to write a code generation script
I agree that this is a surprising and unfortunate wart in the was Sage
is built. I would explain it like this:
Python has an integer type int that has several surprising behaviors
(from a mathematicians perspective, e.g. division). For this reason we
created our own time, Integer, that behaves
before my computer crashes due to out of memory. Also I will look
into the Bailey-Borwein-Plouffe formula, and hope to convert each digit from
binary to base 10.
On Wednesday, August 15, 2012 11:39:12 PM UTC-7, Robert Bradshaw wrote:
On Wed, Aug 15, 2012 at 5:55 PM, Eric Kangas eric.c...@gmail.com
On Wed, Aug 15, 2012 at 5:55 PM, Eric Kangas eric.c.kan...@gmail.com wrote:
Yea crashing due to being out of memory.
You could go a bit further by doing the string - list of ints part
piecemeal. The memory usage of 1000 digits is 1000 + epsilon bytes,
but a list of 1000 ints is something like
On Wed, Aug 15, 2012 at 5:10 PM, Eric Kangas eric.c.kan...@gmail.com wrote:
Hi,
I am trying to figure out a way to call up the sequence for pi to a very
large number ie. centillion, googleplex, even Graham's number. However sage
crashes around 10 million decimal places.
Crashing how? Out of
Perhaps your looking for something like
sage: R.x = QQ[]
sage: f = 2 * x^2 / (x^3 + 5); f
2*x^2/(x^3 + 5)
sage: f.numerator().list()
[0, 0, 2]
sage: f.denominator().list()
[5, 0, 0, 1]
On Sat, Jun 30, 2012 at 8:26 PM, juaninf juan...@gmail.com wrote:
Dears members,
How I will can get the
On Tue, Jun 12, 2012 at 4:11 PM, William Stein wst...@gmail.com wrote:
On Tue, Jun 12, 2012 at 3:54 PM, rych rych...@gmail.com wrote:
Interval arithmetics also gives False,
sage: from mpmath import iv
sage: # iv.prec = 24
sage: # iv.prec = 53 # for double precision
sage: x = 0.1
sage:
There are two parts to this, sage - MathML (which is what the
rudimentary _mathml_ methods are for) and MathML - sage (which it
seems you've written, and might be more useful).
To include this into Sage, I would probably create a file
sage/interfaces/mathml.py with a single parse_mathml(...)
os.path.normpath is handy for cleaning stuff like this up too
(including removing /../ and /./). Doesn't really matter here, but is
nice when one wants to compare paths or prefixes.
- Robert
On Mon, Jun 4, 2012 at 8:17 AM, Volker Braun vbraun.n...@gmail.com wrote:
Posix stipulates that multiple
sage: var('x,y')
(x, y)
sage: E = EllipticCurve(y^2 == x^3 - 36*x)
sage: P=E(-3,9)
sage: Q=E(12,36)
sage: discrete_log(Q, P, operation='+', bounds=(0,100))
---
ValueErrorTraceback (most recent
incorrect results.
On Saturday, May 12, 2012 4:06:50 AM UTC+8, kcrisman wrote:
On Friday, May 11, 2012 3:34:26 PM UTC-4, Robert Bradshaw wrote:
Did we ever decide on a standard label for mathematically incorrect
results? This shouldn't drop under the radar.
There is the stopgap
Did we ever decide on a standard label for mathematically incorrect
results? This shouldn't drop under the radar.
On Fri, May 11, 2012 at 8:37 AM, P Purkayastha ppu...@gmail.com wrote:
On Friday, May 11, 2012 4:58:53 PM UTC+8, Robert Samal wrote:
Hi!
By some random experiments I discovered
Yeah, stopgap refers to the other ticket in case the bug is hard to
fix. How about bogus or badmath?
On Fri, May 11, 2012 at 1:06 PM, kcrisman kcris...@gmail.com wrote:
On Friday, May 11, 2012 3:34:26 PM UTC-4, Robert Bradshaw wrote:
Did we ever decide on a standard label for mathematically
It's no longer (necessarily) a blocker once a stopgap has been assigned.
On Fri, May 11, 2012 at 5:01 PM, John H Palmieri jhpalmier...@gmail.com wrote:
On Friday, May 11, 2012 2:55:19 PM UTC-7, Robert Bradshaw wrote:
Yeah, stopgap refers to the other ticket in case the bug is hard to
fix
On Thu, Apr 19, 2012 at 12:48 PM, Emil emi...@gmail.com wrote:
On 19 April 2012 07:20, Robert Bradshaw rober...@math.washington.edu wrote:
It might be distutils. It might be Cython. It might even be Sage or
Python. But without knowing exactly how you're trying to
compile/install your package
On Sat, Apr 7, 2012 at 4:06 AM, Emil emi...@gmail.com wrote:
On 7 April 2012 01:14, Maarten Derickx m.derickx.stud...@gmail.com wrote:
Does executing:
import foo
give what you want or is your problem different?
import foo doesn't do much, as foo/__init__.py is empty. I have
adopted the
Doing
sage: ZZ.random_element?
tells you that ZZ takes x and y arguments for min/max. Polynomial
rings' random_element pass extra keywords down to the basrings, so one
can do
sage: P.random_element(degree=10, terms=10, x=-9, y=9)
-9*x^8*y^2 + x^8 + x^7*y + 8*x^6*y^2 - 7*x^2*y^6 -
On Sat, Mar 31, 2012 at 3:42 PM, Emil emi...@gmail.com wrote:
On 31 March 2012 12:47, Volker Braun vbraun.n...@gmail.com wrote:
If it is of interest to an academic community then it probably should be
part of Sage ;-)
I'm not against it being incorporated into Sage at some point, but
right
You should take a look at Python's defaultdict. One of the design
decisions was to cache all the values computed for a given key; if you
want to do differently you could implement your own using __getitem__
and __setitme__.
- Robert
On Wed, Mar 21, 2012 at 1:28 PM, Daniel Krenn kr...@aon.at
On Thu, Mar 15, 2012 at 8:48 AM, Laurent moky.m...@gmail.com wrote:
and it would not make very much sense to provide a method for this
class to test for integrality, since every such element is an Integer
by definition. I suspect that in your intended application, A will be
the result of
On Sun, Mar 4, 2012 at 10:34 AM, Nils Bruin nbr...@sfu.ca wrote:
On Mar 4, 1:14 am, Robert Bradshaw rober...@math.washington.edu
wrote:
I think it's fair to test for strings first, trying to parse, before
testing if it's an iterator. This is consistant with many other
objects that try
The difficulty with accepting an iterator (of strings) is that it is
unclear if each item corresponds to a row or an element. But I would
be in favor of rather liberal string parsing, so one could do
matrix(open(test.csv).read())
just like
matrix(
1,2,3
4,5,5
)
On Mon, Feb 27, 2012 at 6:26 AM,
On Wed, Feb 29, 2012 at 11:29 AM, Kelvin Li ltwis...@gmail.com wrote:
On Feb 29, 12:24 pm, Niles nil...@gmail.com wrote:
So this means that you should write Apply trac_10229-2.patch in a
new comment on the ticket. Unfortunately writing this in the ticket
description is useless for the
FYI, http://trac.sagemath.org/sage_trac/ticket/12513
On Mon, Feb 6, 2012 at 1:53 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Mon, Feb 6, 2012 at 1:01 PM, Jason Grout jason-s...@creativetrax.com
wrote:
On 2/6/12 1:33 PM, Oscar Lazo wrote:
That is very nice! Unfortunately I
On Sun, Feb 12, 2012 at 4:30 PM, Nils Bruin nbr...@sfu.ca wrote:
On Feb 12, 1:39 pm, Pierre pierre.guil...@gmail.com wrote:
i think zz above might still be considered as a 1 x 1 matrix instead
of a complex number, somehow, and this may be slowing things down.
No, that's not the problem. It's
consider packing your 2x2
matrices into larger arrays (e.g. representing n 2x2 matrices by a 4 x
n matrix and manually doing the multiplication) so you can your
computations in a vectorized form.
On 13 fév, 18:32, Robert Bradshaw rober...@math.washington.edu
wrote:
On Sun, Feb 12, 2012 at 4:30 PM
, but I do not want a def
chaps(u,v) like what anton has done for now, both for my simplified
and larger problem.
Is there a solution/method to this?
Kind Regards
Chappman
On Feb 7, 9:35 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On Tue, Feb 7, 2012 at 1:07 PM, Chappman chappman
On Tue, Feb 7, 2012 at 1:07 PM, Chappman chappman@gmail.com wrote:
Hi Rob,
I am pretty new to Sage and am not used to the syntex, so even though
I write [y1,y2] , i do not mean it as a list.
Basically what I am trying to do is try and get the folllowing code to
work, if the summation does
On Mon, Feb 6, 2012 at 1:01 PM, Jason Grout jason-s...@creativetrax.com wrote:
On 2/6/12 1:33 PM, Oscar Lazo wrote:
That is very nice! Unfortunately I need to evaluate many different
expressions quickly, so the copy-paste aproach is not an option.
That's why I wrote the fast_complex function.
On Mon, Feb 6, 2012 at 3:12 PM, Chappman chappman@gmail.com wrote:
Hi, I am currently trying to write a program for my project and am
trying to make the following syntax work:
if y_1=y_2:
[y_1,y_2]=2
elif y_1y_2:
[y_1,y_2]=1
I think you want is
if y_1 = y_2:
y_1 = y_2 =
If you create an actual power series element, you can easily write the
coefficients to a file:
sage: f = taylor(sin(x), x, 0, 10); f
1/362880*x^9 - 1/5040*x^7 + 1/120*x^5 - 1/6*x^3 + x
sage: power_series = RR[['x']](f); power_series
0.000 + 1.00*x + 0.000*x^2 -
On Wed, Oct 19, 2011 at 11:52 PM, Simon King simon.k...@uni-jena.de wrote:
Hi Robert,
On 20 Okt., 06:59, Robert Bradshaw rober...@math.washington.edu
wrote:
I have no idea why L.pop(0) is not optimized, but L.pop(int0) is
(and the latter should be very fast). Clearly a bug in Cython
On Thu, Oct 20, 2011 at 4:55 AM, Simon King simon.k...@uni-jena.de wrote:
Hi Robert,
On 20 Okt., 13:38, Robert Bradshaw rober...@math.washington.edu
wrote:
Since L.pop() (popping the last item) is so much faster than L.pop(0),
I could perhaps just revert my lists.
Inserting into the 0th
On Wed, Oct 19, 2011 at 12:42 PM, Simon King simon.k...@uni-jena.de wrote:
Hi Alexander and all,
First of all, sorry that I posted twice the same - google groups
reported an error when I first tried to post.
On 19 Okt., 19:58, Alexander Juarez coua...@gmail.com wrote:
I think I found the
On Thu, Aug 25, 2011 at 2:24 PM, William Stein wst...@gmail.com wrote:
On Thu, Aug 25, 2011 at 12:19 PM, Jason Grout
jason-s...@creativetrax.com wrote:
On 8/25/11 12:52 PM, William Stein wrote:
On Thu, Aug 25, 2011 at 10:36 AM, Jason Grout
jason-s...@creativetrax.com wrote:
On 8/25/11
We'd welcome a patch. How to do so is written up in detail at
http://www.sagemath.org/doc/developer/walk_through.html#creating-a-change
. Essentially, you create the change, uploaded it to trac, someone
referees it, and then it gets merged into the next release.
On Thu, Oct 13, 2011 at 9:30 AM,
No. Also note that sagenb.org is on a single computer shared among
tens of thousands of users, so if you want to do something
computationally expensive you're better of installing Sage on your own
hardware.
On Tue, Oct 11, 2011 at 8:38 AM, juaninf juan...@gmail.com wrote:
Exist sagenb.org with
On Mon, Sep 19, 2011 at 10:45 PM, kod da kod...@gmail.com wrote:
Thanks for your response.
I found the same error when not setting SAGE64=yes. I noticed I got this
message higher in the install log:
Failed to find the necessary bits to build these modules:
bsddb185 dl
On Wed, Sep 14, 2011 at 2:31 AM, Rajeev Singh rajs2...@gmail.com wrote:
Hi,
The following examples compiles from the notebook
%cython
cimport sage.gsl.ode
import sage.gsl.ode
include 'gsl.pxi'
cdef class van_der_pol(sage.gsl.ode.ode_system):
cdef double beta
def __cinit__(self,
On Fri, Sep 2, 2011 at 3:44 AM, Vince vincent.kni...@gmail.com wrote:
Dear all,
If I have a list, how do I obtain the cardinality of the list, the
command Cardinality() doesn't seem to always work. For example, the
following code produces a set ComSet of sets of combinations.
Rows=3
On Tue, Aug 30, 2011 at 3:08 PM, dkrumm dkr...@uga.edu wrote:
I just made a new installation of Sage 4.7.1 and I tried to build the
library (although I haven't made any changes to it). I get this error
message:
Building Sage on OS X in 64-bit mode
Creating SAGE_LOCAL/lib/sage-64.txt since it
On Mon, Aug 22, 2011 at 6:06 AM, Simon King simon.k...@uni-jena.de wrote:
Hi Vladimir,
On 22 Aug., 12:05, v...@ukr.net wrote:
Hello guys!
Could you please explain me (and perhaps some of the other readers)
the reasons (or advantages) of using implicit multiplication at all?
I mean in
I can't seem to download your test matrix, but are you sure you're not
confusing left kernel and right kernel? What's M *
M.kernel().basis()[0]?
On Fri, Aug 19, 2011 at 10:57 AM, Sucharit sucharit.sar...@gmail.com wrote:
I am using Sage to compute homologies of large chain complexes. For this,
On Thu, Aug 18, 2011 at 12:48 AM, v...@ukr.net wrote:
Hello!
On Thu, 18 Aug 2011 00:35:21 -0700 (PDT)
Stan Schymanski schym...@gmail.com wrote:
Dear Robert,
Thanks a lot for your help, this is exactly what I wanted. I still
don't get why it is necessary to import a special function to
On Wed, Aug 17, 2011 at 9:09 AM, Stan Schymanski schym...@gmail.com wrote:
Dear all,
This has been driving me mad. According to the python documentation,
you can modify a copy of a list without modifying the original using
the following code:
sage: L = []
sage: M = L[:] # create a copy
, the files are not
disclosable :-(.
Victor
On Aug 3, 3:03 am, Robert Bradshaw rober...@math.washington.edu
wrote:
This is exactly the kind if thing we try to avoid. I'd like to see the
files (if they're disclosable of course), or perhaps you could come up
with a whittled-down example
On Thu, Aug 4, 2011 at 10:49 AM, Victor Miller victorsmil...@gmail.com wrote:
There's a real bug in Cython. It looks like it's some sort of parsing bug.
Consider the following program:
def Check(P,x):
Q = 2**(1+len(x))*P
R = P
for _ in range(1+len(x)):
R = 2*R
if
copied one to the
other, and just in case I checked with diff. It's very puzzling.
Victor
On Aug 2, 8:19 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On Tue, Aug 2, 2011 at 11:29 AM, William Stein wst...@gmail.com wrote:
On Tue, Aug 2, 2011 at 11:09 AM, VictorMiller victorsmil
On Tue, Aug 2, 2011 at 11:29 AM, William Stein wst...@gmail.com wrote:
On Tue, Aug 2, 2011 at 11:09 AM, VictorMiller victorsmil...@gmail.com wrote:
I've written a bunch of functions (some organized in classes) to do
some large computations in a particular finite field (always GF(2^n)
for some
On Fri, Jul 29, 2011 at 5:00 PM, john_perry_usm john.pe...@usm.edu wrote:
Hi
I have a file type1.pyx that defines an extension type Type1, and a
file type2.pyx that defines an extension type Type2. Some attributes
of Type2 are of type Type1. If I have the types in one file,
everything runs
On Thu, Jul 21, 2011 at 3:37 AM, Burcin Erocal bur...@erocal.org wrote:
Hi,
On Wed, 20 Jul 2011 17:02:49 -0700 (PDT)
Steven Pollack stevenlawrencepoll...@gmail.com wrote:
I noticed that a thread was developed for this sort of thing (http://
On Wed, Jul 20, 2011 at 4:09 PM, Jose Guzman sjm.guz...@googlemail.com wrote:
Hi everybody,
I am trying to install a Python module in Sage that uses autotools as its
build system. I would like to install it in my local Sage, so I type:
./configure --prefix=$HOME/sage-4.7/local
On Mon, Jun 27, 2011 at 8:23 AM, Chris Seberino cseber...@gmail.com wrote:
On Jun 24, 11:59 pm, Jason Grout jason-s...@creativetrax.com wrote:
sage: implicit_mul('diff(f,x)(3)', level=10)
'diff(f,x)*(3)'
which is definitely not what I intended.
Jason
Would you agree a good robust
On Wed, Jun 22, 2011 at 12:35 PM, Ken Levasseur klevass...@mac.com wrote:
Hello. I'm trying to implement the algorithm for representing primes
congruent to 1 mod 4 as a sum of squares and I know the logic of the
algebra is right (identical equations work in Mathematica). However,
I get a
On Wed, Jun 1, 2011 at 7:30 AM, zsharon zacherysha...@gmail.com wrote:
Hi,
I need to determine if a given algebraic number is rational. Here is
the setup:
PolynomialRing(ZZ, 'x')
A=-2
B=5
f=x^3 + A*x +B
D=-4*A^3-27*B^2
L.c = NumberField(f)
Then I need to know if a given number
On Sat, May 28, 2011 at 4:17 AM, Vahid v.mojta...@gmail.com wrote:
Hi,
I would like to know that if I write my Sage codes in IDLE of Python,
will it be faster when it runs?
I highly doubt it.
Someone told me that in this case the
codes are translated to machine language faster and it is
On Fri, May 27, 2011 at 3:35 PM, Chris Seberino cseber...@gmail.com wrote:
On May 27, 3:34 pm, Berkin Malkoc malk...@gmail.com wrote:
It is in the
reference:http://www.sagemath.org/doc/reference/sagenb/notebook/notebook.html
Thank you. Those docs appear to be for a Sage session.
I
Are you suer that savetxt has sparse representations? I bet it's
saving a whole bunch or 0's (though the numpy list would be the place
to ask for sure, and for a replacement).
On Mon, May 16, 2011 at 10:29 AM, akm andrew.mussel...@gmail.com wrote:
Would it be expected behavior for a 26k x 26k
On Tue, May 10, 2011 at 11:40 AM, MathLynx mathl...@gmail.com wrote:
Is it safe to say that
R = PolynomialRing(QQ, 'X,Y')
defines a ring over Q in two variables, in which
x,y = R.gens()
sets x y to be the generators? If this is so, then what exactly is
the role of 'X,Y' ? Just to
On Tue, May 10, 2011 at 10:02 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
If I want to find the roots of x^2-2 in reals, I use the following approach.
R.x=RR[]
f=x^2-2
f.roots()
But, it gives the rational approximation. Is it possible to find the
exact root (irrational form)?
On Tue, May 10, 2011 at 12:53 PM, tvn nguyenthanh...@gmail.com wrote:
sorry my question wasn't so clear -- but yes the main bottleneck is
applying the conversion function from string to rational . Thanks for the
sage_eval function
If the sage_eval function is faster, then string - Rational
graham.e...@gmail.com wrote:
Another option is to use the pow() function, as in pow(a, b, c).
On Mar 17, 1:58 am, Robert Bradshaw rober...@math.washington.edu
wrote:
mod(a, c)^b
On Wed, Mar 16, 2011 at 10:44 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
How one can calculate
mod(a, c)^b
On Wed, Mar 16, 2011 at 10:44 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
How one can calculate a^b mod c in Sage for large b?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Looks like you downloaded a 10.6 binary and are trying to use it on
your 10.5.8 machine. You (probably) want the first item in this list:
http://boxen.math.washington.edu/sage/osx/intel/index.html
On Thu, Feb 24, 2011 at 10:14 PM, amandachan2...@yahoo.com
amandachan2...@yahoo.com wrote:
What basering is your system over? This could make a huge difference
in terms of memory requirements.
On Wed, Feb 23, 2011 at 6:57 AM, Guillermo Oviedo oviedo...@gmail.com wrote:
In trying to solve a linear equation system of 4096 variables (with
matrix.solve_right()) , there occurs a memory
On Sun, Jan 30, 2011 at 6:42 AM, Loïc xl...@free.fr wrote:
Do you think it's better to report it as a bug?
Yes. http://trac.sagemath.org/sage_trac/ticket/10796
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
On Mon, Feb 7, 2011 at 10:21 AM, Jason Grout
jason-s...@creativetrax.com wrote:
On 2/7/11 11:59 AM, Thomas Scofield wrote:
I've spent the last couple of hours frustrated at trying to log in
and use notebooks at sagenb.org. I was attempting to do this while
teaching a class, and had little to
On Sun, Feb 6, 2011 at 11:29 AM, Daniel M. danielmeji...@gmail.com wrote:
Hi everyone, i need some help configuring my notebook:
When i start the notebook server typing notebook() on the sage
prompt it always login as 'admin' so i have to log out and enter as my
user defined account.
I've
On Mon, Feb 7, 2011 at 3:59 PM, Harald Schilly harald.schi...@gmail.com wrote:
On Monday, February 7, 2011 7:52:52 PM UTC+1, robertwb wrote:
Sage is a victim of its own success!
I think it's really great that there is an online notebook to try sage, but
we should post a warning that this is
On Fri, Feb 4, 2011 at 3:26 PM, Mike Hansen mhan...@gmail.com wrote:
On Fri, Feb 4, 2011 at 11:56 PM, Johannes dajo.m...@web.de wrote:
Hi list
how can i add a new edge (a-b) to a given graph G (n.n. connected),
just in the case that there is no path (a - ... - b) before?
You should use
On Sun, Jan 30, 2011 at 2:55 AM, Loïc xl...@free.fr wrote:
Thanks you very much for your reply
You're right, size affects the center too.
Not very intuituive but now, I know it.
I think this behaviour is quite surprising.
For example, with sphere, size doesn't affect center
I might go
On Tue, Jan 25, 2011 at 4:17 PM, calcp...@aol.com calcp...@aol.com wrote:
Hello All!
First of all, thanx for all the great work you do making SAGE such a
great resource. My students and I love it!
I've used online SAGE servers and SAGE live Linux CDs over the years
in class and at
On Sat, Jan 22, 2011 at 8:19 PM, ancienthart joalheag...@gmail.com wrote:
This tip, which seems the most effective and least likely to blow up, has
made it to the following blog.
http://doxdrum.wordpress.com/2011/01/22/sage-tip-simplifying-a-matrix/
So is it possible that this could become an
On Fri, Jan 21, 2011 at 12:28 PM, LouP pec...@anvil.nrl.navy.mil wrote:
I have more information. I ran my script using the pre-installed
python 2.6 framework on my Mac and the Mac version of the dialogs was
used (which is what I want),
Just out of curiosity, what script are you running and
On Fri, Jan 21, 2011 at 1:09 PM, LouP pec...@anvil.nrl.navy.mil wrote:
On Jan 21, 3:46 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On Fri, Jan 21, 2011 at 12:28 PM, LouP pec...@anvil.nrl.navy.mil wrote:
I have more information. I ran my script using the pre-installed
python
1 - 100 of 724 matches
Mail list logo
