Benjamin Kovach
Reputation
Next privilege 250 Rep.
 May 5 awarded Popular Question Sep 24 awarded Autobiographer Jul 2 awarded Curious Jan 15 comment Graph Isomorphism property @JairTaylor I understand what a graph isomorphism is. I mistakenly thought that $v(G)$ and $e(G)$ stood for the actual sets of vertices in edges in $G$, which caused some confusion. Jan 10 accepted Graph Isomorphism property Jan 10 comment Graph Isomorphism property @dani_s ...of course. I should have read more carefully. Thanks for the response. Jan 10 asked Graph Isomorphism property Sep 18 accepted Getting started on a proof of convergence from definition. Sep 18 comment Getting started on a proof of convergence from definition. Yes, I can see it now! Thank you! Sep 18 asked Getting started on a proof of convergence from definition. Aug 20 awarded Commentator Aug 20 comment Using original definition of n choose k, prove an equivalency Thank you! I didn't want a complete answer but I was able to read the first paragraph and then work out the rest and check my answer against yours, so this was very helpful. Aug 20 accepted Using original definition of n choose k, prove an equivalency Aug 20 asked Using original definition of n choose k, prove an equivalency May 3 accepted How to prove this set is denumerable? May 3 comment How to prove this set is denumerable? We're not including $0$ in $\mathbb{N}$ in this class, so actually the function $f(x) = x^2 + 1$ works fine in my case. I was thinking of a way to build $\mathbb{N} - \left\{n^2 \: | \: n \in \mathbb{N} \right\}$ instead of a subset of it, which was the problem. Seeing subsets makes a lot more sense. Thanks for the reply. May 3 comment How to prove this set is denumerable? @ChrisDugale So the difference between squares is at least 3, and since there are infinitely many squares, there are at least 3 times as many non-squares? And since the set of squares is infinite, then surely a set at least three times that size is infinite? Something like that? May 3 asked How to prove this set is denumerable? Jan 21 accepted How to find the order of a recurrence relation Jan 21 comment How to find the order of a recurrence relation @MarkoRiedel That's actually exactly what I needed -- the Master Theorem. I was able to get the information I needed with a simple Google search for it. Thanks!