half-integer fan
Reputation
775
Top tag
Next privilege 1,000 Rep.
Create new tags
 Nov 28 comment Can we determine which statements are incomplete due to Godel? So I understand your answer as: Yes, it is possible that any of these conjectures are true but unprovable, and No, we cannot know which questions are the unprovable ones. Nov 28 revised Trigonometry triangles expanded answer Nov 28 answered Trigonometry triangles Nov 28 comment Lower bound for logarithm? Since we were discussing bounds A "close to" 0, I assumed we were only interested in a bounding function for $x << 1$. Nov 28 answered Continued fraction explanation Nov 28 answered Lower bound for logarithm? Nov 26 asked Can we determine which statements are incomplete due to Godel? Nov 26 answered When proving a statement by induction, how do we know which case is the valid 'base'? Nov 26 comment Prove that every practical number is either a power of two or a power of two times a non-trivial polygonal number @PeterTaylor I will do it if you wish. I want more experience updating OEIS. Let me know. p.s. love the domain name, and those laser swords. Nov 24 awarded Quorum Nov 24 answered Probability - rolling two dices and flipping one coin two times Nov 24 comment Positively non-positive (from Brilliant.org) Whats wrong with my method? @YanYau, note that although a single case is not sufficient to prove that an N works, a single counter-example is sufficient to prove that a given N doesn't work, since you were asked to prove a condition always holds. Nov 24 comment Derivative word problem - $s''(t) = a$, i.e the acceleration is constant and $(1) [s'(t)]^2 = 2as(t)$ Note that the prior question asks you to show why the solution is not in that form, so you shouldn't be surprised that there is no 'c' in the new form you are given. Nov 24 comment Proving for every odd number $x$, $x^2$ is always congruent to $1$ or $9$ modulo $24$ I think you should make it its own answer, as this seems to be the real issue with the OP's understanding, not squaring and reducing numbers. Nov 24 revised Proving for every odd number $x$, $x^2$ is always congruent to $1$ or $9$ modulo $24$ typos Nov 24 comment Number of ways to arrange $5$ a and $5$ b letter As Andre says, how many places can the first 'a' go? The second? ... The fifth? But the 'a's are indistinguishable, so for each pattern we've produced, how many times did we create it by placing the 'a's in a different order? The end result will be what Adi wrote. Nov 24 answered Differential Equations and Newtons method Nov 24 answered Derivative word problem - $s''(t) = a$, i.e the acceleration is constant and $(1) [s'(t)]^2 = 2as(t)$ Nov 24 comment Is $x^2$ always congruent to $(y-x)^2$ modulo $y$? How could you prove the cases where its true? that should be $-2xy$ in the expansion, luckily it doesn't change the conclusion. Nov 24 answered Proving for every odd number $x$, $x^2$ is always congruent to $1$ or $9$ modulo $24$