According to the wiki, Pyglet is an optional dependency, but it does
not work without it (it fails with an ImportError).
Aaron Meurer
On Tue, Aug 2, 2011 at 9:40 PM, Aaron Meurer wrote:
> Hi.
>
> I'll look at this and report what I think about it, but I just want to
> note that people should use
Hi.
I'll look at this and report what I think about it, but I just want to
note that people should use the following urls to clone. The ones you
gave are the ssh urls, and are for you only.
sympy-notebook: git://github.com/smagura/sympy-notebook.git
sympy fork: git://github.com/smagura/sympy.git
Hi folks,
I wanted to share a sympy-related project that I have been working on. It is
a pretty standard notebook interface, and will seem really familiar if
you've used Mathematica or similar CAS front-ends. I've borrowed a lot of
code from the earlier Symbide project. I'm calling it sympy not
On Tue, Aug 2, 2011 at 4:37 PM, Vladimir Perić wrote:
> Hello,
>
> per the discussion on [1], it was decided to support Python 3 with a
> script that will copy non-mpmath code to a different directory
> ("sympy-py3k"), run 2to3 on it, then copy the mpmath stuff over. I
> implemented such a script
Hello,
per the discussion on [1], it was decided to support Python 3 with a
script that will copy non-mpmath code to a different directory
("sympy-py3k"), run 2to3 on it, then copy the mpmath stuff over. I
implemented such a script with this commit[2] (if the commit gets
rebased away, it's in my p
This doesn't work, as you have to take care of precision (try
computing fib(10)). I suspect that it's also slower when you do
that, though Fredrik would have to comment.
Also, note that we already have a GoldenRation object.
Aaron Meurer
On Tue, Aug 2, 2011 at 3:47 PM, Matthew Rocklin wrot
What's wrong with the old golden ratio trick to compute the Fibonacci
sequence?.
phi = (1+sqrt(S(5)))/2
def fib(n):
return floor(phi**n / sqrt(5) + S.Half)
map(fib, range(10))
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
On Tue, Aug 2, 2011 at 3:22 PM, Hector wrote:
>
>
> On Wed, Aug 3, 2011 at 1:42
On Tue, Aug 2, 2011 at 9:00 AM, Matthew Rocklin wrote:
> Will do!
> As a disclaimer I don't actually teach Linear Algebra (though I respect
> those who do). The narratives posted are fictitious. I'm hypothesizing why
> people might want Matrix Expressions.
That's a little misleading. Maybe you s
On Wed, Aug 3, 2011 at 1:42 AM, Vladimir Perić wrote:
> On Tue, Aug 2, 2011 at 10:08 PM, Fredrik Johansson
> wrote:
> > On Tue, Aug 2, 2011 at 9:47 PM, Hector wrote:
> >> Hello folk,
> >>
> >> I was browsing through the code and found that fibonacci numbers are
> >> calculated by recursion metho
On Tue, Aug 2, 2011 at 10:08 PM, Fredrik Johansson
wrote:
> On Tue, Aug 2, 2011 at 9:47 PM, Hector wrote:
>> Hello folk,
>>
>> I was browsing through the code and found that fibonacci numbers are
>> calculated by recursion method. So the time complexity is of O(n) and I
>> don't expect space comp
On Tue, Aug 2, 2011 at 9:47 PM, Hector wrote:
> Hello folk,
>
> I was browsing through the code and found that fibonacci numbers are
> calculated by recursion method. So the time complexity is of O(n) and I
> don't expect space complexity be any optimal. It gave me the following
> results.
> Ther
Hi,
On 2 August 2011 21:47, Hector wrote:
> Hello folk,
>
> I was browsing through the code and found that fibonacci numbers are
> calculated by recursion method. So the time complexity is of O(n) and I
> don't expect space complexity be any optimal. It gave me the following
> results.
>
> I
Hello folk,
I was browsing through the code and found that fibonacci numbers are
calculated by recursion method. So the time complexity is of O(n) and I
don't expect space complexity be any optimal. It gave me the following
results.
In [1]: %timeit F_n = fibonacci(10)
10 loops, be
Will do!
As a disclaimer I don't actually teach Linear Algebra (though I respect
those who do). The narratives posted are fictitious. I'm hypothesizing why
people might want Matrix Expressions.
On Tue, Aug 2, 2011 at 9:58 AM, Alan Bromborsky wrote:
> **
> On 08/02/2011 10:10 AM, Matthew Rocklin
On 08/02/2011 10:10 AM, Matthew Rocklin wrote:
Start of a wiki-page is here if people want to go this route. I put
down the things that I think about.
https://github.com/sympy/sympy/wiki/Matrix-Expressions
I'm also happy to continue the conversation over e-mail.
What would be a good next step?
Start of a wiki-page is here if people want to go this route. I put down the
things that I think about.
https://github.com/sympy/sympy/wiki/Matrix-Expressions
I'm also happy to continue the conversation over e-mail.
What would be a good next step? How can I stimulate activity on this topic?
On S
Hi,
I thought over 600 commits might have changed things so while tackling the
problem of rebase as pointed out by smichr [0] in the pull request, I tried
to first check whether all my work is consistent or not. I overlooked
doctest at that time because I was unaware of it. I fixed it and try to t
17 matches
Mail list logo
