On Apr 6, 2010, at 11:22 PM, Rolandb wrote:
Hi, some experiences.
I moved from Vista 32 to Windows 7 64 during Easter. I have a Q6700
PC.
Three issues are maybe of general interest.
1) Virtualbox 4.3.4: A clumsy environment so I switched back to (the
new) VMware player 3.01 and (the old) Sage
This is the part in sage, f1,f2,f3 are 3 polynomials and I have to
reduce them by I, the ideal in the line 8. This ideal is a vanishing
ideal of some points.
R = GF(3)['x1,x2,x3,x4'];
R. = PolynomialRing(GF(3), order='degrevlex')
x1,x2,x3 = R.gens();
f1=-x1^3+x1^2*x3-x1^2+x1*x3-x1;
f2=x1^3-x1^2*x3+
Hi, some experiences.
I moved from Vista 32 to Windows 7 64 during Easter. I have a Q6700
PC.
Three issues are maybe of general interest.
1) Virtualbox 4.3.4: A clumsy environment so I switched back to (the
new) VMware player 3.01 and (the old) Sage 4.1. Now I was positively
surprised how cool S
On Apr 6, 9:09 am, Danread5 wrote:
>
> sage: d = sqrt(x^2 + 5^2)
> sage: D = sqrt((20-x)^2 + 10^2)
> sage: T = d + D; T
> sqrt(x^2 + 25) + sqrt((x - 20)^2 + 100)
> sage: diff(T, x)
> (x - 20)/sqrt((x - 20)^2 + 100) + x/sqrt(x^2 + 25)
> sage: solve((x - 20)/sqrt((x - 20)^2 + 100) + x/sqrt(x^2 + 25)
On Tue, Apr 6, 2010 at 12:02 PM, Rolandb wrote:
> Hi, using SAGE 4.1:
>
> %timeit('for k in xrange(2,10): factor(3+10^k)')
>
> 625 loops, best of 3: 1.08 ms per loop
> Traceback (most recent call last):
> File "", line 1, in
> File "/home/notebook/sage_notebook/worksheets/admin/18/code/65.py",
Hello
On Tue, Apr 6, 2010 at 12:02 PM, Rolandb wrote:
> Hi, using SAGE 4.1:
>
> %timeit('for k in xrange(2,10): factor(3+10^k)')
>
> 625 loops, best of 3: 1.08 ms per loop
> Traceback (most recent call last):
> ...
> AttributeError: 'NoneType' object has no attribute 'eval'
This works fine in 4.
Hi, using SAGE 4.1:
%timeit('for k in xrange(2,10): factor(3+10^k)')
625 loops, best of 3: 1.08 ms per loop
Traceback (most recent call last):
File "", line 1, in
File "/home/notebook/sage_notebook/worksheets/admin/18/code/65.py",
line 6, in
print _support_.syseval(timeit('for k in xran
btw: the previous output is _, you can write solve(_,x) on your line.
And another calculation could look like this, in other word, we have
in fact to solve quadratic equation.
sage: d = sqrt(x^2 + 5^2)
sage: D = sqrt((20-x)^2 + 10^2)
sage: T = d + D; T
sqrt(x^2 + 25) + sqrt((x - 20)^2 + 100)
sag
Hi
sage: solve((x - 20)/sqrt((x - 20)^2 + 100) + x/sqrt(x^2 + 25) == 0,
x, to_poly_solve=True)
[x == (20/3)]
Robert M.
On 6 dub, 15:09, Danread5 wrote:
> Hi all,
>
> My first post...
>
> I seem to be having trouble with solving for x in the following:
>
> sage: d = sqrt(x^2 + 5^2)
> sage: D =
Hi all,
My first post...
I seem to be having trouble with solving for x in the following:
sage: d = sqrt(x^2 + 5^2)
sage: D = sqrt((20-x)^2 + 10^2)
sage: T = d + D; T
sqrt(x^2 + 25) + sqrt((x - 20)^2 + 100)
sage: diff(T, x)
(x - 20)/sqrt((x - 20)^2 + 100) + x/sqrt(x^2 + 25)
sage: solve((x - 20)/
Can you post the system you are working with? Or if its very large,
post a link to a file? I don't work over finite fields myself, so the
current implementation is probably very biased towards QQ. It would
help me to see a "real life" example.
Thanks,
Marshall Hampton
On Apr 6, 2:04 am, Andrea
On Apr 6, 2010, at 12:17 AM, Paul Zimmermann wrote:
If one wants to have the same answer as Python does (always
nonnegative),
then function math.fmod can be used. For example,
sage: from math import fmod
sage: fmod(6e-6,10e-6)
6.0002e-06
first Python does not always give a nonneg
> If one wants to have the same answer as Python does (always nonnegative),
> then function math.fmod can be used. For example,
> sage: from math import fmod
> sage: fmod(6e-6,10e-6)
> 6.0002e-06
first Python does not always give a nonnegative result:
>>> (6e-6) % (-10e-6)
-4.000
> >> sage
> >> Sage Version 4.3.5, Release Date:
> >> 2010-03-28
> >> sage: 1+1
> >> 2
> >> sage: 6e-6 % 10e-6
> >> -4.00e-6
> >>
> >> I'm sure sage is wrong.. :(
> >
> > They're both the same...
>
> No they aren't.
>
> If you type
>
> sage: s = 6e-6
> sage: s.__mod__??
>
> then you
Thank you for the answer...I have some question:
-I have gf=I.groebner_fan(); where I is a 0-dimentional ideal. Now gf
has the function gf.weight_vectors(); This returns the weight vectors
corresponding to the reduced Groebner bases. I try to call
polyedralfan() but it raises an error...maybe becau
15 matches
Mail list logo
