I get 75% of the value of the upvote, sure. But I'd rather that most of the 25% curation rewards go back to the people who upvoted me rather than the pool.

@lieyu says that this comes from "Littlewood's Miscellany", which I managed to find on Google books: The same problem occurs in (3) and (4). There is an intuitive sense that you can draw from

This one? As the book says, "will probably not stand up to close analysis." There is no such thing as "infinitely probable."

I should probably stop using #programming until @ilovecoding fixes its bot not to upvote at minute 0, thereby burning the rewards.

I'm looking at just the case for voting on a post not authored by any of the players. This is unrealistic in other ways, for example, it ignores opportunity cost of voting on something else instead. Optimal

Yes, thank you.

This is incorrect, I think. These are the the payouts for an unresponsive strategy rather than always waiting for 15 minutes if you're not first.

Fixed the plus to minus, thank you. Will have to figure out if more accurately modeling the 15 minute interval makes any difference.

View this answer on Musing.io

View this question on Musing.io

Thanks for the pictures! I was in Prague back in 1994 with my college concert band ("wind orchestra", now), and remember seeing the castle and cathedral. I also remember that one of our venues

The key is to ask, what is the distribution of cards that can be drawn? As I stated above, it cannot be uniform over all of the infinite set of cards. We can't even answer a simple question like "what

I don't think you've explained the game well enough to get a correct answer. What does it mean "with total number of 10^n"? Is that the same n as the "two consecutive numbers"? What

⊥ gets a lot of use, it can be the NOR operator, or the bottom element in a lattice, or just "false". claims that there is a separate Unicode symbol for perpendicular, but it's not one by browser

A simple expression rewrite: { "start" : "A[+]; B[*]; X[exp]; Y[exp]; Z[exp]; B->A; B->X->C1; A->Y->C2; A->Z->C3; C1[17]; C2[34]; C3[19]; ", "M->P; M->A;

Another graph generated by iterating a simple rule: { "start" : "A--B", "A--B" : "A--C--B--D--A" }

Translation of a Tracery tutorial grammar into Soffit, from { "version" : "0.1", "start" : "X[#sentence#]", "X[#sentence#]" : "X0[The]; X1[#0]; X2[color];

Also, this display doesn't show the difference between merging A and B and just deleting B.

OK, I just copy/pasted the image tag from here, that seems to work.

Hm, I can't edit it in steemit because the front end doesn't like the "Recreational mathematics" tag due to the capital letter (and, if I get past that, probably the space.)