5,667 reputation
1748
bio website
location
age
visits member for 2 years, 10 months
seen yesterday

"You have enemies? Good. That means you've stood up for something, sometime in your life" - Winston Churchill


May
19
comment Help Understanding Solution? (Putnam and Beyond)
Doesn't this book also provide solutions. (Solution to your question on page 367)
May
19
comment Mid-step in solving a pde
@morphism it was a silly error, I corrected it.
May
19
revised Mid-step in solving a pde
deleted 1 characters in body
May
18
comment Approximation for $\pi$
What are you expecting, validation of this approximation and some sort of variation of this approximation?
May
18
comment Approximation for $\pi$
Another interesting discussion (related) here math.stackexchange.com/questions/108510/…
May
18
answered Mid-step in solving a pde
May
18
comment Generalizing an approach to proving AMGM
Instead of going so far (generalizing), why don't you try for $n=4$ and share your answer
May
18
comment Mid-step in solving a pde
$\int 2y dy = y^2$ , you should correct that
May
17
comment Rearranging a formula
Wow! I got two downvotes on this one. (Unpleasant wow!)
May
17
revised one more clock related challenge!
added 6 characters in body
May
16
comment Rearranging a formula
I like this algebraic approach!
May
16
comment Rearranging a formula
@AmericoTavers Thanks. You have given a complete algebraic solution. My +1 for that answer.
May
16
comment Rearranging a formula
I think if it is not specified what $a$ and $b$ are people are entitled to give different approach to solving a problem. (There is not only one way to look at a problem)
May
16
revised Rearranging a formula
edited body
May
16
answered Rearranging a formula
May
14
answered Evaluating $\int y^4(1-y)^3 dy$ using integration by parts
May
14
comment How to find out what changes applied to integral?
Substituting $x=-8u+2u^2$ could get somewhat close to what you are expecting, but not exactly the expression you have.
May
14
comment Vertices required to construct a graph with at least $500$ edges
It should be $n \geq 33$ not $32$
May
14
comment Vertices required to construct a graph with at least $500$ edges
And $n\choose2$ $\geq$ $500$ will give you $n \geq 32$
May
14
comment Vertices required to construct a graph with at least $500$ edges
If there are $n$ vertices, pick a vertex and see how many vertices can be connected to that ? $n-1$? Each of the $n$ vertices are connected to $n-1$ in $n(n-1)$ ways, but you are counting each connection twice, therefore total connections should be $\frac{n(n-1)}{2}$ which is $n\choose2$