3 ms·
Nice work. Out of curiosity, how is the difficulty determined? I notice that some of the "hard" questions (inverting a 2x2 matrices or differentiating common fu
by n4r9 2y ago
Nice work. Out of curiosity, how is the difficulty determined? I notice that some of the "hard" questions (inverting a 2x2 matrices or differentiating common functions) are much easier than others (proving that no natural number has Euler totient equal to 14).
- viveknathani_ 2y agohi! right now, it is manually assigned after parsing the problems. i am figuring out a relative system for assigning difficulty automatically.
- n4r9 2y agoI don't envy you the task! You've probably thought about it a lot more than me, but I was wondering if you could add a "very hard" or "advanced" category. Or perhaps users could submit difficulty ratings as a percentage and you take the average.
- viveknathani_ 2y agoyou are right, user-submitted content can help too. but that would imply a difficulty setting based on all users who have participated instead of a globally agreeable difficulty value. if the smart ones find a hard problem to be easy and they are the only ones to attempt that problem, that problem would be marked as easy. on the "very hard"/"advanced" bit, feedback taken. thank you for writing your thoughts!
- ajkjk 2y agoI feel like the obvious answer is to let people vote on it, like an upvotes/downvotes system.
- ktallett 2y agoIMO, I think in the grand scheme of things proofs are always tricky so it generally would be in a higher difficulty no matter the problem. However in the category of number theory, that would be say an easier proof than some others.