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:10
For the given quadratic equation convert into vertex form, find the vertex and find the value for x=6 y=-2x^2+2x+2
Answers: 2
question
Mathematics, 21.06.2019 14:40
3× __ -2=15 7 2× __+1=7 5 7× =22 15 5× __+10=2 8 × __+4=20 6 × =10 3 × __+2=8 6 × __+8=8 9 × __+7=20 6
Answers: 3
question
Mathematics, 21.06.2019 16:40
How do i get my dad to stop making me gargle his pickle i want my mom to gargle my pickle not my dads
Answers: 3
question
Mathematics, 21.06.2019 17:30
Given the points a(-2, 1) and b(8, 6), find the coordinates of the point c on directed line segment ab, that partitions ab in the ration 2: 3.
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
Mathematics, 21.03.2020 11:15
question
Mathematics, 21.03.2020 11:16