I am using the fuction r.scan() because i need to read big data file,since
read_table() or read_csv() is not recommended for those kind of data, witch
function would be the best one, sageobj() or x.sage(), or would both do the
job well, thanks in advance for you answer
On Tue, Apr 13, 2010 at 10:2
Alec,
Perfect, that's just what I needed. Much better.
Since the NumberField constructor should complain if the next
polynomial (the quotient of the division) is not irreducible, the
students can just proceed on faith that the result of the division is
the remaining portion of a factorization an
On Apr 14, 12:47 am, Drini wrote:
> I'm confused
> abouthttp://www.sagemath.org/doc/reference/sage/combinat/yamanouchi.html
> it's documentation for 4.3.5 but it's been the same since 4.3.1
>
> Is there a class?
> functions?
> or is it just a random note about those words?
The file devel/sage/sa
On Apr 14, 2:08 pm, Rob Beezer wrote:
> Rinse, repeat. First iteration is below. By the time I get to degree
> 3 the factorizations are taking about 8 hours. My question: is there
> a more efficient way to do this?
Divisions are faster than the factorization - divide by (x-a), then by
(x-b),
On Fri, Apr 9, 2010 at 1:19 AM, Anders Kabell Kristensen wrote:
> Hello William,
> I am currently looking for an implementation of Strassens algorithm for
> matrix multiplication for use in Python. I'm interested in using the
> implementation as a black box, so an interface to a C/C++ implementati
Thank you Mike and Jason!
I completely forgot about the * notation. You have both been very helpful.
On Wed, Apr 14, 2010 at 9:41 PM, Mike Hansen wrote:
> On Wed, Apr 14, 2010 at 11:39 AM, William Laffin
> wrote:
>> Hello helpful sage-support list!
>>
>> Is this the following normal behavior?
On Wed, Apr 14, 2010 at 11:39 AM, William Laffin
wrote:
> Hello helpful sage-support list!
>
> Is this the following normal behavior?
> ...
> sage: for x in itertools.chain(itertools.imap(Permutations,range(4))):
> print x
> :
> Standard permutations of 0
> Standard permutations of 1
> Stan
Hello,
I think this is normal. Perhaps you meant the following (note the *
which expands the single argument into its components):
sage: for x in itertools.chain(*itertools.imap(Permutations,range(4))):
print x
[]
[1]
[1, 2]
[2, 1]
[1, 2, 3]
[1, 3, 2]
[2, 1, 3]
[2, 3, 1]
[3, 1, 2]
[3, 2, 1]
Hello helpful sage-support list!
Is this the following normal behavior?
sage: import itertools
sage: for x in itertools.imap(Permutations,range(4)):
: for y in x:
: print y
:
[]
[1]
[1, 2]
[2, 1]
[1, 2, 3]
[1, 3, 2]
[2, 1, 3]
[2, 3, 1]
[3, 1, 2]
[3, 2, 1]
sage: for x in it
I'm designing a set of exercises for my students that are studying
Galois theory for the first time. I thought it would be "fun" for
them to create a tower of field extensions that creates a splitting
field with a Galois group that is not solvable (S_5 in this case).
So starting with the polynomi
On Apr 14, 3:17 am, Dan Drake wrote:
> Hello sage-support (but mostly Nick Alexander),
>
> I'm starting to use Sage mode, and overall it seems quite nice but today
> it locked up my emacs session. I was using a "run-sage"
> (...)
> so, when point was at the "u"
> in "exhau", I hit tab -- and the
Hello sage-support (but mostly Nick Alexander),
I'm starting to use Sage mode, and overall it seems quite nice but today
it locked up my emacs session. I was using a "run-sage" window with the
following:
sage: load /path/to/my/file.sage
sage: n = 0
sage: while True:
: print 2*
12 matches
Mail list logo
