Reputation
39,540
Next tag badge:
197/100 score
19/20 answers
Badges
8 108 201
Impact
~965k people reached

2h
comment DSolve misses a solution of a differential equation
Well, I read it and liked it; hence the joke. :) Mentioning Arnol'd was a nice touch.
2h
comment DSolve misses a solution of a differential equation
Are you sure you didn't mean to publish this as an expository journal article instead of as a mere SE answer? :)
2h
comment How to achieve a decent terminator line?
@Michael, if you've seen the "day and night map" question here, that's exactly where a terminator comes in. Another instance would be the various phases of the moon.
3h
revised How to avoid these garbage and missing mesh lines?
edited tags
3h
comment Implementing Picard's Iteration for solving ODEs
Okay, this code got me excited. I will have to try this the next time I see a computer…
3h
revised How may I remedy this erroneous lighting pattern?
edited tags
3h
revised How to achieve a decent terminator line?
edited tags
3h
comment Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
@Runny, I knew I'd be asking to squeeze water from stones at some point; thanks for trying!
9h
awarded  Nice Question
10h
comment Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
That's okay… you've been more than helpful. :)
10h
comment Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
In that case… what if you replace Mod[n, 2] with BitAnd[n, 1]?
10h
comment Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
Now that was a surprise… thanks!
10h
comment Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
Replacing Quotient[n, 2] with BitShiftRight[n] does not make much of a difference, right?
11h
comment How to plot a function defined by an expression containing integrals
As noted, it's hard to say anything useful if we don't see the function concerned; different integrands call for different strategies. At the lowest level, you should follow @Michael's prescription, but otherwise there is nothing to say until you edit.
11h
asked Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
12h
comment List connectivity of points in discretized mesh
First[foo] should yield the points; Cases[foo, Polygon[p_] :> p, Infinity][[1]] should give the polygon indices.
12h
comment List connectivity of points in discretized mesh
The stuff within Polygon[] looks to be useful; you'll note that it has a list of triples, corresponding to the triangle whose vertices are indexed by the integers in the triple. You should now have something to start with.
13h
comment List connectivity of points in discretized mesh
What does InputForm[foo] give you?
13h
revised Multivariate Equation solving
edited tags
14h
comment Faster binary Hamming weight for big integers?
Unfortunately, I don't have a computer right now. But Jacob and me discussed this in chat; anyway, if you want to run your own tests, here are the relevant identities: ThueMorse[n] == Mod[hammingWeight[n], 2] and RudinShapiro[n] == 1 - 2 ThueMorse[BitAnd[n, Quotient[n, 2]]].