Potential typo on video 16 - Modular Algebra - At the end of notebook Prime_Numbers #312
Unanswered
gonzalo-munillag
asked this question in
Course: Foundations of Private Computation
Replies: 1 comment 1 reply
-
@gonzalo-munillag yes you are correct, we are trying to test whether n is a composite number or a prime number. Good catch! |
Beta Was this translation helpful? Give feedback.
1 reply
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
"""
For random 𝑎 the probability for it not being a witness is 25%, therefore the probability of not finding 10 witnesses at random if 𝑎 is composite is 0.25^10, i.e. If no witnesses are found in 10 rounds, then the probability for 𝑎 being prime is 1−0.2510= 0.999999
"""
I think "a" should be "n" in the two last mentions of "a" above
"""
For random 𝑎 the probability for it not being a witness is 25%, therefore the probability of not finding 10 witnesses at random if n is composite is 0.25^10, i.e. If no witnesses are found in 10 rounds, then the probability for n being prime is 1−0.2510= 0.999999
"""
Beta Was this translation helpful? Give feedback.
All reactions