On Thursday, April 3, 2014 11:09:12 AM UTC-7, Luigi Malagò wrote:
>
> PS: also a pointer to other software packages besides maxima that would
> help me would be appreciated
>
Free beer solution: www.wolframalpha.com does it (i.e., mathematica
simplifies the sums away)
maple does too.
--
You rec
On 04/03/2014 09:46 PM, Paul Mercat wrote:
Hi,
Thank you for your answers.
Yes, your right, my program can't terminate. Maybe my example was not
good.
Here is another example where it still crash in my computer :
sys.setrecursionlimit(10)
def rec(niter):
if niter == 0:
return
Hi,
Thank you for your answers.
Yes, your right, my program can't terminate. Maybe my example was not good.
Here is another example where it still crash in my computer :
sys.setrecursionlimit(10)
def rec(niter):
if niter == 0:
return
rec(niter-1)
rec(5)
print "hello !" #wi
Actually you should only need the RH to prove that this method is reasonably
fast. I don't think sage has Li^{-1} implemented, which is really what you need
in order to implement this (Li ~ pi, so Li^{-1} ~ pi^{-1} = nth_prime function).
There has been some effort to include the open source libr
On Thu, Apr 3, 2014 at 11:52 AM, R. Andrew Ohana wrote:
> Actually you only need the RH to prove that this method is reasonably fast.
> I don't think sage has Li^{-1} implemented, which is really what you need in
> order to implement this ( Li ~ pi, so Li^{-1} ~ pi^{-1} = nth_prime
> function).
Y
On Thu, 3 Apr 2014, Szabolcs Horvát wrote:
Does Sage contain functionality to find the Nth prime quickly?
Could Sage have precalculated primes for, say, every 10th prime up to
some limit?
Same may apply to other kinds of number series. To get the value of #5678
in magic number serie X
On Thu, Apr 3, 2014 at 11:26 AM, kcrisman wrote:
>>
>> Many people post Sage-related questions on math.stackexchange.com.
>> This search shows 488 results.
>>
>> http://math.stackexchange.com/search?q=sage
>>
>
> Whoah. Some questions people might want to try answering which currently
> have
>
>
> Many people post Sage-related questions on math.stackexchange.com.
> This search shows 488 results.
>
> http://math.stackexchange.com/search?q=sage
>
>
Whoah. Some questions people might want to try answering which currently
have no answers:
http://math.stackexchange.com/questions
On Wed, Apr 2, 2014 at 1:20 PM, Szabolcs Horvát wrote:
> Hello,
>
> I'm quite new to Sage. Does it have any functionality that will easily
> compute the Nth prime and it's fast enough that it will work for N of the
> order 10^9 or 10^10 reasonable quickly (say, under 10 seconds)?
>
> pari.nth_p
thanks for your reply nils,
any other suggestion about what i could do to "help" maxima in simplifying
my expression?
in the end it does not complicated to me, it's just a problem of factoring
out thing.. ;-P
PS: also a pointer to other software packages besides maxima that would
help me would be
On Thursday, April 3, 2014 10:23:54 AM UTC-7, Luigi Malagò wrote:
>
> PS: maxima.load('simplify_sum') didnt work
>
In order for it to affect the "sum" command, you'd need to do
maxima_calculus.load('simplify_sum') and then some work is required to
actually call the routine on your expression. H
On Wed, Apr 2, 2014 at 1:47 PM, Szabolcs Horvát wrote:
> Hello,
>
> Why doesn't Sage have a reliable and easy to use StackExchange site instead
> of ask.sagemath.org?
>
> This is a very bad first experience for novice users and these types of
> problems could easily be avoided by using StackExch
On Wednesday, April 2, 2014 1:41:06 PM UTC-7, Szabolcs Horvát wrote:
>
> Hello,
>
> I'm new to Sage and I am still struggling with finding what I need in the
> documentation. I'm writing because maybe I'm not approaching this the
> right way, and I'm looking for advice. I am using the noteboo
PS: maxima.load('simplify_sum') didnt work
luigi
Il giorno giovedì 3 aprile 2014 17:36:14 UTC+2, Luigi Malagò ha scritto:
> Hello sage community,
> i'm new to sage, i would like to use it to double check some computations i
> have done, however i have some problems with simplifying expressions
Hello sage community,
i'm new to sage, i would like to use it to double check some computations i
have done, however i have some problems with simplifying expressions involving
sums.
Let
>> alpha,t,i,j,k = var( 'alpha','t','i','j','k')
>> def p1(alpha, t):
>> return alpha * sum(exp(-alpha
Hello,
Why doesn't Sage have a reliable and easy to use StackExchange site instead of
ask.sagemath.org?
Being new to Sage, I looked at ask.sagemath.org twice. The first time I did it
did not work at all (the note said it was because of a troll, if I recall it
right?). Today I registered there
Hello,
I'm quite new to Sage. Does it have any functionality that will easily compute
the Nth prime and it's fast enough that it will work for N of the order 10^9 or
10^10 reasonable quickly (say, under 10 seconds)?
pari.nth_prime(10) takes a very long time.
Are there alternatives?
S
Hello,
I'm new to Sage and I am still struggling with finding what I need in the
documentation. I'm writing because maybe I'm not approaching this the right
way, and I'm looking for advice. I am using the notebook interface.
I can evaluate "something?" in the notebook to get some help, but
I recently was fooling around with the eigenvectors of a matrix. Here is the
input:
var('p,q');
A =
Matrix([[-2*cos(q),sin(q)*cos(p)-i*sin(q)*sin(p),0,0,0],[sin(q)*cos(p)+i*sin(q)*sin(p),-cos(q),sqrt(6)/2*(sin(q)*cos(p)-i*sin(q)*sin(p)),0,0],[0,sqrt(6)/2*(sin(q)*cos(p)+i*sin(q)*sin(p)),0,sqrt(6)
Hello,
I asked three question yesterday, but none of them showed up, I'm not sure
why. ask.sagemath.com also doesn't allow posts from new users. Here's a
brief version of one of the questions again:
Does Sage contain functionality to find the Nth prime quickly? So far I
found Primes().unran
Hi Paul,
On 2014-04-02, Paul Mercat wrote:
> sys.setrecursionlimit(10)
> def rec(niter):
> rec(niter-1)
> rec(niter-1)
> rec(100)
>
> I would be very pleased if somebody knows how to fix this bug.
See http://en.wikipedia.org/wiki/Recursion_%28computer_science%29
You can not expect a
21 matches
Mail list logo
