1,126 reputation
816
bio website embeddedrelated.com/blogs-1/…
location Arizona
age
visits member for 4 years, 5 months
seen Dec 9 at 1:41

Oct
16
comment Finding an angle within an 80-80-20 isosceles triangle
the berkeley link is kind of confusing... but +1 for the name as a key to searching!
Oct
2
awarded  Student
Oct
1
comment good online resources for 2nd-order system dynamics
the problem is there are a lot of mediocre pages out there, and I'm looking for a good one; most of the sources of this type of information just have the transfer function with 1 in the numerator and something in the denominator. (having said that, the one you posted isn't too bad)
Oct
1
comment good online resources for 2nd-order system dynamics
done. (.......)
Oct
1
revised good online resources for 2nd-order system dynamics
added 562 characters in body
Oct
1
asked good online resources for 2nd-order system dynamics
Sep
15
answered Maclaurin Series of $1/(1-x)$ derived from maclaurin series of $(1+x)^n$
Sep
14
comment How to solve this trigonometric inequality: $k \sin\left(\frac {\pi x} {2}\right)\cos\left(\frac {\pi x} {2}\right)>0$?
@AndrejaKo: Ah, that kind of sausage. Yes, we tend to use it in the context of politics + shady manufacturers. The terminology is a bit different, though; not sure how to correct + keep the colloquialism. I would probably replace "sausage" with "expression". Less flavorful but clearer. :-)
Sep
11
comment How to solve this trigonometric inequality: $k \sin\left(\frac {\pi x} {2}\right)\cos\left(\frac {\pi x} {2}\right)>0$?
"sausage" ?!??!
Sep
8
comment We can divide $7^{17} - 7^{15}$ by?
@lam3r4370: JM is just factoring.
Sep
8
comment $5^n+n$ is never prime?
oh. hmm. well why only test 3? I guess I'm confused why you cited 3-probable + didn't use Miller-Rabin
Sep
8
comment $5^n+n$ is never prime?
dumb question: what's a 3-probable prime? (I know what a probable prime is)
Sep
4
comment If $(a^{n}+n ) \mid (b^{n}+n)$ for all $n$, then $ a=b$
"5^n+n is never prime" ?????
Aug
14
comment Rationality of series $\sum \frac{1}{n!}$
The "main idea" you state does not seem to hold: consider the infinite sequence 1/2, 1/2 + 1/4, 1/2 + 1/4 + 1/8, 1/2 + 1/4 + 1/8 + 1/16, ... which converges to 1.
Aug
6
comment How to accurately calculate the error function erf(x) with a computer?
+1 for the Winitzki reference; I've seen that 2nd paper before + it's a nice one.
Aug
6
comment '(Pseudo)-random functions' by seeding of PRNGs?
...and do you want it to be a large constant time or a small constant time? (how fast does each # have to be, compared to, say, MD5 calculation?)
Aug
6
comment '(Pseudo)-random functions' by seeding of PRNGs?
? why linear in x+y? Read again. Timeshifts can be precomputed as exponentiation in Galois fields.
Aug
6
comment How do I figure out what kind of distribution this is?
+1, but it could be more than 2, since there are often intermediate routers between computers. (hence the beauty of the network)
Aug
6
comment How do I figure out what kind of distribution this is?
b/c there's a difference between a discrete-valued process, and a continuous-valued process whose output is quantized. in any case at least it's an approximation to reality.
Aug
5
answered How do I figure out what kind of distribution this is?