118 reputation
513
bio website
location
age
visits member for 2 years, 4 months
seen May 26 at 23:37

This site and the helpful people on it are quite awesome!


Jul
2
awarded  Curious
Feb
21
revised Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
added 73 characters in body
Feb
21
revised Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
added 67 characters in body
Feb
21
comment Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
I just introduced n to make it easier to see that a divides b at the end. It's completely logical. If it's not clear, please explain what isn't clear and I can help you see it. I made a lemma section that helps bring it in.
Feb
21
awarded  Teacher
Feb
21
revised Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
added 311 characters in body
Feb
21
revised Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
added 311 characters in body
Feb
21
answered Show that for all integers $a$ and $b$ if $a\mid b$ then $a^2\mid b^2$
Feb
21
comment Combinatorial problem: Directed Acyclic Graph
I thought the colouring theorem was about adjacent colours not touching, and your comment cleared up how to connect the ideas for me. I had to read a couple times to get it. Thanks ^_^
Feb
19
comment Combinatorial problem: Directed Acyclic Graph
Casteels, where did you get the "Now, let G be a graph ..." and Theorem from? I don't see that in Stanley's paper
Feb
19
comment Combinatorial problem: Directed Acyclic Graph
Yes! I think so
Feb
19
awarded  Benefactor
Feb
19
asked How do I apply vertex or edge coloring to my DAG problem?
Feb
19
comment Combinatorial problem: Directed Acyclic Graph
Ah I see the edge coloring's next description is no two vertices have an edge of the same color. So the method I proposed won't work. Any idea how to apply either the vertex or edge coloring?
Feb
19
comment Combinatorial problem: Directed Acyclic Graph
Wow great answer! I have been working through it. I really appreciate it. I have a question I have been wondering about: How does the edge coloring or vertex theorems relate to my edge direction problem? Do I have one color for every vertice? If I color them by # of incoming and # of outgoing edges, I run into conflicts where two colors are next to each other. I could color the edge by whether it is incoming or outgoing, but how do I decide that? I suppose I could do it by the # of bits since one vertice's name will always have a higher number of bits associated with it
Feb
11
awarded  Promoter
Feb
7
comment Combinatorial problem: Directed Acyclic Graph
Maybe. I am looking for unique orientations (ie: relabel the graph, is the structure the same as an already found structure?)
Feb
7
asked Combinatorial problem: Directed Acyclic Graph
Sep
14
awarded  Notable Question
May
7
awarded  Notable Question