82 reputation
5
bio website
location
age
visits member for 1 year, 5 months
seen May 27 '13 at 21:28

Dec
9
accepted Using the pigeonhole principle to prove there is at least two groups of people whose age sums are the same.
Dec
9
comment Using the pigeonhole principle to prove there is at least two groups of people whose age sums are the same.
OH! So there are 1001 pigeonholes and 1024 pigeons! Got it! Thank you Brian!
Dec
9
comment Using the pigeonhole principle to prove there is at least two groups of people whose age sums are the same.
@BrianM.Scott, ooh alright, so the 1024 subsets are the pigeons, but what would be the pigeonholes? All the possible sums?
Dec
9
comment Using the pigeonhole principle to prove there is at least two groups of people whose age sums are the same.
So the max sum of ages is 1000 ( ten people and they all can be 100 yrs. old). And the number of subsets is 2^(10) - 1?
Dec
9
asked Using the pigeonhole principle to prove there is at least two groups of people whose age sums are the same.
Dec
9
comment Having a forest and making it into a tree?
Thanks again! I really appreciate your help!
Dec
9
awarded  Supporter
Dec
9
accepted Having a forest and making it into a tree?
Dec
9
comment Having a forest and making it into a tree?
Lol, thanks Brian! One question though... How did you know that m=10?
Dec
8
comment Having a forest and making it into a tree?
Well, we can have 100 trees (just a dot) in a forest at most, but we also have 90 edges.. So if we add 1 edge to each of those trees, then we will have 50 trees in the forest, but we will have 50 edges..
Dec
8
asked Having a forest and making it into a tree?
Dec
8
comment Planar Graphs with at least $2$ vertices and degrees at most $5$
Suppose every vertex, with at most one exception, has degree at least 6. Then, 2E =< 2(3V-6) = 6V-12; Sum (deg V) >= 6(V-1) = 6V-6; We see that 6V-12 > 6V-6, thus there are at lease two vertices whose degrees are at most 5. Is this the solution? I still can't see how we have two vertices that are at most 5.
Dec
8
comment Planar Graphs with at least $2$ vertices and degrees at most $5$
So would the at most one exception be less than 6?
Dec
7
awarded  Scholar
Dec
7
accepted Planar Graphs with at least $2$ vertices and degrees at most $5$
Dec
5
asked Planar Graphs with at least $2$ vertices and degrees at most $5$
Oct
22
awarded  Student
Oct
22
asked How do I determine Heavy Tails on an empirical distribution?