subject
Mathematics, 30.07.2019 20:40 natalie2sheffield

11) suppose n is a large odd number. you calculate 2^ (n-1)/2==k (mod n), where k is some integer k ±1 (mod n) a) suppose k 1 (mod n). explain why this implies that n is not prime. b) suppose k 1 (mod n). explain how you can use this information to factor n.

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 14:00
Solve - pv + 40 < 65 for v solve 7w - 3r = 15 for r
Answers: 1
question
Mathematics, 21.06.2019 15:30
The ratio pv to nrt is plotted against pressure for ch4 at 0°c and 200°c. why does the curve for 0°c drop below the horizontal line for an ideal gas whereas the curve for 200°c does not?
Answers: 2
question
Mathematics, 21.06.2019 16:50
The parabola y = x² - 4 opens: a.) up b.) down c.) right d.) left
Answers: 1
question
Mathematics, 21.06.2019 17:30
Can someone me with this problem i don't understand i need
Answers: 2
You know the right answer?
11) suppose n is a large odd number. you calculate 2^ (n-1)/2==k (mod n), where k is some integer k...
Questions
question
Mathematics, 11.05.2021 16:00
question
Mathematics, 11.05.2021 16:00
Questions on the website: 13722363