My question Coming up with a rigorous definition for a Riemman-like sum which is easier to compute? has been downvoted twice. Is it because:
a) My question is too similar to this question?
b) I ask to many meta stack questions?
c) My question is unclear. (In that case, what exactly is unclear? Is it the sub-interval? The partition? The counting function of $n\prime$?)
d) The previous question was already understood. In that case, how do I improve the definition? It is clearly not rigorous.