meta user
network profile
| bio | website | |
|---|---|---|
| location | Allahabad, India | |
| age | ||
| visits | member for | 1 year, 9 months |
| seen | Dec 30 '12 at 4:37 | |
| stats | profile views | 42 |
Student of B.Tech (Information Technology) at Indian Institute of Information Technology, Allahabad.
|
Oct 17 |
comment |
Casio fx 991ms Factorial I've casio fx-991ES and it has a button for factorial. If your calculator supports factorial computation it must have a key for that :) |
|
Oct 13 |
comment |
Number of ways to write 5 digit number with restriction? thanks, got it. I don't know why I treated this as a tough problem :( |
|
Oct 13 |
accepted | Number of ways to write 5 digit number with restriction? |
|
Oct 13 |
awarded | Commentator |
|
Oct 13 |
comment |
Number of ways to write 5 digit number with restriction? we can't use 0 at first place as it will make a 4 digit number. 0 can be used anywhere else. |
|
Oct 13 |
asked | Number of ways to write 5 digit number with restriction? |
|
Oct 6 |
comment |
Finding eigenvalues of matrix of matrix. yes, you were right. I was thinking this as a matrix of matrix and so couldn't figure out hint. thanks :) |
|
Oct 6 |
accepted | Finding eigenvalues of matrix of matrix. |
|
Oct 6 |
comment |
Finding eigenvalues of matrix of matrix. Can I ask for a little more hint? |
|
Oct 5 |
asked | Finding eigenvalues of matrix of matrix. |
|
Aug 1 |
accepted | Number of paths in regular graphs, where starting and ending nodes are same |
|
Aug 1 |
comment |
Number of paths in regular graphs, where starting and ending nodes are same I'm little bit weak at graphs so would you please explain what does it stands for taking nth power of adjacency matrix and then looking at diagonal element. |
|
Aug 1 |
asked | Number of paths in regular graphs, where starting and ending nodes are same |
|
Mar 16 |
comment |
Proving $\sum_{k=1}^n k\cdot k! = (n+1)!-1$ without using mathematical Induction. @MattN.: thanks for the valuable information. |
|
Mar 16 |
comment |
Proving $\sum_{k=1}^n k\cdot k! = (n+1)!-1$ without using mathematical Induction. @All: Does closing the question means that there couldn't be proofs without induction and hence there should be no new answers so the question isn't open for discussion anymore? |
|
Mar 15 |
comment |
Proving $\sum_{k=1}^n k\cdot k! = (n+1)!-1$ without using mathematical Induction. @BillDubuque: Actually sometimes ago, on stackoverflow.com some people told me that not accepting the answers would decrease my acceptance percentage and people don't pay much attention towards those who have low acceptance rate. From then onwards, I always select one of the answers as accepted one. |
|
Mar 15 |
asked | Proving $\sum_{k=1}^n k\cdot k! = (n+1)!-1$ without using mathematical Induction. |
|
Mar 14 |
answered | Help Needed To Prove A Trigonometric Identity |
|
Mar 14 |
awarded | Supporter |
|
Mar 14 |
comment |
counting the patterns thanks Brian, I was having a hard time in finding these recurrences and I don't have enough reputation to vote up your answer :( |
