On Sun, Apr 25, 2010 at 1:39 PM, Dr. David Kirkby
wrote:
> I can do the following in Mathematica.
>
> In[1]:= TrigReduce[ Sin[x] Cos[y]]
>
> Sin[x - y] + Sin[x + y]
> Out[1]= ---
> 2
>
> Is there a way to get the same result in Sage?
There is a trig_re
I can do the following in Mathematica.
In[1]:= TrigReduce[ Sin[x] Cos[y]]
Sin[x - y] + Sin[x + y]
Out[1]= ---
2
Is there a way to get the same result in Sage?
I'm trying to model and RF mixer, which basically multiples two sinusoids. It
creates p
David Joyner wrote:
The new version is available on amazon.com.
(Search for "stein sage 4.3.5" and you'll get it.)
It does not seem to be on amazon.co.uk (yet?).
I'm pretty sure it will not be on Amazon UK - full stop. This is one of the
regular grips of people on the Create Space forums.
Da
On 25 April 2010 20:34, David Joyner wrote:
> The new version is available on amazon.com.
> (Search for "stein sage 4.3.5" and you'll get it.)
> It does not seem to be on amazon.co.uk (yet?).
>
No -- though I was offered instead
"Sage Stein
www.CafePress.co.uk - Show Your Sage Pride with U
On 25 Apr., 21:53, "Georg S. Weber"
wrote:
> Hi Gonzalo,
>
> quick answer:
> this is known, and short-term, few to nothing will be done about it.
>
> Long answer:
> The usage of dynamic libraries has its advantages --- and the one
> disadvantage, that parts of the code have to be able to "find" ot
Minh Nguyen wrote:
Hi John,
On Mon, Apr 26, 2010 at 2:06 AM, John Palmieri
wrote:
Hi Minh and Harald,
I would like some help with the last parts of the Sage release process
for Sage 4.4: producing binaries and updating the web page. First,
binaries: I've produced a sage.math binary, and I wi
Hi Gonzalo,
quick answer:
this is known, and short-term, few to nothing will be done about it.
Long answer:
The usage of dynamic libraries has its advantages --- and the one
disadvantage, that parts of the code have to be able to "find" other
parts of the code during runtime dynamically. There ar
The new version is available on amazon.com.
(Search for "stein sage 4.3.5" and you'll get it.)
It does not seem to be on amazon.co.uk (yet?).
On Fri, Apr 9, 2010 at 10:03 PM, William Stein wrote:
> Hi,
>
> Who is responsible for the Sage Tutorial being at Amazon.com? I was
> giving a workshop t
On 25 Apr., 20:26, Gonzalo Tornaria wrote:
> >> I hope that somebody has a better idea of how to fix this bug.
>
> > At least chmod og-r on all binaries, too (on a multiuser/open system).
>
> I don't see how that fixes anything (that isn't fixed by just moving
> away the build directory or buildin
On Sun, Apr 25, 2010 at 2:59 PM, Nathan O'Treally wrote:
> On 25 Apr., 19:07, Gonzalo Tornaria wrote:
> This is actually a security issue, too. (Imagine e.g. a Sage bdist was
> compiled in /tmp: Everybody could place arbitrary code in a fake
> library there. Or he could even look into the Sage bi
On Sun, Apr 25, 2010 at 1:26 PM, Nathan O'Treally wrote:
> On 25 Apr., 17:11, Gonzalo Tornaria wrote:
>> I'd rather have
>>
>> sage: 1/3 == GF(3)(1)
>>
>> raise a ZeroDivisionError, and
>
> I'd prefer TypeError (or coercion error, "incompatible types", not yet
> existent I guess)
I think you
On Sun, Apr 25, 2010 at 2:07 PM, Gonzalo Tornaria
wrote:
> I'm having an issue with sage relocation, and wonder if this is known or not.
> [...]
> Moreover, if I move the directory /scratch/tornaria/sage-4.3.3 away,
> and restart sage, it works perfectly, and sqlite and freetype are
> loaded from
On 25 Apr., 19:07, Gonzalo Tornaria wrote:
> For starters, it means that compilation meant to create a -bdist
> should be done on a *randomly named* directory which is moved away
> after the compilation/bdist is finished. Otherwise, we risk that the
> user has old stuff in a directory matching th
On 25 Apr., 03:30, John H Palmieri wrote:
> On Apr 24, 3:20 pm, John H Palmieri wrote:
> > On Apr 24, 9:46 am, "Nathan O'Treally" wrote:
> > > What about
> > > - tickets *not* merged though reviewed positive [since N days/
> > > weeks...]
> > > - tickets not merged because currently still ne
I'm having an issue with sage relocation, and wonder if this is known or not.
My setup is as follows:
I have a fast filesystem mounted on /scratch (two 15k sas disks on
hardware raid0). I compiled sage 4.3.3 on this scratch filesystem
(it's noticeable faster). Then I created a binary tarball usin
On 25 Apr., 17:11, Gonzalo Tornaria wrote:
> Also, the "== doesn't fail" part seems to force this, since it would
> be even more awkward to hide the coercion failure.
See my last two posts. In addition, Sage behaves different to Python
in many other cases.
(I'd say it is *necessary* to break Pyth
Hi folks,
I have wrapped up a binary for t2.math. It's up at
http://sage.math.washington.edu/home/mvngu/t2.math-bin/sage-4.4.rc0-t2.math.tar.gz
--
Regards
Minh Van Nguyen
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
s
On 25 Apr., 09:30, Simon King wrote:
> * Other users may believe that a rose is a rose is a rose, and 1 is 1
> is 1. Such users would find it gross that GF(2)(1)==1 and 1==GF(3)(1),
> but GF(3)(1)!=GF(2)(1).
Btw, a rose might be a rose in Python, but not in Sage:
>>> 1 is 1 # Python
True
sage:
On 25 Apr., 07:30, Robert Bradshaw
wrote:
> Are you looking for something
> likehttp://www.sagemath.org/doc/reference/sage/structure/coerce.html
> ? It could probably be written up better, but we don't want too much
> redundancy.
There's also http://www.sagemath.org/doc/reference/coercion.ht
On Fri, Apr 23, 2010 at 11:07 PM, Nathan O'Treally wrote:
> "[...] A coercion from one parent to another must be defined on the
> whole domain, and always succeeds. As it may be invoked implicitly, it
> should be obvious and natural (in both the mathematically rigorous and
> colloquial sense of th
On 25 Apr., 08:10, Robert Bradshaw
wrote:
> On Apr 23, 2010, at 7:07 PM, Nathan O'Treally wrote:
> > The Tutorial (http://www.sagemath.org/doc/tutorial/
> > programming.html#loops-functions-control-statements-and-comparisons)
> > gives another example:
> > sage: GF(5)(1) == QQ(1); QQ(1) == GF(5)(1
On 25 Apr., 08:10, Robert Bradshaw
wrote:
> On Apr 23, 2010, at 7:07 PM, Nathan O'Treally wrote:
> > Though e.g. C and C++ do have automatic (or implicit) conversion, it
> > is usually referred to as (different kinds of) type *casts*.
> > C++ does have additional explicitly stated kinds of convers
Problem solved. I found that using // to divide polynomials
(univariate, over a number field) yields an element of the fraction
field when done in .py. In order to get the quotient in the ring
itself I now use quo_rem().
Patch up at #8378 shortly, as soon as I have added a couple of doctests.
J
On 24 April 2010 23:04, William Stein wrote:
> On Sat, Apr 24, 2010 at 12:27 PM, John Cremona wrote:
>> Successful build and testall on 32-bit ubuntu.
>>
My test did not include long; trying again...
John
>> John
>
> I get a repeated segfault on 32-bit ubuntu (and some other 32-bit
> linux's
Hi Robert!
On 25 Apr., 07:30, Robert Bradshaw
wrote:
> Are you looking for something
> likehttp://www.sagemath.org/doc/reference/sage/structure/coerce.html
> ? It could probably be written up better, but we don't want too much
> redundancy.
This is why I asked whether there should be a sect
25 matches
Mail list logo
