5,660 reputation
1825
bio website None
location Boston, MA
age 64
visits member for 2 years, 7 months
seen 17 hours ago

...


1d
comment How do I prove that $\sum_{k=1}^{b-1} [k \frac{a}{b}] = \frac{(a-1)(b-1)}{2}$?
You are correct; my counterexample was the result of miscalculation on my part. I love Eisenstein's proof, by the way; I used it in a class a few years back.
1d
reviewed Approve suggested edit on Do the given vectors span $\mathbb{R}^3$?
1d
reviewed No Action Needed Real Analysis alpha Holder condition
1d
reviewed No Action Needed Does $1.0000000000\cdots 1$ with an infinite number of $0$ in it exist?
1d
reviewed Close Rectangular Seating Combinations
1d
reviewed Close Statistics, Chapter random variables and discrete probability distributions
1d
reviewed Close Prove the implication $[\exists\,x\;(\,p(x) \land q(x))] \implies[(\exists\,x\;p(x)) \land (\exists\,x\;q(x))]$ is a tautology.
1d
reviewed Close Form a basis for R^3?
1d
reviewed Close probability tennis games, player winning all games
1d
reviewed Close equivalence classes partition
1d
reviewed Close Poisson distribution question regarding colds
1d
reviewed Leave Open Why can it be hard to divide with fractions or an integer for the dividend and a fraction for the divisor and no reciprocal of the divisor used?
1d
reviewed Close Find the limit, if it exists: x(e^x + 1/x) as x approaches 0. Choices: (A) 0 (B) 1 (C) 2 (D) the limit does not exist (E) None of these
1d
reviewed Close Find an equation of the straight line
1d
answered finding reflexive, symmetric, transitive, anti-symmetric and equivalence classes
1d
comment finding reflexive, symmetric, transitive, anti-symmetric and equivalence classes
Well, sure, but that's just the definition of what a symmetric relation is. You haven't really used the definition of the relation at all.
1d
comment How do I prove that $\sum_{k=1}^{b-1} [k \frac{a}{b}] = \frac{(a-1)(b-1)}{2}$?
Are you sure? Because I don't think the equation is valid as stated.
1d
comment Breaking Ties Alphabetically Using Kruskal's Algorithm
So what exactly is your question, then? If Kruskal's algorithm produces a minimal spanning tree no matter how you break the tie, what are you asking?
1d
answered Irrational numbers and proving constant functions
1d
comment finding reflexive, symmetric, transitive, anti-symmetric and equivalence classes
For b), where do you get confused? Do you understand what "eventually equal" means?