Rolandb ha scritto:
> Hi,
> I’m away for three weeks and I want to let my PC doing some
> calculations during 20 days.
> Now, I’m running the risk that after a few days the computer stops et
> cetera, so that the results are lost.
>
Among others precautions, you should to write your IP somewhe
Hi,
Already in March I reported this problem.
http://groups.google.com/group/sage-support/browse_thread/thread/1dbc0160a9d70c5/ae5e660def75547?q=#0ae5e660def75547
Uploading a small file is going well, but a file larger then 3Mb takes
ages where after the connection is aborted.
Using Sage 4.1, VM
Hi,
I’m away for three weeks and I want to let my PC doing some
calculations during 20 days.
Now, I’m running the risk that after a few days the computer stops et
cetera, so that the results are lost.
What are save ways to store results? I expect that the total output is
a few Mb.
What I would lik
I'm sorry for the deluge of questions, but I hope you will bear with
me as I come up to speed. This one is more substantive and I think
related to my first question yesterday about simplify() not
simplifying enough. Now, I have two equations with two unknowns I'm
trying to solve and I'm getting
Thank you so much
On 7/15/09, David Joyner wrote:
>
>
> I don't think this is implemented yet in Sage.
>
>
> On Wed, Jul 15, 2009 at 8:55 AM, arun Muktibodh
> wrote:
> > I want to test the limits order of nilpotency class of certain infinite
> > groups. How should I go about it? Please help.
> >
I did try your first suggestion again, and that worked. Since I'm
running one instance of notebook under a single user, this works
great. Thanks again.
On Jul 15, 4:25 pm, dw wrote:
> Correction to my last post. I thought that was working, but it seems
> the module was still imported from a p
What is going on here? Does this only work for even weights? rje
sage: n=numerical_eigenforms(15,3);n.ap(2)
[]
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support-
Correction to my last post. I thought that was working, but it seems
the module was still imported from a previous import call. I've added
the line to the all.py file, do I need to re-build sage in any way for
this to take effect? I've tried restarting the server with no luck.
On Jul 9, 2:08 p
thank you very much for sharing this!
maurizio
On 15 Lug, 21:47, dw wrote:
> I was able to find a solution to my problem. If anyone else wants to
> do the same thing, I added the following function to unum/__init_.py.
>
> def round(self, sig_fig):
> ''' returns a string representatio
The third entry gives the precicion.
On Jul 15, 4:12 pm, Gustavo Rama wrote:
> Thanks, I'll try it.
> Cheers Gustavo
>
> On Jul 14, 10:42 pm, Simon King wrote:
>
> > Hi Gustavo!
>
> > On 15 Jul., 03:17, Gustavo Rama wrote:
>
> > > But how con you get the time of execution in a variable?
>
> >
Hi!
On 15 Jul., 21:26, Carlos Córdoba wrote:
> This is not about RTFM, because L1.sort() doesn't produce any result. It
> just modifies the original list in place.
... and this is precisely what the manual tells you.
However, you are right:
> I think that Mikie wants to assign the sorted list
Carlos,
just what I needed.
I have looked in scipy, but no Quartiles.
On Jul 15, 1:26 pm, Carlos Córdoba wrote:
> This is not about RTFM, because L1.sort() doesn't produce any result. It
> just modifies the original list in place.
>
> I think that Mikie wants to assign the sorted list to another
I was able to find a solution to my problem. If anyone else wants to
do the same thing, I added the following function to unum/__init_.py.
def round(self, sig_fig):
''' returns a string representation of the number w/ units
showing only the set number of significant digits
This is not about RTFM, because L1.sort() doesn't produce any result. It
just modifies the original list in place.
I think that Mikie wants to assign the sorted list to another list. In that
case what you need is the sorted command:
sage: L1 = [56,2,4,10]
sage: sort_L1 = sorted(L1)
sage: sort_L1
On Jul 15, 2009, at 12:14 , Mikie wrote:
>
> How does one sort a list in Sage? I have tried
>
> L1=[56,2,4,10]
> Sort_ = L1.sort()
>
> and nothing is produced.
As the saying goes, RTFM :-}
sage: L1=[56,2,4,10]
sage: L1.sort?
Type: builtin_function_or_method
Base Class:
String F
Hi Mikie,
On Thu, Jul 16, 2009 at 5:14 AM, Mikie wrote:
>
> How does one sort a list in Sage? I have tried
>
> L1=[56,2,4,10]
> Sort_ = L1.sort()
>
> and nothing is produced.
Try this:
--
| Sage Version 4.1, Release Date: 2009
How does one sort a list in Sage? I have tried
L1=[56,2,4,10]
Sort_ = L1.sort()
and nothing is produced.
I need it to calculate Quartiles. Is there a Quatile function in any
of the modules?
Thanks
--~--~-~--~~~---~--~~
To post to this group, send email to sage
Thanks, I'll try it.
Cheers Gustavo
On Jul 14, 10:42 pm, Simon King wrote:
> Hi Gustavo!
>
> On 15 Jul., 03:17, Gustavo Rama wrote:
>
> > But how con you get the time of execution in a variable?
>
> Using cputime or walltime: No problem, since they return a number.
>
> Using timeit:
>
> Remembe
On Wed, 15 Jul 2009 11:29:37 -0700
William Stein wrote:
>
> On Wed, Jul 15, 2009 at 11:23 AM, Martin
> Albrecht wrote:
> >
> >> That's not surprising given what power_mod does. Do power_mod?? to
> >> see. It's generic code that does the arithmetic in the parent
> >> ring, then calls mod after
On Wed, Jul 15, 2009 at 11:23 AM, Martin
Albrecht wrote:
>
>> That's not surprising given what power_mod does. Do power_mod?? to
>> see. It's generic code that does the arithmetic in the parent ring,
>> then calls mod after each multiply. so in the above first example,
>> zmod_poly is never us
> That's not surprising given what power_mod does. Do power_mod?? to
> see. It's generic code that does the arithmetic in the parent ring,
> then calls mod after each multiply. so in the above first example,
> zmod_poly is never used.
This reminds me: Why do we have power_mod() when pow() doe
I want to include some of my cython code as a sage module. I followed
the directions for adding the .pyx file to the sage library at
http://www.sagemath.org/doc/developer/coding_in_other.html.
However, when I run "sage -b" I get this:
--
sag
On Wed, Jul 15, 2009 at 5:03 AM, Martin
Albrecht wrote:
>
>> For the ring of polynomials with coefficients over ZZ:
>>
>> --
>>
>> | Sage Version 4.1, Release Date: 2009-07-09 |
>> | Type notebook() for the
On Wed, Jul 15, 2009 at 9:06 AM, Doug wrote:
>
> This is all awesome info; I've got some reading to do! and I can't
> believe I didn't try reset!
Also, try typing
sage: trace?
William
>
> Thanks! Doug
>
> On Jul 15, 11:30 am, Jason Grout wrote:
>> Doug wrote:
>> > Two more basic questions I
This is all awesome info; I've got some reading to do! and I can't
believe I didn't try reset!
Thanks! Doug
On Jul 15, 11:30 am, Jason Grout wrote:
> Doug wrote:
> > Two more basic questions I'm hoping you can help with:
>
> > 1. My workstyle so far is to edit my .sage file in emacs and then
I don't think this is implemented yet in Sage.
On Wed, Jul 15, 2009 at 8:55 AM, arun Muktibodh wrote:
> I want to test the limits order of nilpotency class of certain infinite
> groups. How should I go about it? Please help.
> Thanking you in advance.
> Arun
> India
>
> --
> Arun Muktibodh
> >
>
Doug wrote:
> Two more basic questions I'm hoping you can help with:
>
> 1. My workstyle so far is to edit my .sage file in emacs and then load
> it into sage on the command line. Sometimes I want my program to stop
> in the middle so I can more closely examine/verify what it's doing.
> I've bee
Hi all, I have a problem while trying to compile Sage version 4.1 from
source on Fedora 11. The kernel build is 2.6.29.5-191.fc11.x86_64,
running on an AMD Phenom 9650 Quad-Core with 3 GB RAM. The building
process aborts after an hour or so, and gives the error message posted
below. If you need a
Two more basic questions I'm hoping you can help with:
1. My workstyle so far is to edit my .sage file in emacs and then load
it into sage on the command line. Sometimes I want my program to stop
in the middle so I can more closely examine/verify what it's doing.
I've been inserting a line that
> > sage: foo = (x-1)^2/(x+2)^2 + 2*(x-1)/(x+2)
> > sage: bar = foo*(x+2)
> > sage: bar
> > (x + 2)*((x - 1)^2/(x + 2)^2 + 2*(x - 1)/(x + 2))
>
> > How come (x+2) isn't canceling in each of the parts?
>
> Probably because x might be -2. Also, you have to explicitly simplify
> to do any non-trivi
I want to test the limits order of nilpotency class of certain infinite
groups. How should I go about it? Please help.
Thanking you in advance.
Arun
India
--
Arun Muktibodh
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To
> For the ring of polynomials with coefficients over ZZ:
>
> --
>
> | Sage Version 4.1, Release Date: 2009-07-09 |
> | Type notebook() for the GUI, and license() for information.|
>
> --
On Jul 15, 1:46 pm, Santanu Sarkar
wrote:
> Suppose f=2*x^2+3*x+1 is a polynomial in x. How efficiently we
> can calculate f^10 modulo 24?
quite fast i think:
sage: R. = PolynomialRing(Integers(24), x)
sage: R
Univariate Polynomial Ring in x over Ring of integers modulo 24
sage: f = 2*x^2+3*x
On Wednesday 15 July 2009, Santanu Sarkar wrote:
> Suppose f=2*x^2+3*x+1 is a polynomial in x. How efficiently we
> can calculate f^10 modulo 24?
sage: P. = PolynomialRing(Zmod(24))
sage: f = 2*x^2+3*x+1
sage: type(f)
sage: %timeit f**10
10 loops, best of 3: 19 µs per loop
Hi Santanu,
On Wed, Jul 15, 2009 at 9:46 PM, Santanu
Sarkar wrote:
> Suppose f=2*x^2+3*x+1 is a polynomial in x. How efficiently we
> can calculate f^10 modulo 24?
For the ring of polynomials with coefficients over ZZ:
--
| Sa
Suppose f=2*x^2+3*x+1 is a polynomial in x. How efficiently we
can calculate f^10 modulo 24?
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support-unsubscr...@googlegroup
You can also start with a random matrix A and then construct (A +
A.transpose())/2, which would be symmetric. That might vary the
distribution of the coefficients, though.
Cheers
Javier
On Jul 15, 7:13 am, William Stein wrote:
> On Tue, Jul 14, 2009 at 11:09 PM,
>
> pierre.du...@gmail.com wrote
37 matches
Mail list logo
