Unapiedra
Reputation
Next privilege 125 Rep.
Vote down
Badges
10
Newest
Impact
~5k people reached

• 0 posts edited
• 0 helpful flags
• 26 votes cast

# 61 Actions

 Apr 20 accepted When are two 3D Lines parallel in Plücker matrix form? Sep 9 revised When are two 3D Lines parallel in Plücker matrix form? found a mistake. Sep 7 asked When are two 3D Lines parallel in Plücker matrix form? Jul 2 awarded Curious Oct 23 awarded Teacher Oct 23 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.) Oct 23 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}$. Oct 23 comment Probabilistic Robotics Exercise No, that is correct. $p(z)$ is a constant in respect to $x$. Oct 22 answered Probabilistic Robotics Exercise Oct 20 revised $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? added 121 characters in body Oct 20 revised GCD of Fibonacci-like recurrence relation link to new question Oct 20 revised $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? fixed error pointed out by Hagen Oct 20 awarded Benefactor Oct 20 asked $\gcd(c^a + 1, c^b + 1)$ for even $a$ and $b$? Oct 19 revised GCD of Fibonacci-like recurrence relation comment about new findings Oct 19 accepted GCD of Fibonacci-like recurrence relation Oct 19 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! Oct 18 comment GCD of Fibonacci-like recurrence relation How would I prove it for a minus sign? (A link or hint would be enough) Oct 18 comment GCD of Fibonacci-like recurrence relation Any hints, or references to calculating $gcd(c^n+1, c^m+1)$? Maybe a sieve? Oct 17 awarded Promoter