601 reputation
819
bio website soandos.wordpress.com
location Binghamton, NY
age 22
visits member for 3 years, 4 months
seen Sep 10 at 8:48

Student.

Third to earn the marshal badge on SuperUser

profile for soandos on Stack Exchange, a network of free, community-driven Q&A sites

profile for soandos on Project Euler, which exists to encourage, challenge, and develop the skills and enjoyment of anyone with an interest in the fascinating world of mathematics.


Jun
2
comment Evaluate $ \binom{n}{0}+\binom{n}{2}+\binom{n}{4}+\cdots+\binom{n}{2k}+\cdots$
Ok, so they are both exactly half the of the row (they get every element once as opposed to twice). Since the sum of a row is 2^n, this gives 2^(n-1) as the answer.
Jun
2
comment count the number of subsets
Got it, thanks.
Jun
2
accepted count the number of subsets
Jun
2
answered Evaluate $ \binom{n}{0}+\binom{n}{2}+\binom{n}{4}+\cdots+\binom{n}{2k}+\cdots$
Jun
2
comment Expanded concept of elementary function?
There are functions that are defined by sums and products, in addition to those defined by integrals.
Jun
2
comment count the number of subsets
And the elements of A are sub-sub-sets and so are not counted?
Jun
2
comment count the number of subsets
Why isn't every element also a subset?
Jun
2
comment count the number of subsets
@ShreevatsaR I don recall if there were letter there or numbers, but I assume that that also would not matter. Why is my answer wrong?
Jun
2
comment count the number of subsets
That was the way the question was phrased. What would make more sense?
Jun
2
asked count the number of subsets
Jun
1
comment Odds of winning at minesweeper with perfect play
@Joshua perfect play can mean making guesses. Thats the point of the question. What are the odds that you will win (not 1, as some guessing may be required)?
Jun
1
comment Odds of winning at minesweeper with perfect play
@Chris Eagle Agreed, I guess I was hasty. So the conclusion is that its basically impossible to figure out?
Jun
1
comment Odds of winning at minesweeper with perfect play
Thanks the kind of thing i was looking for.
Jun
1
comment Odds of winning at minesweeper with perfect play
So how many of those configurations can there be, and what are the odds of getting out of them is the question
Jun
1
comment Odds of winning at minesweeper with perfect play
If there is a square that cannot be solved, there it becomes and odds thing. If it can be solved and its just a matter of runtime i dont care about it. Reminds me a bit of the game of life.
Jun
1
comment Odds of winning at minesweeper with perfect play
My question is why though. (I do know what NP means, but it would seem to me (not that means a lot) that since one only has to consider a relatively constant number of blocks to advance, then as the grid gets bigger, this process has to be done more times. But not some power more, just linearly more)
Jun
1
comment Odds of winning at minesweeper with perfect play
Because the only thing that matters is how many unsolvable (need guessing) configurations are there with n mines in m space and what are the odds of solving them.
Jun
1
revised Odds of winning at minesweeper with perfect play
added 254 characters in body
Jun
1
comment Odds of winning at minesweeper with perfect play
And as a not so significant aside, people can do this pretty quickly with simple logic for a decently large sized board (expert) without making mistakes, so I am not sure what the author of the paper was talking about when he said all solvers are slow...
Jun
1
comment Odds of winning at minesweeper with perfect play
I am not looking for the best possible algorithm. I just want to know the odds of winning perfect play. Not how to win with the least total computation and the fanciest heuristics. It think it got sidetracked