can a problem ever be harder to verify than it is to solve?

[solid lagoon]

intuitively, no, since then the easiest way to verify, say, problem A, would then be to solve it.

is it then a sufficient proof that the solution to A must then be at least as hard as the fastest way to verify A? since if there exists a faster way to solve A, then there also exists a faster way to verify A.

[snow bolt]

1. Do not ping the Moderators, unless someone is breaking the rules.
2. Do not ping the Helper Moderators, unless there is a conflict between helpers.
3. Do not ping other members randomly for help.
4. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
5. Wait patiently for a helper to come along.
6. If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:

+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[stark acorn]

@solid lagoon

:HelpIcon:| Help Reminder

Hello .alphanumericusername, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.

[solid lagoon]

+close

[stark acorn]

Do you still want to close your help request?

No eligible helpers were found in this thread. You can still close this post if you don't require helper any longer.