ashley
Reputation
670
Next privilege 1,000 Rep.
Create new tags
 Dec 24 comment Functional Prime Sums you think you can spare "at least" in your first line ? what does that mean? Dec 23 comment Number of acyclic digraphs on $[n]$ with $k$ edges and each indegree, outdegree $\leq 1$ Where did you get this formula ? It looks too big. Dec 22 comment Integers that satisfy $a^3= b^2 + 4$ @MWarsi: you must be meaning you never added that line in your original Q. this is my last comment to you on this Q and very probably anywhere else. Dec 22 comment Integers that satisfy $a^3= b^2 + 4$ Karolis Juodelė no problem. i probably would have thought the same. thanks for your comment. Dec 22 comment Integers that satisfy $a^3= b^2 + 4$ @DonAntonio i see your point on the offensive language and do agree to it. i also think that it is an unpleasantness to the user of the language before it is to many others. however, i despise more seeing such petty "efforts" finding grounds on the site-- and this time at the cost of showing me as the one in the wrong. plagiarism is plagiarism. it never is pleasant to deal with but it never should leak in. thank you for your comment. Dec 22 comment Integers that satisfy $a^3= b^2 + 4$ Oh, i very well did. but you seem to have missed the first version of his Q. he added the line starting "Ah well.. " after my answer appeared here-- see my comment up there. he is getting a flag. he is a cheat. Dec 22 comment Integers that satisfy $a^3= b^2 + 4$ Well, then you should also remove the part asking for the proof of their non-existence-if-they-don't in your edit. Tricky among other things. Dec 22 comment Number of Vertices of Graphs you must be referring to "...by the number of vertices" which is that the number of vertices determines $|E|$. thats nothing but trivial. Dec 22 answered Integers that satisfy $a^3= b^2 + 4$ Dec 22 comment Number of Vertices of Graphs Graphs are discrete structures. i don't see any "uncountable" nodes in a graph. the number of edges is bounded by the number of vertices unless you are dealing with hypergraphs. A graph is a modeling structure-- and a very powerful one. Whichever applies to your problem. Dec 20 comment Proof for $\frac{x^n}{x^n}=x^{n-n}$ Well, write $n$ of them at both numerator and the denominator and simplify. Dec 19 revised What is three different way to solve this probability / combinatorics problem of dice Rephrased the 1st statement for clarity. Dec 19 comment Triangle problem related to finding an area too general-- the solution goes by finding the intersections for the proportion of the triangle it is cutting at each step and is too specific. easier to work the numbers along the way, not worth a general formula. Dec 19 answered What is three different way to solve this probability / combinatorics problem of dice Dec 18 answered How to find the limit of two divided functions Dec 18 comment Probability that an undirected graph has cycles @Micah If you read more closely, the answer covers if.. . yours on the other hand seems to be a quick conclusion. Dec 18 revised Probability that an undirected graph has cycles added 73 characters in body Dec 18 answered Probability that an undirected graph has cycles Dec 18 answered What's the rule for solving nested sums? Dec 18 answered How to prove this sign of the derivative?