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 13:30
In the equations, a and b represent the price per night for a room in hotel a and hotel b, respectively, w weeks after september 1 last autumn. what was the price per night in hotel a when it was equal to the price per night in hotel b? a = 240 − 20w b = 320 − 30w
Answers: 1
question
Mathematics, 21.06.2019 18:00
Me asap! what is the slope of this line? enter your answer in the box.
Answers: 2
question
Mathematics, 21.06.2019 19:30
Carlos spent 1 1/4 hours doing his math homework he spent 1/4 of his time practicing his multiplication facts how many hours to carlos been practicing his multiplication facts
Answers: 2
question
Mathematics, 21.06.2019 21:20
Do you mind if you guys me with this question i’m on number 8
Answers: 1
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
Advanced Placement (AP), 26.10.2020 17:10
question
Spanish, 26.10.2020 17:10
Questions on the website: 13722361