john mangual
Reputation
7,511
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
8 24
Newest
Impact
~62k people reached

• 0 helpful flags
• 292 votes cast

# 917 Actions

 Mar8 comment continued fraction of $3 + 17\sqrt{3}$ how did you know the algorithm terminated? Mar7 comment continued fraction of $3 + 17\sqrt{3}$ @Amzoti I took code for the GCD funciton from StackOverflow and modified it to handle algebraic numbers in $\mathbb{Z}[\sqrt{d}]$. stackoverflow.com/questions/11175131/… Mar7 asked continued fraction of $3 + 17\sqrt{3}$ Mar5 revised Huzita Axiom 6 - Computing the Origami Trisection of an Angle added 342 characters in body; edited tags; edited title Mar5 asked Huzita Axiom 6 - Computing the Origami Trisection of an Angle Feb28 comment Fast search of local positive quadruples on the sphere cs.stackexchange.com since you are asking about runtime Feb28 revised Efficiently producing certain kinds of examples of the application of Euclid's algorithm added 532 characters in body Feb28 revised Efficiently producing certain kinds of examples of the application of Euclid's algorithm added 148 characters in body Feb28 comment Efficiently producing certain kinds of examples of the application of Euclid's algorithm @MichaelHardy I am working on it :-) Notice gcd = 1 with probability $\frac{6}{\pi^2} \approx \frac{2}{3}$ for two random numbers! Unfortunately, these may have large factors, so they don't follow your smoothness condition. Feb28 revised Efficiently producing certain kinds of examples of the application of Euclid's algorithm added 403 characters in body Feb28 answered Efficiently producing certain kinds of examples of the application of Euclid's algorithm Feb27 revised Identity with nested sum taken over divisors of $\gcd$'s added 1379 characters in body Feb27 revised Identity with nested sum taken over divisors of $\gcd$'s added 1379 characters in body Feb27 comment Identity with nested sum taken over divisors of $\gcd$'s @MarkusScheuer you are right. this is a placeholder for a more complete solution. I think Sary has the right approach but s/he struggles with the Dirichlet series a bit. Symmetry will lead to the right answer. Feb26 answered Identity with nested sum taken over divisors of $\gcd$'s Feb23 answered Show that $\sum_{n=1}^\infty nx^{n-1}$ converges uniformly on $[0,\frac{9}{10}]$ Feb23 comment duality theory question In your first equation, $x^T x = ||x||^2$ the norm of the vector. So you ask for the point of minimum norm across a certain affine subspace. Then you can generalize the point-to-line distance formula. Feb23 answered Proving $\frac{n^n}{e^{n-1}} 2$. Feb21 comment Why is the Derangement Probability so Close to $\frac{1}{e}$? doesn't it seem odd the error is less than $\frac{1}{(n+1)!}$ but $S_n$ has only $n!$ elements? Feb21 answered Why is the Derangement Probability so Close to $\frac{1}{e}$?