On Jan 21, 2008 8:32 PM, Hector <[EMAIL PROTECTED]> wrote:
>
> Sorry for replying my own email, but I just started tinkering with
> Python's wave module:
> http://docs.python.org/lib/module-wave.html
>
> I'll try to report my progress.
> Best,
Sage also has some wav processing support that is bui
Sorry for replying my own email, but I just started tinkering with
Python's wave module:
http://docs.python.org/lib/module-wave.html
I'll try to report my progress.
Best,
--
Hector
On Jan 21, 8:43 pm, "Hector Villafuerte" <[EMAIL PROTECTED]> wrote:
> Hi,
> I'm planning on using SAGE for some di
Hi,
I'm planning on using SAGE for some digital signal processing
experimentation, and I wonder if there's a way to handle audio on it.
For example; opening a wav, doing some filtering or DSP magic and
playing the result back (maybe using an applet like Wikipedia does).
Any ideas? Thanks in advanc
On Jan 18, 6:42 pm, mark h <[EMAIL PROTECTED]> wrote:
> i want to write some actuarial specifications in Sage. i want to
> create test cases in external files, so that they can also be used for
> the implementation testing.
>
> can i read/write data from external files ?
> can Sage process text
Oh yeah, that's a usefull hint,
thank you very much Paul,
Georg
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://gro
Georg,
> is there an efficient way in sage to find the smallest integer k for
> which the inequality
>
> b^(k+1) / (factorial(k) * factorial(k+1)) <= 1
>
> is true (b > 0)
Stirling's expansion gives (when b goes to infinity) k ~ sqrt(b)*exp(1).
Thus it suffices to evaluates f(k) = b^(k+
On Jan 21, 2008 5:35 AM, Oscar Ledesma Hernandez > wrote:
> Dear William Stein,
>
> I'm Oscar Ledesma, and I'm doing my PhD in Essen with Gerhard Frey.
> I have a program to calculate n-Heegner point but in Magma,
What is an n Heegner point?
> I want to
> chage to SAGE ('couse I find it great),
Excuse me, i'm not a native english speaker (and i thought i read this
mode of speaking somewhere before):
is there an efficient way in sage to find the smallest integer k for
which the inequality
b^(k+1) / (factorial(k) * factorial(k+1)) <= 1
is true (b > 0)
similarly for
b^k / factorial(k)
On Jan 21, 2008 6:39 AM, Georg <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> is there an efficient way in sage to find the smallest integer k to
> meet (b constant)
>
> b^(k+1) / (factorial(k) * factorial(k+1)) <= 1
This sentence doesn't make sense to me. What does it mean for an
integer to meet an ine
This question was just asked by someone else on sage-newbie.
In gsl/dft.py there is a plot_histrogram function. Other people
suggested other options in the htread though.
On Jan 21, 2008 10:43 AM, David Kohel <[EMAIL PROTECTED]> wrote:
>
> Apologies if this is double-sent; I thought I sent it al
Apologies if this is double-sent; I thought I sent it already but
don't find the submission.
Suppose I have a discrete function, as at the bottom (in this case a
frequency distribution).
Does anyone have a good example for producing a bar graph? Ideally I
would like both latex
and some graphical
Hi,
is there an efficient way in sage to find the smallest integer k to
meet (b constant)
b^(k+1) / (factorial(k) * factorial(k+1)) <= 1
and
b^k / factorial(k) <=1
or, more generally (b, c, d positive constants, c > d)
b^k / (factorial(k) * (k + c - d)^d) <= 1
many thanks in advance, Georg
12 matches
Mail list logo
