@gimusi Please don't solicit other users to attend to a post from four years ago, by pinging them to do your bidding. You can go to CRUDE, and identify the question you have problems with, but please do not target specific answerers, which you certainly did, in finding that post: a question I answered, as verified by you in my profile.
If you currently encounter a question (comes up in the review queue, or as you are evaluating incoming questions) that you object to, that's when to act. But to open a user's profile, to examine closely the questions they've answered years ago, and try to humiliate them, is, I believe, against the CoC. Stop targeting users you are angry with. Focus on poor questions as you encounter them, not as you hunt down as they appear in users that you don't like profile.
There is a well-known algorithm for decomposing any given permutation as a product of (not necessarily disjoint) $2$-cycles/transpositions. Such a decomposition of a given $f\circ g$ would, in general, give strong hints about (if not completely determine) the nature of $f$ and $g$.
Why?
Because...
@gimusi in respect of this: chat.stackexchange.com/transcript/message/47992294#47992294 I actually like that question but completely the wrong answers have all the upvotes in my opinion. And one of the answers is a "hint" and not even an answer.
Are the closure reasons not perhaps swayed to some degree by it not being maths of the "right" level?
But the answer by imu96 is good and helpful, maybe we can instead vote that up?
I can't help but feel it would be good to accommodate questions like this and use them to signpost to the concept of place value and rounding off infinitely many zeroes
Not sure what happend to my suggestion but I thought this was a good question: math.stackexchange.com/questions/746859 and wondered if closure was down to the "level" of the question rather than the content. Could it make a good signpost to some content about place value or rounding off infinitely many zeroes? The answer by imu96 is good and maybe it would be better to upvote the good answers rather than remove the question.
There is a well-known algorithm for decomposing any given permutation as a product of (not necessarily disjoint) $2$-cycles/transpositions. Such a decomposition of a given $f\circ g$ would, in general, give strong hints about (if not completely determine) the nature of $f$ and $g$.
Why?
Because...
