JeffE
Reputation
346
Top tag
Next privilege 500 Rep.
Access review queues
 Apr16 comment How Many Three-of-a-Kinds in Standard Poker? Please use LaTeX for math: $13 \cdot \binom{4}{3} \cdot 48 \cdot 49$, etc. Apr16 comment Most general way of selecting 10% of set elements I don't understand the question. What's wrong with just choosing the first $K$ elements? What does "generic" mean? Apr14 awarded Critic Apr14 comment What philosophical consequence of Goedel's incompleteness theorems? Administrator cannot consistently believe this sentence to be true. Apr14 comment What philosophical consequence of Goedel's incompleteness theorems? @EMS: Please take this to chat. Apr12 answered Connecting all points on a plane with shortest path possible Apr11 comment Notation : What is the meaning of the (mod n) in factoring algorithms? Nope. % and mod are different for negative numbers. (Alternatively: % is busted.) Apr11 comment Are these two statements equivalent? I think the correct conclusion is Never use "unless...not" in a mathematical context. Apr11 comment Improving Gift Wrapping Algorithm By "angles", you means "slopes", of course. Trigonometry is anathema to actual implementation. Apr11 comment Notation: What is the meaning of “$(a,b)$” I disagree that never using "," to mean "and" is "an annoying constraint"; I consider an ironclad rule. I would write your example as $\{(x,y)\in\mathbb{R^2} \mid x\ge 1 \text{ and } 0\le y\le x^2\}$. Yes, with "and" spelled out. Apr11 suggested rejected edit on Notation: What is the meaning of “$(a,b)$” Apr8 comment When do ï¬‚oors and ceilings matter while solving recurrences? These notes might help; see especially Section 6. Apr8 comment How can we show that $\mathbb Q$ is not free? "Free" in what sense? Mar19 comment A finite graph with exactly two vertices with odd degree must have a path joining them. That graph does not have exactly two vertices of odd degree. Mar19 comment Is this summation$O(n^2)$? So to answer the actual question: NO Mar18 comment Algorithm for Identifying Convex Kernel @StevenTaschuk: You should upgrade your comment to an answer. Mar16 comment Time complexity of algorithm computing averages Also asked and closed on MathOverflow. Mar15 comment Time complexity of algorithm computing averages "This is my last exam at the university"? Wait... this is an EXAM problem? Mar15 comment Time complexity of algorithm computing averages This question was already asked on cstheory.se; it was quickly closed for being off-topic. Mar6 comment Particular Use of Big O Notation Perhaps "for all sufficiently large $j$ and sufficiently small $\epsilon>0$".