On 2013-01-31, Rachel Poe wrote:
> Hi,
> I'm trying to install the openmpi-1.4.3 package for my research and keep
> getting this error:
>
> *** C compiler and preprocessor
> checking for style of include used by make -j 1... none
> checking for gcc... gcc
> checking for C compiler default output
Hi,
I'm trying to install the openmpi-1.4.3 package for my research and keep
getting this error:
*** C compiler and preprocessor
checking for style of include used by make -j 1... none
checking for gcc... gcc
checking for C compiler default output file name...
configure: error: in
`/Applicatio
On 2013-01-29, dfrie...@gmail.com wrote:
> Dmitrii,
>
> Thanks very much. Sorry for the dumb posting. I should have mentioned
> in my posting that I'm just getting into MILP in Sage.
>
> Would it be equally dumb to post a question asking if there is an
> arbitrary precision real arithmetic sol
Thank you.
On 30 January 2013 10:17, Charles Bouillaguet wrote:
> On Jan 30, 2013, at 3:20 PM, Santanu Sarkar wrote:
>
> >
> > N=8
> > R.=Integers(N)[]
> > f=x^2-1
> > print f.roots()
>
>
> Try :
>
> sage: print f.roots(multiplicities=False)
> [1, 3, 5, 7]
>
> It's a start...
> ---
> Charles Bou
On Wednesday, January 30, 2013 8:26:16 AM UTC-5, LFS wrote:
>
> Hi guys - I am sure that there is much more available. But actually
> William you hit the nail on the head. The page I used was "a small
> undergraduate student project" and its contents are useful and accessible.
> That is the le
On Jan 30, 2013, at 3:20 PM, Santanu Sarkar wrote:
>
> N=8
> R.=Integers(N)[]
> f=x^2-1
> print f.roots()
Try :
sage: print f.roots(multiplicities=False)
[1, 3, 5, 7]
It's a start...
---
Charles Bouillaguet
http://www.lifl.fr/~bouillaguet/
--
You received this message because you are subsc
I want to solve a polynomial over ring.
However my code does not work.
N=8
R.=Integers(N)[]
f=x^2-1
print f.roots()
In my case, N is always a power of 2.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop
Hi guys - I am sure that there is much more available. But actually William
you hit the nail on the head. The page I used was "a small undergraduate
student project" and its contents are useful and accessible. That is the
level I want - so a student or someone like me can use Sage in place of
This user has asked this question multiple times, and if there isn't
something strange about the computer, this is a fairly significant and
unexpected regression, presumably due to the new(est) "Flask" notebook
changes. I have to say that we haven't heard much about it, but then
again perhaps not
I don't know if it is the right place to ask this. I have asked in
sage-notebook list but got no response.
The problem is that i am running a server with sage 5.2 version. Now i
want to upgrade to sage 5.6, but the notebook directory seems to be
incompatible somehow.
When i try to run it, an
On Tuesday, January 29, 2013 11:47:35 PM UTC+1, Jason Grout wrote:
>
> When we upgrade numpy [1], we should also seriously look at including
> pandas [2]
>
big +1 from me. And I would also like to see statsmodels :-)
http://statsmodels.sourceforge.net/
H
--
You received this message because
Dmitrii,
Thanks very much. Sorry for the dumb posting. I should have mentioned
in my posting that I'm just getting into MILP in Sage.
Would it be equally dumb to post a question asking if there is an
arbitrary precision real arithmetic solver for MILP in Sage? (maybe a
version of GLPK?)
Hi,
I am a new user of Sage. I have installed Python, Aptana Studio 3 and Sage
(using VM Virtualbox). I found following explanation on this group but it is
still confusing for me to setup.
http://www.mailinglistarchive.com/html/sage-support@googlegroups.com/2012-01/msg00011.html
it says that
Thanks. If asked, I vote for "opacity". It is memorable. :)
On Wednesday, 30 January 2013 10:34:04 UTC+1, P Purkayastha wrote:
>
> On 01/30/2013 05:02 PM, LFS wrote:
> > I don't know if you are desperate (then this is a decent idea) or trying
> > to teach others (not so good an idea)
> > When d
On 01/30/2013 05:02 PM, LFS wrote:
I don't know if you are desperate (then this is a decent idea) or trying
to teach others (not so good an idea)
When desperate, I add invisible points and use show(). (Unfortunately
invisible points depend on your plot type since alpha=0 is for 2d and
opacity=0 i
I don't know if you are desperate (then this is a decent idea) or trying to
teach others (not so good an idea)
When desperate, I add invisible points and use show(). (Unfortunately
invisible points depend on your plot type since alpha=0 is for 2d and opacity=0
is for 3d...HINT to developers to c
16 matches
Mail list logo
