Mathematics, 14.09.2019 04:30 imamador6396
If 2^n + 1 is an odd prime for some integer n, prove that n is a power of 2. (h
Answers: 2
is an odd prime but n is not a power of 2. Then, there exists an odd prime number p such that 
. Then, for some integer 
,
and an odd positive number 
,
.
we have that 
is not a prime number, which is a contradiction.
Another question on Mathematics
Mathematics, 21.06.2019 14:30
Geometry: determine whether segment mn is parallel to segment kl. justify your answer. jm 6 mk 3 jn 8 nl 4
Answers: 1
Mathematics, 21.06.2019 15:30
Franco wants to double the volume of the cone. what should he do?
Answers: 2
Mathematics, 21.06.2019 22:00
Worth 100 points need the answers asap first row -x^2 2x^2 (x/2)^2 x^2 x is less than 2 x is greater than 2 x is less than or equal to 2 x is greater than or equal to 2 second row -5 -5/2 4 5 •2 is less than x& x is less than 4 •2 is less than or equal to x & x is less than or equal to 4 •2 is less than or equal to x& x is less than 4 •2 is less than x& x is less than or equal to 4
Answers: 1
You know the right answer?
If 2^n + 1 is an odd prime for some integer n, prove that n is a power of 2. (h...
Questions
Social Studies, 13.03.2020 01:15
Mathematics, 13.03.2020 01:15
Mathematics, 13.03.2020 01:15
Computers and Technology, 13.03.2020 01:15
Mathematics, 13.03.2020 01:16
Mathematics, 13.03.2020 01:16
Biology, 13.03.2020 01:16
