Reputation
50,451
Next tag badge:
125/100 score
17/20 answers
Badges
8 149 255
Newest
 Necromancer
Impact
~1.2m people reached

Dec
16
comment How can I make a density plot (or contour plot) with an arbitrary nonlinear scale (e.g. arcsinh, log, biexponential)?
Certainly, you can use it as you see fit; as I said on my profile, my licensing is very permissive. ;)
Dec
16
answered How can I make a density plot (or contour plot) with an arbitrary nonlinear scale (e.g. arcsinh, log, biexponential)?
Dec
16
revised Interpolating function as a model in Mathematica's procedures for fitting
edited tags
Dec
16
comment How to replace a space by a comma
ImportString[StringReplace["{1 2 3 4 5 6 7 8}", "{" | "}" -> ""], "List", "LineSeparators" -> " "]
Dec
16
revised How to guess initial complex value for FindRoot
added 599 characters in body
Dec
16
revised What are the algorithm details of FindRoot?
deleted 11 characters in body
Dec
16
comment Repeating the first row of a matrix; subsequent rows depend on the first row
Another possibility: ArrayPad[List /@ sums, {{0, 0}, {0, 9}}, "Fixed"].
Dec
16
comment What is the underlying algorithm to simplify sums of reciprocals of polynomials?
Presumably it's using a method specialized for rational functions; neither "HypergeometricTermGosper" nor "HypergeometricTermZeilberger" work. But, "HypergeometricTermPFQ" works. Hmm...
Dec
16
comment Faster square test for integers
You don't need to load that context yourself; try executing NumberTheory`IntegerSqrt[10] in a fresh kernel if you don't believe me.
Dec
16
comment What is the underlying algorithm to simplify sums of reciprocals of polynomials?
The documentation of Sum[] notes a number of supported Methods, including "RationalFunction", which seems to be the one being used in this case.
Dec
16
revised What is the underlying algorithm to simplify sums of reciprocals of polynomials?
edited tags
Dec
16
answered How to plot a distribution of planes
Dec
16
revised Interpreting the result of ContourPlot3D
edited tags
Dec
16
comment Faster square test for integers
There's always the possibility of using a bounty to ask for a needed update. Nevertheless, did you already test the ones using the Jacobi symbol? Otherwise, try this: NumberTheory`IntegerSqrt[n]^2 == n
Dec
16
comment How do I calculate this integral along a complex line (not a contour) in mathematica?
Why not use NSum[] instead?
Dec
16
comment How to make this code involving Hypergeometric functions to run faster?
K is a built-in symbol; I do not recommend you using it here as a parameter.
Dec
16
revised Repeating the first row of a matrix; subsequent rows depend on the first row
edited tags
Dec
16
comment Faster square test for integers
I'd say the test based on the Jacobi symbol is still the best one of the lot, but of course it can't be embedded in Compile[].
Dec
16
revised Faster square test for integers
edited tags; edited tags
Dec
15
awarded  Necromancer