Ask Your Question

rws's profile - activity

2023-06-18 21:57:39 +0200 received badge  Popular Question (source)
2021-10-29 11:53:41 +0200 received badge  Popular Question (source)
2021-09-01 19:27:07 +0200 received badge  Nice Answer (source)
2021-05-15 16:16:29 +0200 received badge  Nice Answer (source)
2021-05-04 14:29:42 +0200 received badge  Popular Question (source)
2021-03-25 01:22:58 +0200 received badge  Nice Answer (source)
2021-02-06 23:55:50 +0200 received badge  Famous Question (source)
2021-02-03 15:30:54 +0200 received badge  Good Answer (source)
2021-02-03 15:20:16 +0200 received badge  Nice Answer (source)
2021-01-27 17:55:48 +0200 received badge  Necromancer (source)
2021-01-03 21:22:37 +0200 received badge  Notable Question (source)
2020-04-16 16:57:31 +0200 received badge  Nice Answer (source)
2019-12-11 21:36:16 +0200 received badge  Famous Question (source)
2019-05-09 10:08:21 +0200 received badge  Nice Question (source)
2018-12-24 15:32:46 +0200 received badge  Notable Question (source)
2018-12-03 17:47:34 +0200 received badge  Good Answer (source)
2018-03-26 10:23:31 +0200 received badge  Notable Question (source)
2017-10-19 19:26:12 +0200 received badge  Popular Question (source)
2017-08-24 17:56:46 +0200 received badge  Nice Answer (source)
2017-08-24 08:34:04 +0200 answered a question collect variables buried in an expression

It sometimes helps to expand and factor:

sage: s
1/4*(2*D*Nb*Pmean - (D*H*alpha + D*H)*c)/((alpha + 1)*c)
sage: s.expand()
-1/4*D*H*alpha/(alpha + 1) - 1/4*D*H/(alpha + 1) + 1/2*D*Nb*Pmean/((alpha + 1)*c)
sage: _.factor()
-1/4*(H*alpha*c - 2*Nb*Pmean + H*c)*D/((alpha + 1)*c)
sage: _.partial_fraction()
1/4*(2*Nb*Pmean - (H*alpha + H)*c)*D/((alpha + 1)*c)
2017-08-24 08:21:27 +0200 commented answer Sage not returning roots of polynomimal

sage: print([SQ[i*2][0].minpoly().degree() for i in range(16)]) [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32]

2017-08-23 15:50:31 +0200 received badge  Popular Question (source)
2017-06-11 10:04:59 +0200 received badge  Popular Question (source)
2017-04-30 00:52:00 +0200 received badge  Nice Answer (source)
2017-02-11 13:52:42 +0200 received badge  Nice Answer (source)
2016-11-08 17:43:16 +0200 commented question What is the problem with that integral ?

Simplification: sin(atan(y)) = y/sqrt(1+y^2) could be applied.

2016-11-04 23:32:57 +0200 received badge  Nice Answer (source)
2016-11-04 15:43:20 +0200 answered a question Use cumulative distribution functions

Using the actual function I get a fine plot via:

sage: CDFlogn(x,nu,sigma) = 1/2*(1+erf((log(x)-nu)/(sigma*sqrt(2))))
sage: plot(CDFlogn(x,1.5,.6),0,10)
Launched png viewer for Graphics object consisting of 1 graphics primitive

sage: CDFlogn(x,1.5,.6)
1/2*erf(-0.833333333333333*sqrt(2)*(-log(x) + 1.50000000000000)) + 1/2
sage: CDFlogn(4,1.5,.6)
1/2*erf(-0.833333333333333*sqrt(2)*(-log(4) + 1.50000000000000)) + 1/2
sage: CDFlogn(4,1.5,.6).n()
0.424846794957399

For example: https://en.wikipedia.org/wiki/Log-nor...

2016-11-04 15:23:56 +0200 commented answer Use cumulative distribution functions

Then at the moment you need to create your function in mathematical terms. Please see and rate my answer.

2016-04-03 07:19:24 +0200 commented question Memory saturation when I test equalities in symbolic ring.

Or before. I also cannot confirm with 7.2.beta2

2016-03-08 21:04:58 +0200 received badge  Nice Answer (source)
2016-01-27 15:13:42 +0200 received badge  Necromancer (source)
2015-10-24 16:24:08 +0200 commented answer qepcad failing to replicate examples

qepcad did install here on 6.10.p1 after I set my MAKE to make -j1.

2015-10-19 08:38:53 +0200 answered a question does SAGE compute Pi using Chudnovsky algorithm?

Sage uses the mpfr library to compute pi to arbitrary precision. The mpfr algorithm apparently has a limit of 646456992 digits. Please refer to

https://github.com/epowers/mpfr/blob/...

Not sure if that is up-to-date, however.

2015-10-15 08:35:31 +0200 answered a question sage doesn't evaluate

Use simplify_full:

sage: f(x) = sum(k,k,0,x)
sage: f
x |--> 1/2*x^2 + 1/2*x
sage: f(x) = sum(binomial(10,k),k, 0,x)
sage: f
x |--> sum(binomial(10, k), k, 0, x)
sage: f(2)
sum(binomial(10, k), k, 0, 2)
sage: f(2).simplify_full()
56
2015-10-14 15:52:53 +0200 commented answer Plot doesn't seem to evaluate my function

That's a bug that already has a fix which just needs to be reviewed: http://trac.sagemath.org/ticket/9424

2015-10-04 15:00:02 +0200 answered a question simplify_rational gives different results

Your proj is ab.dot_product(n)/n.norm()^2*n so your tt*n.norm() is ab.dot_product(n)/n.norm()^2 * n.norm() which is different from proj.norm() because the norm() in tt*n.norm() only applies to n. You made the same mistake when you equaled (tt*n.norm()).simplify_rational() and tt*n.norm().simplify_rational(). Here in the latter the simplify_rational() only applies to n.norm().

Operator precedence in Sage closely follows the same in Python (but in C++ for example the dot would have behaved the same way).

2015-10-04 10:26:53 +0200 commented question Multivariate Laurent series

This is right.Multivariate Laurent series are not implemented in Sage at the moment.

2015-09-27 16:39:58 +0200 commented answer simplify sqrt(x/y^2)*y

A fix should be possible with pynac-0.4.x (pynac is part of Sage); pynac git master already does sqrt(x^2) --> x for x>0 as side effect of other changes.

2015-09-26 08:48:38 +0200 received badge  Nice Answer (source)
2015-09-25 09:16:08 +0200 commented answer Understanding the 'solve()' result with braces and brackets ("([{x:z},{x:y}],[1,1])")

The y:z can be deduced from the other two, but I have no idea how the results come up specifically.