marty cohen
Reputation
36,132
96/100 score
 7h comment How to prove complexity of algorithms No. $\log(0) = -\infty$, so if $\log(something) \to -\infty$ then $something \to 0$. 7h comment Proving that $\cos(\frac{\arctan(\frac{11}{2})}{3}) = \frac{2}{\sqrt{5}}$ Submit it anyway. If your work is independent, I see no problem. There are no patents on answers here. 7h comment solving a non-linear (trigonometric) system of equations with two equations and two variables It's a lot easier to work with if you use $a, b, c$ instead of $\alpha, \beta, \gamma$. (Interesting typo - I entered \aloha instead of \alpha.) 7h comment $2^k+3$ : Primality Brute Forcing Theory Below The Square Root It seems that you are trying to determine the primality of these numbers. It might be good to state that at the beginning. 7h answered How to prove complexity of algorithms 10h answered A good way to approximate $\cos(x)$ for larger angles 10h comment Suppose $1>a_n>0$ for $n\in \mathbb{N}$. Prove that $\prod_{n=1}^\infty (1-a_n)$ converges if and only if $\sum_{n=1}^\infty a_n<\infty$. OP meant that the product converges to zero iff the sum diverges. 10h comment Proof that for any interval (a,b) with a