Robert Bradshaw wrote:
>> sage: x = SR.var('x')
>> sage: bool(arctan(1+abs(x)) == pi/2 - arctan(1/(1+abs(x
>> False
>
> Better returning True when the CAS isn't strong enough to prove
> equality (which may well be most of the time).
Sure. But why not have
sage: bool(sin(x)^2+cos(x)^2==1)
Tru
Julien Puydt wrote:
I wanted to help review #14364.
The (very old) testjava.sh foo, or was that a typo?
So I cloned sage,
Not immediately clear to me what you mean by that; which version of
Sage? Already built and up-to-date?
checked out the ticket's branch, exported
SAGE_ATLAS_LIB an
Dear list,
The tutorial[1] mentions
- More generally, Sage-specific special methods are usually named
``_meth_`` rather than ``__meth__``. For example, lots of classes
implement ``_hash_`` which is used and cached by ``__hash__``.
This seemed a bit strange to me, as I have seen __hash__ quite
of
Hello guys !
I wanted to ask you if you had ever found the pdf version of the manual
useful for anything, or if we could just give it up.
The problem we have is that the category/ folder contains things like
class A:
class B:
class C:
class D:
def Hey():
(remember that removing the pdf manual can also save trees, for it is
likely that some people got the idea to print these files :-P)
On 12 June 2014 14:43, Nathann Cohen wrote:
> Hello guys !
>
> I wanted to ask you if you had ever found the pdf version of the manual
> useful for anything, or i
The Magma Handbook has 5583 pages -- remember the mission statement!
Of course I never look at the Sage pdf reference (OK, I just did -- it
is rather beautiful)
John
On 12 June 2014 13:45, Nathann Cohen wrote:
> (remember that removing the pdf manual can also save trees, for it is likely
> that
Hi Nathann,
On 2014-06-12, Nathann Cohen wrote:
> (remember that removing the pdf manual can also save trees, for it is
> likely that some people got the idea to print these files :-P)
Some people print html pages...
Anyway: I have never used the pdf manual, and if it is correct that the
line w
I don't usually read the pdf docs either, but it is the only test that the
math in doctstrings actually validates. Sphnix doesn't know if the
`\frac{1}{2}` in the doctstring is admissible math, and if not it'll only
fail in the browser when the end-user tries to read the docs...
On Thursday
On 12 June 2014 14:54, Volker Braun wrote:
> I don't usually read the pdf docs either, but it is the only test that the
> math in doctstrings actually validates. Sphnix doesn't know if the
> `\frac{1}{2}` in the doctstring is admissible math, and if not it'll only
> fail in the browser when the en
On Thursday, June 12, 2014 12:48:37 AM UTC-7, Marc Mezzarobba wrote:
>
> Sure. But why not have
>
> sage: bool(sin(x)^2+cos(x)^2==1)
> True
>
> return False as well, and let the user test that
>
> (rhs-lhs).simplify_full() == 0
>
That would probably be even desirable if you want to make SR mo
Hi,
Le 12/06/2014 10:12, leif a écrit :
Julien Puydt wrote:
I wanted to help review #14364.
The (very old) testjava.sh foo, or was that a typo?
So I cloned sage,
Not immediately clear to me what you mean by that; which version of
Sage? Already built and up-to-date?
checked out the tick
On Thursday, June 12, 2014 10:03:55 AM UTC-4, John Cremona wrote:
>
> On 12 June 2014 14:54, Volker Braun >
> wrote:
> > I don't usually read the pdf docs either, but it is the only test that
> the
> > math in doctstrings actually validates. Sphnix doesn't know if the
> > `\frac{1}{2}` in th
> +1 to this argument.
Indeed, it is a good argument.
We have to do something about this undocumented functions, though.
Oh, and it would be cool if --warn-links was the default for doc
building, too :-P
Nathann
--
You received this message because you are subscribed to the Google Groups
"sa
Sounds like your gcc is broken... try "export SAGE_INSTALL_GCC=yes && make"
On Thursday, June 12, 2014 4:48:43 PM UTC+1, Snark wrote:
>
> make
>
> I followed them again today, and it failed again, this time in ppl
> because "'ptrdiff_t' does not name a type" -- so not the same problem.
>
>
-
On Thu, Jun 12, 2014 at 8:41 AM, Nils Bruin wrote:
> On Thursday, June 12, 2014 12:48:37 AM UTC-7, Marc Mezzarobba wrote:
>>
>> Sure. But why not have
>>
>> sage: bool(sin(x)^2+cos(x)^2==1)
>> True
>>
>> return False as well, and let the user test that
>>
>> (rhs-lhs).simplify_full() == 0
>
> That
On Thu, Jun 12, 2014 at 12:50 AM, Marc Mezzarobba wrote:
> But here is a similar example right from the Sage library (adapted from
> http://wiki.sagemath.org/EqualityCoercion):
>
> sage: FiniteEnumeratedSet(GF(3))
> {0, 1, 2}
> sage: add(FiniteEnumeratedSet([0,1,2]))
> 0
Um, isn't that what you
2014-06-12 19:10 UTC+02:00, Robert Bradshaw :
> On Thu, Jun 12, 2014 at 8:41 AM, Nils Bruin wrote:
>> On Thursday, June 12, 2014 12:48:37 AM UTC-7, Marc Mezzarobba wrote:
>>>
>>> Sure. But why not have
>>>
>>> sage: bool(sin(x)^2+cos(x)^2==1)
>>> True
>>>
>>> return False as well, and let the user
2014-06-12 19:13 UTC+02:00, Robert Bradshaw :
> On Thu, Jun 12, 2014 at 12:50 AM, Marc Mezzarobba
> wrote:
>
>> But here is a similar example right from the Sage library (adapted from
>> http://wiki.sagemath.org/EqualityCoercion):
>>
>> sage: FiniteEnumeratedSet(GF(3))
>> {0, 1, 2}
>> sage: add(Fi
On Thu, Jun 12, 2014 at 10:19 AM, Vincent Delecroix
<20100.delecr...@gmail.com> wrote:
> 2014-06-12 19:13 UTC+02:00, Robert Bradshaw :
>> On Thu, Jun 12, 2014 at 12:50 AM, Marc Mezzarobba
>> wrote:
>>
>>> But here is a similar example right from the Sage library (adapted from
>>> http://wiki.sagem
On Thursday, June 12, 2014 6:44:44 PM UTC+1, William wrote:
>
> > sage: sum(FiniteEnumeratedSet([0,1,2]))
> > 3
> > sage: FiniteEnumeratedSet(GF(3))
> > sage: sum(FiniteEnumeratedSet([0,1,2]))
> > 0
>
> But I would rather blame the use of caching rather than equality
> testing.
The issue i
Hi,
Le 12/06/2014 18:42, Volker Braun a écrit :
Sounds like your gcc is broken... try "export SAGE_INSTALL_GCC=yes && make"
Oh! Excellent point! I have gcc 4.9.0, which is a fairly recent version!
Trying to compile sage 6.2 with it (from the tarball) ; adding -k to the
MAKE export so I get a
Julien Puydt wrote:
Hi,
Le 12/06/2014 18:42, Volker Braun a écrit :
Sounds like your gcc is broken... try "export SAGE_INSTALL_GCC=yes &&
make"
Oh! Excellent point! I have gcc 4.9.0, which is a fairly recent version!
Trying to compile sage 6.2 with it (from the tarball) ; adding -k to the
MA
On Thu, Jun 12, 2014 at 10:19 AM, Vincent Delecroix
<20100.delecr...@gmail.com> wrote:
> 2014-06-12 19:13 UTC+02:00, Robert Bradshaw :
>> On Thu, Jun 12, 2014 at 12:50 AM, Marc Mezzarobba
>> wrote:
>>
>>> But here is a similar example right from the Sage library (adapted from
>>> http://wiki.sagem
Volker Braun gmail.com> writes:
> > sage: FiniteEnumeratedSet(GF(3))
> > sage: sum(FiniteEnumeratedSet([0,1,2]))
> > 0
> But I would rather blame the use of caching rather than equality
> testing.
> Just removing the caching here isn't that easy, FiniteEnumeratedSet really
is just a UniqueReprese
>>> I'll second this. Are there *any* computer algebra systems (or
>>> programming languages for that matter) out there such that 4/2 != 2 !=
>>> 2.0? Code would simply be too hard to write.
>>
>> Ada, I guess. It should give error if you try to compare integer with float.
>
> Ah, no wonder it's s
25 matches
Mail list logo
