Unapiedra
Reputation
Next privilege 125 Rep.
Vote down
 Sep9 revised When are two 3D Lines parallel in Plücker matrix form? found a mistake. Sep7 asked When are two 3D Lines parallel in Plücker matrix form? Jul2 awarded Curious Oct23 awarded Teacher Oct23 comment Probabilistic Robotics Exercise Exactly! (Although, you would also need to prove that $\nu$ is the right constant as you would get if it were a Gaussian with your mean and variance as you wrote it.) Oct23 comment Probabilistic Robotics Exercise Take all the $e^{...} e^{...}$ and look only at the exponent, to get something like $-\dfrac{1}{2}((x-1000)^2 + (x -z)^2)$. Multiply this out, and then bring it in the form of $(x-\mu_{new})^2 / \sigma_{new}$. Oct23 comment Probabilistic Robotics Exercise No, that is correct. $p(z)$ is a constant in respect to $x$. Oct22 answered Probabilistic Robotics Exercise Oct20 revised $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? added 121 characters in body Oct20 revised GCD of Fibonacci-like recurrence relation link to new question Oct20 revised $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? fixed error pointed out by Hagen Oct20 awarded Benefactor Oct20 asked $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? Oct19 revised GCD of Fibonacci-like recurrence relation comment about new findings Oct19 accepted GCD of Fibonacci-like recurrence relation Oct19 comment GCD of Fibonacci-like recurrence relation No, I concentrated on the odd numbers using a sieve. Didn't get anywhere substantial (too tired). Also, I didn't know the prerequisites for 245, so didn't quite understand it. Anyway, for me a solution is more important than a proof. Thanks for all this! Oct18 comment GCD of Fibonacci-like recurrence relation How would I prove it for a minus sign? (A link or hint would be enough) Oct18 comment GCD of Fibonacci-like recurrence relation Any hints, or references to calculating $gcd(c^n+1, c^m+1)$? Maybe a sieve? Oct17 awarded Promoter Oct16 answered Fourier Series: Shifting in time domain