4,117 reputation
1130
bio website
location
age
visits member for 3 years, 11 months
seen yesterday

Feb
8
comment combinations $\sum_{k=1}^m kn_k=m!$
So, to put into words, you're trying to find the integer partitions of $m!$ into $m$ parts?
Feb
8
comment Find “n” using the following conditions.
My bad...I missed the '$P(x)$ is a polynomial of degree $3n$'
Feb
8
comment combinations $\sum_{k=1}^m kn_k=m!$
What is $n_k$? That's not a notation I'm familiar with if it is some function of $n$ and $k$.
Feb
8
comment Find “n” using the following conditions.
This doesn't seem possible. It looks like $P(k+3) = P(k)$, so $P(3n+1) = P(3n-2) = 1$ which is inconsistent with $P(3n+1) = 730$.
Jan
28
comment The Hexagonal Property of Pascal's Triangle
I haven't been ignoring you. I'm still thinking about all this.
Jan
26
comment We are learning about LU Decomposition .. because?
What can you use LU decomposition for? (solving a system of equations) Why can't you just invert the matrix and multiply on the other side? (you certainly can but it takes longer). Also you can do LU decomposition in-place. Which is what Amzoti's link says.
Jan
17
revised Has there been a rigorous analysis of Strassen's algorithm?
small style and emphasis rewrites.
Jan
15
reviewed Approve suggested edit on Small Combinatorical Question - Pigeonhole Principle Related
Jan
14
awarded  Custodian
Jan
14
reviewed Approve suggested edit on Find the slope of the tangent line $\ln(3y-5)+x=y^2$ at $(4,2)$
Jan
4
awarded  Pundit
Jan
4
comment ordering 3 couples in 3 rows
Is it three friends or six?
Dec
30
comment Bijection from ordered pairs of $[0,n]$
What's wrong with the Cantor pairing function? The bijection is infinite.
Dec
30
comment How to find coefficient of $x^8$ in $\frac{1}{(x+3)(x-2)^2}$
I think the OP wants a rational, not a floating point number.
Dec
26
comment General form for the series expansion of $e$
Does this mean that $$\sum_{n=1}^{\infty} \frac{n^k}{n!} = e \cdot B(k)$$ where B(k) is the number of set partitions of $k$?
Dec
26
revised Dealing with Generating Functions accurately
extra explanation
Dec
25
answered Dealing with Generating Functions accurately
Dec
24
comment How to list graphs systematically?
I think your restriction to 'not isomorphic graphs accidentally' is somehow just not possible. You may possibly mean not using particular machinery like group-theoretic counting arguments (Polya counting) but that is a different thing.
Dec
16
awarded  Nice Answer
Dec
7
comment comparison of simplex and shortest path method
@PeterSheldrick: I didn't follow the last run time mentioned $O(n^2 + n m)$, where it comes from (but it is obviously slower than Dijkstra's for a connected graph).