Conversation so far:
when is a decision problem said to be polynomially reversible
The Boolean satisfiability problem is complete for the class NP of decision problems under polynomial-time reducibility.
How is a decision problem used to determine a prime number?
It is possible to effectively decide whether a given natural number is prime by testing every possible nontrivial factor.

Question: Would the process be the same in divisiblity?
Self-contained rewrite: How is a decision problem used to determine whether a number is divisible?