Reputation
1,757
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
6 19
Impact
~36k people reached

Jun
10
awarded  Notable Question
Feb
4
awarded  Popular Question
Nov
16
awarded  Popular Question
Nov
15
awarded  Yearling
Nov
13
awarded  Promoter
Nov
11
asked Algorithm to compute fastest method of collecting $k$ re-spawning items which spawn at $n$ specified points
Oct
8
revised $\lfloor x\rfloor + \lfloor y\rfloor \leq \lfloor x+y\rfloor$ for every pair of numbers of $x$ and $y$
added 4 characters in body
Oct
8
answered $\lfloor x\rfloor + \lfloor y\rfloor \leq \lfloor x+y\rfloor$ for every pair of numbers of $x$ and $y$
Sep
5
awarded  Nice Question
Aug
13
awarded  Notable Question
Aug
7
comment Countability of Sets
@TomCollinge Look at the second paragraph of that article. Some books don't count finite sets as countable.
Jul
9
answered Calc 2: convergent of divergent sequences
Jul
2
awarded  Curious
Jun
21
awarded  Popular Question
Jun
4
answered Sum of $\mathbf{x}\mathbf{x}'\mathbf{x}\mathbf{x}'$ when $\mathbf{x}$ is a binary vector of length $n$
May
4
comment Let $G$ be a connected graph. If $G$ has no cut vertices, then G has no bridges.
@CharlesNosbig yeah, I would say that is the correct answer. Although if this is homework, it might be cool to mention that it does work for larger graphs.
May
4
revised Let $G$ be a connected graph. If $G$ has no cut vertices, then G has no bridges.
added 15 characters in body
May
4
comment Let $G$ be a connected graph. If $G$ has no cut vertices, then G has no bridges.
It does not. That is a counter example.
May
4
answered Let $G$ be a connected graph. If $G$ has no cut vertices, then G has no bridges.
Feb
5
awarded  Popular Question