Adel

less info
meta site favicon meta user | stack exchange network profile network profile
245 reputation
19
bio website
location New Orleans, LA
age
visits member for 1 year, 8 months
seen Jan 31 at 16:23
stats profile views 54

I like time-saving.


110 Actions

suggestions reviews revisions comments badges posts accepts all
Mar
21
 awarded  Popular Question
Sep
12
 awarded  Yearling
May
10
 revised How do I accurately count the integers(1-1000) that are not divisible by 3,4,5,6?
added 51 characters in body
May
10
 asked How do I accurately count the integers(1-1000) that are not divisible by 3,4,5,6?
May
9
 accepted What is the method to compute $\binom{n}{r}$ in a recursive manner?
May
9
 comment What is the method to compute $\binom{n}{r}$ in a recursive manner?
Thank You So Much Gigi!
May
9
 accepted What is the size of partitions versus subsets?
May
9
 asked What is the size of partitions versus subsets?
May
9
 suggested suggested edit on solving Differential Equation
May
9
 comment What is the method to compute $\binom{n}{r}$ in a recursive manner?
@J.M. - Yes, but I must solidify my friendship with that neat triangle
May
9
 revised What is the method to compute $\binom{n}{r}$ in a recursive manner?
added 109 characters in body; edited title
May
9
 comment What is the method to compute $\binom{n}{r}$ in a recursive manner?
@Gigili - OK I need to update my question - Thank You Very Much
May
9
 revised What is the method to compute $\binom{n}{r}$ in a recursive manner?
deleted 58 characters in body; edited title
May
9
 comment What is the method to compute $\binom{n}{r}$ in a recursive manner?
@J.M. - Yes, the binomial coefficient - I don't know how to fix it though :\
May
9
 asked What is the method to compute $\binom{n}{r}$ in a recursive manner?
Apr
25
 comment How to show that every connected graph has a spanning tree, working from the graph “down”
Thank you very much Marcel!
Apr
24
 comment How to show that every connected graph has a spanning tree, working from the graph “down”
Thanks so much Christian. Is "upwards" being used figuratively though? Actually the problem said to prove it in two ways, my partner in class is doing the "upwards" part .
Apr
24
 accepted How to show that every connected graph has a spanning tree, working from the graph “down”
Apr
24
 comment What is the most basic graph, and how would you use it in an induction-proof?
from abstract - The graph with no points and no lines is discussed critically. Arguments for and against its official admittance as a graph are presented. This is accompanied by an extensive survey of the literature. Paradoxical properties of the null-graph are noted. No conclusion is reached.
Apr
24
 comment What is the most basic graph, and how would you use it in an induction-proof?
@ChrisEagle - :) An insider math-joke(or no?) ilike it
1 2 3 4 5 6