doc-html] Error 1
>make[2]: *** [Makefile:2160: all-start] Error 2
>make[2]: Leaving directory '/usr/local/Math_Software/sage-9.3/build/make'
>
> I've tried it both with "./configure --with-system-flint=no" and with
> "./configure --with-system-arb
make[2]: *** [Makefile:2160: all-start] Error 2
make[2]: Leaving directory '/usr/local/Math_Software/sage-9.3/build/make'
I've tried it both with "./configure --with-system-flint=no" and with
"./configure --with-system-arb=no" and with a simple "./configu
robenius_polynomial
1 of 26 in
sage.schemes.hyperelliptic_curves.hyperelliptic_finite_field.HyperellipticCurve_finite_field.frobenius_polynomial_pari
[381 tests, 2 failures, 48.84 s]
Sincerely,
Greg Marks
------
| Greg Marks
x, 0, '+')
0
(If nothing else, users can be appropriately skeptical if Maxima and
SymPy are giving different answers.)
Sincerely,
Greg Marks
----
| Greg Marks |
| Department of Mathematics and Com
x), x=0, dir='+')
+Infinity
Sincerely,
Greg Marks
----
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis University |
| St. Louis, MO 63103
A problem that arose in a recent calculus class involved practical methods
for finding a numerical estimate of the arc length of the curve y = x^3
from (0,0) to (2,8). So, one might ask, could one use SAGE to perform
this computation, say, to 1 decimal places? (By the way, I don't thi
Building SAGE 5.2 from source in Ubuntu 10.04, I encountered a problem and
found a solution; I hope it is not inappropriate to record it here so that
anyone experiencing the same problem can find the solution with a Web
search. Starting SAGE from the sage-5.2 directory immediately after
runnin
b,
tar) in the README.txt file.
Sincerely,
Greg Marks
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis University |
| St. Louis, MO
*exp(-a)/2^a).simplify_full()
2^(log(2/3)/(log(2) + 1))*3^(log(2)/(log(2) + 1))*e^(-log(2)^2/(log(2) +
1))
Sincerely,
Greg Marks
| Greg Marks |
| Department of Mathematics and Computer Science
particular sum.
Best regards,
Greg Marks
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis University |
| St. Louis, MO
s the threefold improvement in speed due to any change in
the factorization algorithm between SAGE 4.1.1 and SAGE 4.5.2?
Or is it due to a difference in hardware, or something else?
Best regards,
Greg Marks
| Greg
It sounds like a C program using MPFR (http://www.mpfr.org)
would do what you want. As MPFR is built into SAGE, you might
perhaps find it more convenient to invoke MPFR within SAGE.
Sincerely,
Greg Marks
| Greg Marks
Is there a SAGE command that will produce a primality
certificate for a (prime) integer input?
Best regards,
Greg Marks
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis
ing you're
looking for. The worksheet can be found as a text file at:
http://gmarks.co.cc/nr.txt
Comments and critiques from all are certainly welcome.
Sincerely,
Greg
----
| Greg Marks |
ine of the fraction, as well as the left-hand side
of the equation $y = \frac{1}{\displaystyle 1 + x^2}$,
and then tinkering with the sizes and alignment, but this
seems extremely tedious.
I admit this is a pretty minor issue, but I'd like to be
able to fix it.
Sincerely,
Greg
n for several of
my classes to SAGE, and have been advising my students
how far superior SAGE is to Maple and Mathematica!
Sincerely,
Greg
----
| Greg Marks |
| Department of Mathematic
've understood him correctly, I'm not
losing anything vital by discarding all but the worksheet.txt files.
For other UNIX shells you might need to change the syntax slightly,
and
if you have more than 100 sage worksheets, you might want to edit the
"sed 's/^[0-9]$/0&/g'&quo
wrong?
Sincerely,
Greg
--------
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis University |
| St. Louis, MO 63103-2007
ng is artinian (in fact, a finite-dimensional
algebra), and hence has a nilpotent Jacobson radical; the
problem is to determine the smallest positive integer n
such that for every a in the Jacobson radical, a^n = 0.
Sincerely,
Greg
| Greg
his with the security considerations mentioned
earlier? How about speed considerations?
Sincerely,
Greg
-
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis University
the build problem.
I have a separate question about some of the algorithms used by
SAGE and some competitors; I'll ask about it under a different
thread.
Thanks again!
Best regards,
Greg
-
hat is informative). Have I done something stupid, and is it
corrigible?
Best regards,
Greg
-----
| Greg Marks |
| Department of Mathematics and Computer Science |
| St. Louis Unive
22 matches
Mail list logo
