This repository has been archived by the owner on Dec 7, 2021. It is now read-only.
Improve inequality for "a" in Shor's Algorithm documentation #1133
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary
The argument "a" can be written more succinctly. I reworded the description to use the inequality rather than stating a separate minimum value.
Details and comments
I believe incorporating all restrictions in one inequality is easier to understand. In addition, it sounds better to say "any integer" rather than "a random integer" because there may exist methods of choosing a more effective "a" for period finding.
a: Any integer that satisfies 2 ≤ a < N and gcd(a, N) = 1.