« first day (206 days earlier)      last day (2277 days later) » 

Prashin Jeevaganth
Prashin Jeevaganth
03:51
@user21820

A: prove that any non-trivial tree actually has at least two vertices of degree one.
B: prove that every simple graph with at least two vertices has two vertices of the same degree

Does proving B first immediately make A trivial in the fact that we could classify a non-trivial tree as a simple graph, and by substitution, A is true?
 
3 hours later…
user21820
user21820
07:15
@PrashinJeevaganth Obviously not.
Prashin Jeevaganth
Prashin Jeevaganth
07:34
not all non-trivial trees is a simple graph?
@user21820 I don't get it why not?
all trees are simple graphs right ...
user21820
user21820
@PrashinJeevaganth Yes but your claim is false.
Prashin Jeevaganth
Prashin Jeevaganth
@user21820 by using B, every non-trivial tree has 2 vertices of same degree, and because every tree has at least a vertex of degree 1, we definitely have 2 vertex of degree 1
user21820
user21820
@PrashinJeevaganth Basic logical error. Write it out in logical form.
Prashin Jeevaganth
Prashin Jeevaganth
@user21820 do you mean the end product is impossible or there are gaps that need to be filled in
user21820
user21820
Neither.
Totally wrong proof.
Prashin Jeevaganth
Prashin Jeevaganth
07:44
oh ok ...
I will skip this for now
 
11 hours later…
tarit goswami
tarit goswami
19:01
How I need to show that this conclusion is true?
Check the validity of the following argument:
(1) If I try and I have talent then I can be a Mathematician.
(2) If I become a Mathematician, then I will be happy.
-------------------------------------------------------------------
Therefore, if I will not be happy, then I did not try hard or I do not have talent.

« first day (206 days earlier)      last day (2277 days later) »