On Sat, Nov 8, 2008 at 3:39 PM, Jason Merrill <[EMAIL PROTECTED]> wrote:
>
> I was looking at
> http://groups.google.com/group/sage-support/browse_thread/thread/c84c02aa5fca898,
> in which the poster complained of an integral Sage does incorrectly,
> so I thought I'd see if Sympy could do it. In
I was looking at
http://groups.google.com/group/sage-support/browse_thread/thread/c84c02aa5fca898,
in which the poster complained of an integral Sage does incorrectly,
so I thought I'd see if Sympy could do it. In fact, Sympy fails the
simpler case below
>>> from sympy import Symbol, sin, integ
Does anyone know a good (fast) way of determining the number of
permutations needed to order a short list of integers say 10 or less and
that would also return the ordered list?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Go
On Tue, Nov 4, 2008 at 3:27 AM, Robert Kern <[EMAIL PROTECTED]> wrote:
>
> On Mon, Nov 3, 2008 at 20:09, Brian Granger <[EMAIL PROTECTED]> wrote:
>>
>> Ondrej,
>>
>> OK, gives me a bit more context about the history of all of this.
>> But, I am definitely in favor of the localizing logic into clas
On Sat, Nov 8, 2008 at 11:58 PM, Alan Bromborsky <[EMAIL PROTECTED]> wrote:
>
> Does anyone know a good (fast) way of determining the number of
> permutations needed to order a short list of integers say 10 or less and
> that would also return the ordered list?
Well, for 10 or less items, I gues
