Here is a translation of Annick's message.
Hello,
Whichever version of Sage (app or not app) (there is only up to 10.5
for 32-bit) I install on my mac book pro (10.7 intel), I get the same
problem as described below (see details after my signature): Sage
looks for the file
2011/7/19 Santanu Sarkar sarkar.santanu@gmail.com:
Size of the matrix is (30,16). Entries are at least 3000 bit integer.
Try using pastebin.com.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
On 2011-06-30, Santanu Sarkar wrote:
I have a set S of monomials in x1, x2, x3, x4 like
S=[x3x4,x2x3,x1x4,x4,x3,x1x2,x1,x2,1]. I want to rearrange S in
Lexicographic ordering like
S=[1,x1,x2,x1x2,x3,x2x3,x4,x1x4, x3x4].
You can sort a list and specify the comparison function. See the help
On 2011-06-16 kcrisman wrote:
On Jun 16, 10:44 am, Kirill Vankov wrote:
Detected SAGE64 flag
Building Sage on OS X in 64-bit mode
Does this happen every time you start Sage? That is odd.
About that, see trac tickets 10303, 11077, 9960:
http://trac.sagemath.org/sage_trac/ticket/10303
2011/4/17 clodemil ollie...@scarlet.be:
Hi all,
# Measurements are taken three times in one session and entered in a
continuous list t:
t=[ 151, 129, 126, 158, 163, 165, 150, 120, 147, 148, 134, 114, 180,
167, 159, 196, 175, 162, 135, 145, 135, 176, 172, 184, 149, 150, 152,
185, 185, 168,
2011/4/17 raman raman.kurdi2...@gmail.com:
Hello Dears
could you please tell me how I can write the recurrence relation by
sage?
for example
p(n)=2p(n-1)+p(n-2) where p(0)=1 and p(1)=3
you could do this:
def p(n):
if n == 0: return 1
if n == 1: return 3
l = (1,3)
for i in
