OK, the problem is as follows. For very straightforward C programs, no
problems occur on t2 because the compiler emits inline code for
everything. However, once the program becomes too complicated for it
to do this, it uses libgcc:
http://gcc.gnu.org/onlinedocs/gccint/Libgcc.html
The problem is,
Ah, got it. LD_LIBRARY_PATH_64 needs to also contain
/home/wbhart/mpir-1.3.0/.libs. Basically if LD_LIBRARY_PATH_64 is not
specified at all, i.e. left blank, the linker uses whatever is in
LD_LIBRARY_PATH. Otherwise it uses LD_LIBRARY_PATH_64 exclusively,
which means that *all* 64 bit library
Hi,
I've search on
http://rpy.sourceforge.net/
and use R with commands inside a Sage script as following:
from sage.all import *
def iunif(a,b):
return Integer(fround(r.runif(1,RDF(a),RDF(b)),0))
def runif(a,b,prec):
return RDF(fround(r.runif(1,RDF(a),RDF(b)),prec))
def rbernoulli():
Hi Pawel,
I'm CC'ing your email to the sage-support mailing list, where more
people could help out with the problem you're reporting.
On Fri, Jan 29, 2010 at 10:14 PM, Pawel Bartoszek
pawelbartos...@gmail.com wrote:
I have been using Sage in teaching for some while now and I have huge
issues
How one can check weather a polynomial f(x,y) is irreducible over rational
or not?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Hi,
On Fri, Jan 29, 2010 at 5:27 AM, kcrisman kcris...@gmail.com wrote:
Another thing you can do is type r.? and you will get a lot of
commands which should work. In my experience, though, it's not
always obvious how to use every command - sometimes arguments in R
need to be input as
Hi!
I'm trying to use COIN to solve a MixedIntegerLinearProgram in sage.
When I get to the command
sage: p.solve(solver=Coin)
I get an error saying Coin/CBC is not installed and cannot be used
to solve this MixedIntegerLinearProgram. To install it, you can type
in Sage: install_package('cbc')
Hi Tyler,
On Sat, Jan 30, 2010 at 3:20 AM, Tyler tseacr...@gmail.com wrote:
SNIP
However, I have installed Coin/CBC. And in fact, if I try the command
sage: install_package('cbc')
I get an error saying Package is already installed. So one part of
sage thinks it is installed, while
(Yes.) I have both 4.2.1 and 4.3 in VirtualBox. I have a couple of
worksheets (only one is important) in 4.2.1, and am trying to get them
to 4.3. I have used the save-to-zip approach, as per instructions,
and pulled it into 4.3. What I get is an ancient trial worksheet that
I used to test
On Fri, Jan 29, 2010 at 5:06 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
How one can check weather a polynomial f(x,y) is irreducible over rational
or not?
sage: R.x,y = QQ[]
sage: f = (x^3-x*y+y^2-x)*(x^5-3/2*x-y); f
x^8 - x^6*y + x^5*y^2 - x^6 - 3/2*x^4 - x^3*y + 3/2*x^2*y -
On Jan 29, 2010, at 11:55 AM, William Stein wrote:
On Fri, Jan 29, 2010 at 5:06 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
How one can check weather a polynomial f(x,y) is irreducible over
rational
or not?
sage: R.x,y = QQ[]
sage: f = (x^3-x*y+y^2-x)*(x^5-3/2*x-y); f
x^8 -
Hi guyz...
im using the binary version of sage for Arch Linux. However, when i run
sage, i got a long error message. I post the error message on the
attachment.
I was able to use sage before, without any error. But the error occured this
morning. so im actually confused why i got the error.
Hello Tyler !!!
Minh, as is his custom, gave you the perfect answer. I also received
several emails about it, and I am still trying to design an acceptable
answer. For the moment, I only added a line about it at the end of a
tutorial on LP using Sage, which may interest you too :
Hi,
If you got the binary version of sage-4.3.1 for 32-bit Arch Linux from
the downloads web page, it's the one I built on my system. And sure
enough, I had the same problem as you yesterday.
Let me guess: did you update your system? In particular, did you
upgrade your gcc from 4.4.2 to 4.4.3
14 matches
Mail list logo
