Visser’s Open Question 8.29 on restricted versus full division
Over weak arithmetic , let denote the full Euclidean division principle , and let denote its restriction to coprime pairs, namely the same assertion under the additional hypothesis . The problem asks whether proves ; equivalently, whether and have the same strength over .
Equivalent formulations
Does restricted Euclidean division for coprime pairs have the same strength as unrestricted Euclidean division over ?
References
- Equivalence of Restricted and Full Division — arXiv — Naoya Kato
Source: arXiv
Progress summary
An unrefereed preprint claims to settle the question by showing that restricted and full division have the same strength.
Visser’s Open Question asks whether restricted Euclidean division is as strong as unrestricted division in weak arithmetic. The latest preprint claims an affirmative answer over , but no independent assessment was found.
Recent preprint
Naoya Kato’s Equivalence of Restricted and Full Division claims a quotient-preserving reduction from arbitrary division instances to coprime pairs. If correct, this proves equivalence of restricted and full Euclidean division over and settles the question; the claim remains unverified.
Current status (as of October 2026): An unrefereed preprint claims the question is solved affirmatively over , but the result is not independently verified.
Sources
Solutions 0
No solutions have been posted yet.