37 reputation
14
bio website
location
age
visits member for 1 year, 5 months
seen Mar 14 '13 at 5:08

delete


Mar
26
awarded  Notable Question
Jun
24
awarded  Popular Question
Mar
4
awarded  Supporter
Feb
14
comment The Least Upper Bound and The Greatest Lower Bound
Thank you so much for your help! I do not get a lot of examples in class, so this is really helps me to undertand.
Feb
14
comment The Least Upper Bound and The Greatest Lower Bound
Thank you for your explanation, this is very helpful. I'll work on some more problems for practice.
Feb
14
accepted The Least Upper Bound and The Greatest Lower Bound
Feb
14
asked The Least Upper Bound and The Greatest Lower Bound
Nov
7
awarded  Student
Nov
7
comment Largest independent Set of $C_n$
Thank you for the link and your help!
Nov
7
accepted Largest independent Set of $C_n$
Nov
7
comment Largest independent Set of $C_n$
This makes a lot sense than my class notes. I do not know the floor function. Is it common function to use for discrete mathematics?
Nov
7
awarded  Scholar
Nov
7
accepted Powers of Adjacency Matrix (Determination of connection in Graph)
Nov
7
comment Powers of Adjacency Matrix (Determination of connection in Graph)
This is very helpful. Thank you so much!
Nov
7
asked Largest independent Set of $C_n$
Nov
7
comment Powers of Adjacency Matrix (Determination of connection in Graph)
So say nth power of adjacency is a connected graph. Start with base step that saying when n=1, (P(n) (any nth power of adjacency matrix determines n-th connection in graph), P(1)=A^1 is true (Which means graph is connected, and nth tells length). And go to induction step that P(n)=A^n is true then P(n+1)=A^(n+1) is also true?
Nov
7
asked Powers of Adjacency Matrix (Determination of connection in Graph)